AdditionExample | |
b | |
BinaryHeap | A BinaryHeap is to be used as a priority queue |
BUCKET | Maintain count of entries in each bucket and array of entries |
Comparison | |
df | Core data structure to store all formatting information for the individual vertices for the graph being constructed |
EdgeLabel | Helper class for labeling edges |
el | An 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 |
elt | Element stored within the Binary Heap |
entry | |
Graph | Graph superclass to define common interface for Graph objects and provide ability to load up from a file |
GraphList | Representation of a graph using adjacency lists |
Newton | |
nl | A NODELIST is a linked list of (node, id) pairs where the node is a string associated with the node, and is an integer identifier |
node | Standard Binary tree data structure to use |
Search | |
SearchNull | |
stack_node | |
strElement | Structure of each individual element is a fixed block of characters |
Algorithm Development Kit 1.0