Hierarchy diagram


Classes

Class Description
AbstractContainer The AbstractContainer is the base class from which all concrete container classes are derived.
AbstractGraph The AbstractGraph class is the base class from which all concrete undirected and directed graph classes are derived.
AbstractGraph.CountingVisitor A counting visitor.
AbstractGraph.GraphEdge Represents an edge in this graph.
AbstractGraph.GraphVertex Represents a vertex in this graph.
AbstractHashTable The AbstractHashTable class is the base class from which all concrete hash and scatter table classes are derived. This abstract class provides default implementations for various methods declared in the HashTable interface.
AbstractPrePostVisitor The AbstractPrePostVisitor class is the base class from which all concrete pre/post visitor classes are derived.
AbstractQuickSorter The AbstractQuickSorter class is the base class from which all concrete quick sorter classes are derived.
AbstractSearchableContainer The AbstractSearchableContainer class is the base class from which all concrete searchable container classes are derived.
AbstractSet The AbstractSet class is the base class from which all concrete set and multiset classes are derived.
AbstractSolver The AbstractSolver class is the base class from which all concrete solver classes are derived.
AbstractSorter The AbstractSorter class is the base class from which all concrete sorter classes are derived. This abstract class provides default implementations for various methods declared in the Sorter interface.
AbstractTree The AbstractTree class is the base class from which all concrete tree classes are derived.
AbstractTree.Enumerator Implements an enumerator that enumerates the keys in this tree.
AbstractTree.PrintingVisitor A visitor that prints each object it visits.
AbstractVisitor The AbstractVisitor class is the base class from which all concrete visitor classes are derived.
Algorithms Various algorithms.
Association An association is a (key, value) pair that implements the IComparable interface.
AVLTree A node in an AVL tree.
BinaryHeap A priority queue implemented as a binary heap.
BinaryInsertionSorter Sorter for sorting an array of ComparableObject objects.
BinarySearchTree A node in a binary search tree.
BinaryTree A node in a binary tree.
BinomialQueue A mergeable priority queue implemented as a forest of binomial trees.
BinomialQueue.BinomialTree A node in a binomial tree.
Bounds Provides one static method to simplify array-bounds checking.
BreadthFirstBranchAndBoundSolver Branch-and-bound, breadth-first problem solver for searching tree-structures solution spaces.
BreadthFirstSolver Breadth-first problem solver for searching tree-structured solution spaces.
BTree A node in a B-tree.
BubbleSorter Sorter for sorting an array of ComparableObject objects.
BucketSorter Sorter for sorting an array of ComparableInt32s.
ChainedHashTable A chained hash table implemented using an array of linked lists.
ChainedScatterTable A chained hash table implemented using an array.
Circle A circular graphical object.
ComparableChar A concrete wrapper class that boxes an char as a ComparableValue.
ComparableDouble A concrete wrapper class that boxes an double as a ComparableValue.
ComparableInt32 A concrete wrapper class that boxes an int as a ComparableValue.
ComparableObject Abstract base class from which all objects that implement the IComparable interface are derived.
ComparableString A concrete wrapper class that boxes an string as a ComparableValue.
ComparableValue A concrete wrapper class that extends the ComparableObject class wraps an object that implements the IComparable interface.
Complex A complex number.
ContainerEmptyException Thrown when an attempting to get an object from an empty container.
ContainerFullException Thrown when an attempting to get an object from an empty container.
CopyrightAttribute Copyright notice attribute.
Deap A double-ended priority queue implemented as a binary heap.
DenseMatrix Dense matrix implemented using a two-dimensional array.
DepthFirstBranchAndBoundSolver Depth-first, branch-and-bound problem solver for searching tree-structured solution spaces.
DepthFirstSolver Depth-first problem solver for searching tree-structured solution spaces.
DequeAsArray A deque (double-ended queue) implemented using an array.
DequeAsLinkedList A deque (double-ended queue) implemented using a linked list.
DigraphAsLists A directed graph implemented using adjacency lists.
DigraphAsMatrix A directed graph implemented using an adjacency matrix.
DynamicArray An array of objects.
Enumerable Wrapper for IEnumerator that implements IEnumerable.
Example Various example methods.
Example.A A minimal Throwable class.
Example.Obj Object used to demonstrate parameter passing of references.
ExponentialRV Exponentially distributed random variable.
ExpressionTree Represents a binary expression as a binary tree.
GeneralTree A node in a general tree.
GraphAsLists An undirected graph implemented using adjacency lists.
GraphAsMatrix An undirected graph implemented using an adjacency matrix.
GraphicalObject The GraphicalObject class is the base class from which various concrete graphical object classes are derived.
HeapSorter Sorter for sorting an array of ComparableObject objects.
InOrder Adapter to convert a Visitor to a PrePostVisitor.
LeftistHeap A node of a mergeable priority queue implemented as a leftist tree.
LinkedList A linear, singly-linked list of objects.
LinkedList.Element An element of a linked list.
Matrix Encapsulates methods for manipulating a two-dimensional matrix of doubles.
MedianOfThreeQuickSorter Sorter for sorting an array of Comparable objects.
MethodNotImplementedException Thrown when an attempting to get an object from an empty container.
MultiDimensionalArray A multi-dimensional array of objects implemented using a one-dimensional array.
MultisetAsArray Multiset implemented using an array of ints.
MultisetAsLinkedList Multiset implemented using a linked list.
MWayTree A node in an M-way tree.
NaryTree A node in an N-ary tree.
OpenScatterTable Open scatter table implemented using an array.
OpenScatterTableV2 Open scatter table implemented using an array.
OrderedListAsArray An ordered list implemented using an array.
OrderedListAsArray.MyCursor A position in this ordered list.
OrderedListAsLinkedList An ordered list implemented using a linked list.
OrderedListAsLinkedList.MyCursor A position in this ordered list.
Parent Records some basic information about a parent.
PartitionAsForest A partition implemented as a forest of trees.
PartitionAsForest.PartitionTree A node in a partition tree.
PartitionAsForestV2 A partition implemented as a forest of trees.
PartitionAsForestV3 A partition implemented as a forest of trees.
Person Records some basic information about a person.
Polynomial Encapsulates methods common to all polynomials.
PolynomialAsOrderedList A polynomial implemented using an ordered list.
PolynomialAsSortedList A polynomial implemented using a sorted list.
PostOrder Adapter to convert a Visitor to a PrePostVisitor. Used in conjunction with various depth-first traversal routines to implement postorder traversal.
PreOrder Adapter to convert a Visitor to a PrePostVisitor.
QueueAsArray A queue implemented using an array.
QueueAsLinkedList A queue implemented using a linked list.
RadixSorter Sorter for sorting an array of ComparableInt32s.
RandomNumberGenerator A multiplicative linear congruential pseudo-random number generator.
Rectangle A rectangular graphical object.
ScalesBalancingProblem Represents a scales balancing problem.
ScalesBalancingProblem.Node A node in the solution space of a scales balancing problem.
ScalesBalancingProblem.Node.SuccessorEnumerator Enumerates the succesors of a node.
SetAsArray Set implemented using an array of bools.
SetAsBitVector Set implemented using a vector of ints.
SimpleRV A random variable uniformly distributed on the unit interval, (0,1).
Simulation A discrete-event simulation of an M/M/1 queue.
SortedListAsArray A sorted list implemented using an array.
SortedListAsLinkedList A sorted list implemented using an array.
SparseMatrix Encapsulates methods for manipulating a sparse, two-dimensional matrix of doubles.
SparseMatrixAsArray Sparse matrix implemented using arrays.
SparseMatrixAsLinkedList Sparse matrix implemented using an array of linked lists.
SparseMatrixAsVector Sparse matrix implemented using a vector of triples.
Square A square graphical object.
StackAsArray A stack implemented using an array.
StackAsLinkedList A stack implemented using a linked list.
StraightInsertionSorter Sorter for sorting an array of ComparableObject objects.
StraightSelectionSorter Sorter for sorting an array of ComparableObject objects.
Term A term in a polynomial.
TwoWayMergeSorter Sorter for sorting an array of ComparableObject objects.
UniformRV A random variable uniformly distributed on a specified interval, (u,v).
VersionAttribute Version attribute.
ZeroOneKnapsackProblem Represents a 0/1 knapsack problem.
ZeroOneKnapsackProblem.Node A node in the solution space of the problem.
ZeroOneKnapsackProblem.Node.SuccessorEnumerator Enumerates the succesors of a node.

