Package rgu.transport.algorithms.collections

package rgu.transport.algorithms.collections

Contains data structures used by algorithms.

Class	Description
BinaryMinHeap<E,K>	A minimum heap implemented as a binary heap.
Explorable<V,E>	An explorable graph-like structure.
Graph<V,E>	A mathematical graph.
Graph.Edge<V,E>	Record type representing an edge with its end points.
HashGraph<V,E>	A mathematical graph which uses an underling hashed representation of vertices.
HashGraph.Builder<V,E>	Builder class for HashGraph.
MinHeap<E,K>	A minimum heap priority queue.
TwoDTree<T extends TwoDTree.Point>	A 2D tree used as a nearest finder with a compatible metric.
TwoDTree.Point	Point usable by the 2D tree.