Algorithms_in_a_Nutshell Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
AdditionExample
b
BinaryHeapA BinaryHeap is to be used as a priority queue
BUCKETMaintain count of entries in each bucket and array of entries
Comparison
dfCore data structure to store all formatting information for the individual vertices for the graph being constructed
EdgeLabelHelper class for labeling edges
elAn EDGELIST is a linked list of (src,tgt) pairs where the src is a string associated with a file entry and tgt is a string associated with another file entry
eltElement stored within the Binary Heap
entry
GraphGraph superclass to define common interface for Graph objects and provide ability to load up from a file
GraphListRepresentation of a graph using adjacency lists
Newton
nlA NODELIST is a linked list of (node, id) pairs where the node is a string associated with the node, and is an integer identifier
nodeStandard Binary tree data structure to use
Search
SearchNull
stack_node
strElementStructure of each individual element is a fixed block of characters
Algorithm Development Kit 1.0