Package org.jgrapht.util
package org.jgrapht.util
Non-graph-specific data structures, algorithms, and utilities used by
JGraphT.
-
ClassDescriptionHelper 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.This class implements a Fibonacci heap data structure.Implements a node of the Fibonacci heap.Math Utilities.The
ModifiableIntegerclass wraps a value of the primitive typeintin an object, similarly toInteger.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 Pairinvalid input: '<'V,V> if Sun ever gets around to adding Pair to java.util.Binary operator for edge weights.