See: Description
Interface  Description 

PrefetchIterator.NextElementFunctor<EE> 
A functor for the calculation of the next element.

WeightCombiner 
Binary operator for edge weights.

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.

FibonacciHeap<T> 
This class implements a Fibonacci heap data structure.

FibonacciHeapNode<T> 
Implements a node of the Fibonacci heap.

GenericFibonacciHeap<K,T> 
A Fibonacci heap data structure with a custom comparator.

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.

SupplierUtil 
Helper class for suppliers.

TypeUtil 
TypeUtil isolates typeunsafety so that code which uses it for legitimate reasons can stay
warningfree.

WeightedUnmodifiableSet<E> 
Implementation of a weighted, unmodifiable set.

Copyright © 2018. All rights reserved.