|
Class Summary |
| BinaryHeap |
Binary heap implementation of a priority queue. |
| DoubleHashingTable |
A probing hash table implementation of a LookupTable
with collisions resolved by double hashing. |
| LinkedList |
A simple implementation of singly linked lists. |
| PositiveWeightedGraph |
A class implementing shortest path algorithms for positively
weighted directed graphs. |
| ProbingHashTable |
An abstract class implementing the LookupTable interface
by means of a hash table. |
| ProbingHashTable.Entry |
A class of objects returned by iteration over entries. |
| QuadraticProbingTable |
A probing hash table implementation of a LookupTable
with collisions resolved by quadratic probing. |
| QueueArray |
An array implementation of a queue |
| QueueList |
A linked list implementation of a queue |
| SearchTree |
A class implementing binary search trees. |
| Sort |
A class providing static array sorting routines |
| StackArray |
An array implementation of a stack |
| StackList |
A linked list implementation of a stack |
| StrictBinaryHeap |
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. |
| WeightedGraph.Arc |
A public class returned by the arcs() iteration over arcs. |