All Classes and Interfaces

Class	Description
A234Tree<Key extends Comparable<Key>>	Simple implementation of 2-3-4-trees based on KTreeNode.
A234TreeExample	example: insert entries
A234TreeTest
AbstractEdge	Interface to edges of a graph.
AbstractGraph<Node extends AbstractNode,Edge extends AbstractEdge>	Interface to a graph.
AbstractNode	Interface to nodes of a graph.
AbstractPriorityQueue<T>	Interface for an ADT priority queue.
AbstractQueue<T>	Interface for an ADT queue.
AbstractStack<T>	Interface for an ADT stack.
AdjacencyMatrix<Edge>	Sparse adjacency matrix.
AdjacencyMatrixTest
AStarShortestPath	implementation of the A* algorithm
AtomicExpression	Superclass for data associated with a tree node.
AtomicExpression.Type	type identifiers returned by AtomicExpression.getType()
AVLTree<Key extends Comparable<Key>,Value>	Simple implementation of an AVL tree.
AVLTreeExample	example: insert entries and maintain balance
AVLTreeTest
BinarySearchTree<Key extends Comparable<Key>,Value>	Base class for a binary search tree.
BinarySearchTree.Visitor	visitor for traversing the tree in preorder
BinarySearchTreeExample	example: insert, remove, and restructure entries
BinarySearchTreeTest
BinaryTree<T>	Simple binary tree.
BinaryTreeTest
BinaryTreeTraversal<T>	Provide traversals of binary trees.
BinaryTreeTraversal	example: visualize binary tree traversal
BreadthFirstSearch	implements BFS
BTree<Key extends Comparable<Key>>	Simple implementation of B-trees based on KTreeNode.
BTreeExample	example: insert entries
BTreeTest
CollisionHandler<T>	Collision handling strategy in SimpleHashtable.
Colormap<T>	simple interface for color map
ColormapCount	color map for (small) positive integer counts
ColormapJet	map values in [minValue,maxValue] to color
CommonGraphvizDecorator	Interface for simple decorator with preset properties
Coordinate	Row/column coordinates (i,j).
DepthFirstSearch	Standard recursive implementation of depth first search.
DijkstraShortestPaths	implements Dijkstra's algorithm by defining DijkstraShortestPaths.priority(aud.example.graph.MyNode, aud.example.graph.MyEdge)
Divide	binary / operator: A/B
DList<T>	Implementation of a doubly linked list.
DListTest
DotViewer	Simple viewer for Graphvizable.
ExpressionParser	Simple expression parser.
ExpressionParser2	Same as ExpressionParser but using modified grammar to provide the usual left-associative expressions.
ExpressionTree	Tree representation of arithmetic expression.
ExpressionTreeExample	ExpressionTree: minimal example
ExpressionTreeTraversal	example: visualize expression tree traversal
GraphAM<Node extends AbstractNode,Edge extends AbstractEdge>	Graph implementation based on adjacency matrix.
GraphDemo	Demonstrate visualization of graph algorithms
GraphP88	undirected (weighted or unweighted )example graph (Sedgewick, Algorithms in Java.
GraphParser	Parse text to build graph.
GraphTest
Graphviz	Use GraphViz to render graph structures.
Graphvizable	Interface for GraphViz rendering.
GraphvizDecorable	Interface for decorating items of Graphvizable objects.
GraphvizDecorator	Decorator for items of Graphvizable objects.
Grid	Undirected graph that is defined implicitly by a regular 2d grid.
HashFunction<T>	interface for a hash function
HashMap<Key,Value>	Implementation of an unordered map based on a hash table.
HashtableExample	Simple framework for experiments with hash tables.
HashtableExample.HashString	Compute integer hash value from string.
HashtableExample.IdentityHash	Identity hash function.
HashtableExample.UniversalHash	Universal hash function parameterized as described in Goodrich and Tamassia. (Read the book chapter!)
IterativeDFS1	Iterative implementation of DFS.
IterativeDFS2	iterative implementation of DFS Traversal like DepthFirstSearch but as for IterativeDFS1 the order of processed edges differs and nodes are marked before being pushed.
IterativePreorderTraversal	example: transform recursive preoder traversal to iterative algorithm
KTreeNode<Key extends Comparable<Key>>	Node in a k-ary search tree.
LexicalScanner	Base class for a simple lexical scanner.
LexicalScanner.Rule	a rule for lexical scanner
MaxFlowExample	Example for computing the maximum flow using a Ford-Fulkerson type algorithm.
Minus	binary - operator: A-B
MyDecorator
MyEdge	edge with all possible attributes that we require ;-)
MyGraph	graph based on GraphAM
MyNode	node with all possible attributes that we require ;-)
Number	Node representing constant number.
Operator	Node representing operator in an expression tree.
PermutationIterator	Iterator over all permutations of length n.
Permutations	Generate permutations.
Plus	binary + operator: A+B
Power	binary power operator: A^B (also A**B)
PrimMinimumSpanningTree	implements Prim's algorithm by defining PrimMinimumSpanningTree.priority(aud.example.graph.MyNode, aud.example.graph.MyEdge)
PriorityFirstSearch	Priority first search implementation.
PriorityQueue<T>	Priority queue based on binary min-heap.
Queue<T>	Implementation of AbstractQueue as a (dynamically resized) circular buffer based on array.
QueueDL<T>	Impementation of AbstractQueue based on doubly linked list DList.
QueueTest
RedBlackTree<Key extends Comparable<Key>,Value>	Simple implementation of a red-black tree.
RedBlackTreeExample	example: insert entries and maintain balance
RedBlackTreeTest
RenderTree	Utility for rendering various trees.
RetroMaze	a really simple game, which lets you explore a maze...
RunTests
SimpleDecorator	Example for a simple decorator.
SimpleEdge	plain simple edge
SimpleHashtable<T>	Base class for simple hash tables (mainly for demonstration).
SimpleNode	plain simple node
SingleStepper	Simple framework for single stepping code.
SingleStepperDemo	Demonstrate use of SingleStepper
SList<T>	Implementation of a singly linked list.
SListTest
SparseMatrix<T>	Simple sparse matrix data structure.
SparseMatrixCS<T>	Simple sparse matrix data structure.
SparseMatrixCSTest
SparseMatrixTest
Stack<T>	Implementation of a stack based on Vector.
StackTest
SVGViewer	Simple SVG viewer based on Batik's SVGCanvas.
Symbol	Node representing a symbolic parameter, e.g., a variable.
SyntaxError	signals syntax error during parsing a term
Sys	System related utilities.
Terminal	Node represents a terminal AtomicExpression.
Terminal
Times	binary * operator: A*B
Tokenizer	Breaks input string into pieces ("tokens").
Tokenizer	Breaks input string into pieces ("tokens").
Traversal	interface for traversals of MyGraph
TraversalExample	graph traversal example
UnaryMinus	unary - operator: -A ("sign")
Vector<T>	Implementation of an array-based vector.
VectorTest
VerboseQueue<T>	A queue that outputs messages on VerboseQueue.enqueue(T) and VerboseQueue.dequeue().
VerboseStack<T>	A stack that outputs messages on push(T) and pop().