Non-graph-specific data structures, algorithms, and utilities used by JGraphT.
Interface Summary Interface Description DoublyLinkedList.ListNode<V>Container for the elements stored in a
DoublyLinkedList.ListNodeIterator<E> DoublyLinkedList.NodeIterator<E> PrefetchIterator.NextElementFunctor<EE>A functor for the calculation of the next element. WeightCombinerBinary operator for edge weights.
Class Summary 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. AVLTree<T>Implementation of the AVL tree data structure. AVLTree.TreeNode<T>Container holding the values stored in the tree. CollectionUtilUtility class to create
DoublyLinkedListimplements a doubly linked
Listdata structure, that exposes its
ListNodeswhere the data is stored in.
MathUtilMath Utilities. ModifiableIntegerThe
ModifiableIntegerclass wraps a value of the primitive type
intin an object, similarly to
PrefetchIterator<E>Utility class to help implement an iterator/enumerator in which the hasNext() method needs to calculate the next elements ahead of time. RadixSortSorts the specified list of integers into ascending order using the Radix Sort method. SupplierUtilHelper class for suppliers. TypeUtilTypeUtil isolates type-unsafety so that code which uses it for legitimate reasons can stay warning-free. UnmodifiableUnionSet<E>An unmodifiable live view of the union of two sets. VertexToIntegerMapping<V>Helper class for building a one-to-one mapping for a collection of vertices to the integer range $[0, n)$ where $n$ is the number of vertices in the collection. WeightedUnmodifiableSet<E>Implementation of a weighted, unmodifiable set.