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.
This class implements a Fibonacci heap data structure.
Implements a node of the Fibonacci heap.
Utility class to help implement an iterator/enumerator in which the hasNext() method needs to calculate the next elements ahead of time.
TypeUtil isolates type-unsafety so that code which uses it for legitimate reasons can stay warning-free.
Representation of an unordered pair of vertices.
Representation of a pair of vertices; to be replaced by Pair<V,V> if Sun ever gets around to adding Pair to java.util.
Copyright © 2016. All rights reserved.