A functor for the calculation of the next element.
Binary operator for edge weights.
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.
Utility class to help implement an iterator/enumerator in which the hasNext() method needs to calculate the next elements ahead of time.
Sorts the specified list of integers into ascending order using the Radix Sort method.
Helper class for suppliers.
TypeUtil isolates type-unsafety so that code which uses it for legitimate reasons can stay warning-free.
An unmodifiable live view of the union of two sets.
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.
Implementation of a weighted, unmodifiable set.
Copyright © 2019. All rights reserved.