Module org.jgrapht.core

# Package org.jgrapht.util

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`

.DoublyLinkedList.ListNodeIterator<E> DoublyLinkedList.NodeIterator<E> PrefetchIterator.NextElementFunctor<EE> A functor for the calculation of the next element.WeightCombiner Binary 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.CollectionUtil Utility class to create`Collection`

instances.DoublyLinkedList<E> `DoublyLinkedList`

implements a doubly linked`List`

data structure, that exposes its`ListNodes`

where the data is stored in.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.RadixSort Sorts the specified list of integers into ascending order using the Radix Sort method.SupplierUtil Helper class for suppliers.TypeUtil TypeUtil 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.