Package DataStructures

Interface Summary

LookupTable<K,V>	A simple interface for a lookup table.
LookupTable.Entry<K,V>	A class of objects returned by iteration over entries.
PriorityQueue<E extends Comparable<? super E>>	Interface for a priority queue of elements of type E.
Queue<E>	A first-in-first-out (FIFO) queue of objects.
Stack<E>	A last-in-first-out (LIFO) stack of objects.

Class Summary

BinaryHeap<E extends Comparable<? super E>>	Binary heap implementation of a priority queue.
DoubleHashingTable<K,V>	A probing hash table implementation of a LookupTable with collisions resolved by double hashing.
LinkedList<E>	A simple implementation of singly linked lists.
ProbingHashTable<K,V>	An abstract class implementing the LookupTable interface by means of a probing hash table.
QuadraticProbingTable<K,V>	A probing hash table implementation of a LookupTable with collisions resolved by quadratic probing.
QueueArray<E>	An array implementation of a queue
QueueList<E>	A linked list implementation of a queue
SearchTree<E extends Comparable<? super E>>	A class implementing binary search trees for elements of type E.
Sort	A class providing static array sorting routines
StackArray<E>	An array implementation of a stack
StackList<E>	A linked list implementation of a stack
StrictBinaryHeap<E extends Comparable<? super E>>	Binary heap implementation of a priority queue, in which items of the same priority are removed in order of insertion.
WeightedGraph	A class implementing a weighted directed graph and shortest path algorithms for a positively weighted graph.
WeightedGraph.Arc	A public class returned by WeightedGraph.arcs().