See: Description
| Interface | Description |
|---|---|
| PrefetchIterator.NextElementFunctor<EE> | |
| WeightCombiner |
Binary operator for edge weights.
|
| Class | Description |
|---|---|
| ArrayUnenforcedSet<E> |
Helper for efficiently representing small sets whose elements are known to be
unique by construction, implying we don't need to enforce the uniqueness
property in the data structure itself.
|
| FibonacciHeap<T> |
This class implements a Fibonacci heap data structure.
|
| FibonacciHeapNode<T> |
Implements a node of the Fibonacci heap.
|
| MathUtil |
Math Utilities.
|
| ModifiableInteger |
The
ModifiableInteger class wraps a value of the primitive type
int in an object, similarly to Integer. |
| PrefetchIterator<E> |
Utility class to help implement an iterator/enumerator in which the hasNext()
method needs to calculate the next elements ahead of time.
|
| TypeUtil<T> |
TypeUtil isolates type-unsafety so that code which uses it for legitimate
reasons can stay warning-free.
|
| VertexPair<V> |
Representation of a pair of vertices; to be replaced by Pair<V,V> if
Sun ever gets around to adding Pair to java.util.
|
Copyright © 2015. All Rights Reserved.