Package org.jgrapht.util

Non-graph-specific data structures, algorithms, and utilities used by JGraphT.

See:
          Description

Interface Summary
PrefetchIterator.NextElementFunctor<EE>  
 

Class Summary
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 that which uses it for legitimate reasons can stay warning-free.
 

Package org.jgrapht.util Description

Non-graph-specific data structures, algorithms, and utilities used by JGraphT.