Interfaces

Interface Description
Container Encapsulates methods common to all container classes.
Cursor Used to represent a position in an ordered list or a sorted list.
Deque Encapsulates methods common to all deques (double-ended queues).
Digraph Encapsulates methods common to all directed graph.
DoubleEndedPriorityQueue Encapsulates methods common to all double-ended priority queues.
Edge Encapsulates methods common to all graph edges.
Graph Encapsulates methods common to all graphs (both directed and undirected).
GraphicsPrimitives Encapsulates a simple set of primitive operations on graphical objects.
HashTable Encapsulates methods common to all hash tables.
MergeablePriorityQueue Encapsulates methods common to all mergeable priority queues.
Multiset Encapsulates methods common to all multisets.
OrderedList Encapsulates methods common to all ordered lists.
Partition Encapsulates methods common to all partitions.
PrePostVisitor Encapsulates methods implemented by visitors used in conjunction with various depth-first traversal methods.
PriorityQueue Encapsulates methods common to all priority queues.
Queue Encapsulates methods common to all (single-ended, FIFO) queues.
RandomVariable Encapsulates methods common to all random variables.
SearchableContainer Encapsulates methods common to all searchable container classes.
SearchTree Encapsulates methods common to all search trees.
Set Encapsulates methods common to all sets.
Solution Used to represent the nodes of the solution space of a problem.
Solver A solver is an abstract machine that solves a problem by exploring its solution space.
SortedList Encapsulates methods common to all sorted lists.
Sorter A sorter is an abstract machine that sorts an array of comparable objects.
Stack Encapsulates methods common to all stacks.
Tree Encapsulates methods common to the nodes of a tree.
Vertex Encapsulates methods common to all graph vertices.
Visitor Encapsulates methods implemented by visitors which are used in conjunction with containers as well as by various graph and tree traversal methods.

Structures

Structure Description
ChainedScatterTable.Entry Entry data structure
OpenScatterTable.Entry Entry data structure.
Point Represents a point in the Cartesian plane.

Enumerations

Enumeration Description
EntryState The states of an Entry.
Sex The sexes.