A B C D E F G H I K L M N O P Q R S T U V W X Y

N

NegativeWeightEdgeException - Exception in goldman.graph
The NegativeWeightEdgeException is thrown when a graph algorithm that should only be applied on a weighted graph without any negative weight edges (e.g., Dijkstra's single-source shortest path algorithm) whenever a negative weight edge that is encountered.
NegativeWeightEdgeException() - Constructor for exception goldman.graph.NegativeWeightEdgeException
 
NegativeWeightEdgeException(String) - Constructor for exception goldman.graph.NegativeWeightEdgeException
 
newInternalNode(Object) - Method in class goldman.collection.ordered.digitized.CompactTrie
 
newInternalNode(Object) - Method in class goldman.collection.ordered.digitized.TernarySearchTrie
 
newLeafNode(E, int) - Method in class goldman.collection.ordered.digitized.TernarySearchTrie
 
newListItem(E) - Method in class goldman.collection.positional.DoublyLinkedList
 
next() - Method in class goldman.collection.AbstractCollection.AbstractLocator
Moves the locator forward to the next element in the collection.
next() - Method in class goldman.collection.AbstractCollection.VisitingIterator
 
next() - Method in class goldman.collection.ordered.digitized.AbstractTrieLeafNode
 
next() - Method in interface goldman.collection.ordered.digitized.TrieLeafNode
Returns a reference to the next leaf node in the ordered leaf chain.
next() - Method in class goldman.NonMutatingIterator
 
nextDiscriminator(int) - Method in class goldman.collection.spatial.AlternatingComparator
 
nextIndex(int) - Method in class goldman.collection.positional.CircularArray
The next index is computed without regard to the contents of that slot.
noGreaterThan(E, E) - Method in class goldman.collection.spatial.AlternatingComparator
Two calls to this method, using the maximum and minimum corners of a multidimensional bounding box, are sufficient to determine whether a given element lies within the box.
NonMutatingIterator<T> - Class in goldman
The NonMutatingIterator wraps an iterator to prevent the user from calling the remove method.
NonMutatingIterator(Iterator<? extends T>) - Constructor for class goldman.NonMutatingIterator
 
NOT_FOUND - Static variable in class goldman.collection.AbstractCollection
 
numConnectedComponents() - Method in class goldman.graph.AbstractGraph
 
numConnectedComponents() - Method in interface goldman.graph.Graph
Returns the number of connected components in this graph.
numDigits(String) - Method in class goldman.collection.BitDigitizer
 
numDigits(T) - Method in interface goldman.collection.Digitizer
Returns the number of digits in the element x.
numDigits(IndexedNumber) - Method in class goldman.collection.IndexedNumber.NumberDigitizer
 
numDigits() - Method in class goldman.collection.IndexedNumber
 
numDigits(String) - Method in class goldman.collection.StringDigitizer
 
numDigits(TaggedElement<T, ?>) - Method in class goldman.collection.tagged.ordered.digitized.TaggedElementDigitizer
 
numMatches() - Method in class goldman.collection.ordered.digitized.CompressedTrie.CompressedTrieSearchData
 
numMatches() - Method in class goldman.collection.ordered.digitized.Trie.SearchData
 
numStronglyConnectedComponents() - Method in class goldman.graph.AbstractGraph
 
numStronglyConnectedComponents() - Method in interface goldman.graph.Graph
Returns the number of strongly connected components in this graph.
numVertices() - Method in class goldman.graph.AbstractGraph
 
numVertices() - Method in class goldman.graph.AdjacencyListRepresentation
 
numVertices() - Method in class goldman.graph.AdjacencyMatrixRepresentation
 
numVertices() - Method in interface goldman.graph.Graph
Returns the number of vertices in this graph.
numVertices() - Method in interface goldman.graph.GraphRepresentation
Returns the number of vertices in this graph.

A B C D E F G H I K L M N O P Q R S T U V W X Y