Package List

Here are the packages with brief descriptions (if available):

[detail level 12345]

▼Naud	AuD lecture: Data structures, algorithms, examples
►Nadt	Abstract data types
CAbstractPriorityQueue	Interface for an ADT priority queue
CAbstractQueue	Interface for an ADT queue
CAbstractStack	Interface for an ADT stack
►Nexample	Examples and demos
►Ndp	Dynamic Programming examples
CSeamCarvingDemo	Simple implementation of seam carving
►Nexpr	Example: parse and evaluate arithmetic expressions
►CAtomicExpression	Superclass for data associated with a tree node
CType	Type identifiers returned by getType
CDivide	Binary / operator: A/B
CExpressionParser	Simple expression parser
CExpressionParser2	Same as ExpressionParser but using modified grammar to provide the usual left-associative expressions
CExpressionTree	Tree representation of arithmetic expression
CExpressionTreeExample	ExpressionTree: minimal example
CExpressionTreeTraversal	Example: visualize expression tree traversal
CMinus	Binary - operator: A-B
CNumber	Node representing constant number
COperator	Node representing operator in an expression tree
CPlus	Binary + operator: A+B
CPower	Binary power operator: A^B (also A**B)
CSymbol	Node representing a symbolic parameter, e.g., a variable
CSyntaxError	Signals syntax error during parsing a term
CTerminal	Node represents a terminal AtomicExpression
CTimes	Binary * operator: A*B
CTokenizer	Breaks input string into pieces ("tokens")
CUnaryMinus	Unary - operator: -A ("sign")
►Ngraph	Demos of graph algorithms
CAStarShortestPath	Implementation of the A* algorithm
CBreadthFirstSearch	Implements BFS
CDepthFirstSearch	Standard recursive implementation of depth first search
CDijkstraShortestPaths	Implements Dijkstra's algorithm by defining priority
CGraphP88	Undirected (weighted or unweighted )example graph (Sedgewick, Algorithms in Java
CGraphParser	Parse text to build graph
CIterativeDFS1	Iterative implementation of DFS
CIterativeDFS2	Iterative implementation of DFS Traversal like DepthFirstSearch but as for IterativeDFS1 the order of processed edges differs and nodes are marked before being pushed
CMaxFlowExample	Example for computing the maximum flow using a Ford-Fulkerson type algorithm
CMyDecorator
CMyEdge	Edge with all possible attributes that we require ;-)
CMyGraph	Graph based on aud.graph.GraphAM
CMyNode	Node with all possible attributes that we require ;-)
CPrimMinimumSpanningTree	Implements Prim's algorithm by defining priority
CPriorityFirstSearch	Priority first search implementation
CRetroMaze	Really simple game, which lets you explore a maze... pardon: a graph
CTokenizer	Breaks input string into pieces ("tokens")
CTraversal	Interface for traversals of MyGraph
CTraversalExample	Graph traversal example
►Ngrid	Graph traversal on a uniform gird
►CGrid	Undirected graph that is defined implicitly by a regular 2d grid
CCell	Cell in a Grid
►Nhash	Simple hash for experimenting and visualization
CCollisionHandler	Collision handling strategy in SimpleHashtable
CHashFunction	Interface for a hash function
►CHashtableExample	Simple framework for experiments with hash tables
CDoubleHashing	Collision handling by double hashing using h2
CLinearProbing	Collision handling by linear probing h(x,i)=h(x)+i*b
CQuadraticProbing	Collision handling by quadratic probing h(x,i)=h(x)+i*b+i*i*c
CSimpleHashtable	Base class for simple hash tables (mainly for demonstration)
CA234TreeExample	Example: insert entries
CAVLTreeExample	Example: insert entries and maintain balance
CBinarySearchTreeExample	Example: insert, remove, and restructure entries
CBinaryTreeTraversal	Example: visualize binary tree traversal
CBTreeExample	Example: insert entries
CIterativePreorderTraversal	Example: transform recursive preoder traversal to iterative algorithm
CRedBlackTreeExample	Example: insert entries and maintain balance
CRenderTree	Utility for rendering various trees
CVerboseQueue	A queue that outputs messages on enqueue and dequeue
CVerboseStack	A stack that outputs messages on push and pop
►Ngraph	Graph data structures and algorithms
►Nmatrix	Sparse matrices for encoding adjacency
CCoordinate	Row/column coordinates (i,j)
CSparseMatrix	Simple sparse matrix data structure
CSparseMatrixCS	Simple sparse matrix data structure
CAbstractEdge	Interface to edges of a graph
►CAbstractGraph	Interface to a graph
CEdges	Defines iterator over all edges of anlink AbstractGraph}
CAbstractNode	Interface to nodes of a graph
CAdjacencyMatrix	Sparse adjacency matrix
CGraphAM	Graph implementation based on adjacency matrix
CSimpleEdge	Plain simple edge
CSimpleNode	Plain simple node
►Ntest	Unit tests based on JUnit 4
CA234TreeTest
CAdjacencyMatrixTest
CAVLTreeTest
CBinarySearchTreeTest
CBinaryTreeTest
CBTreeTest
CDListTest
CGraphTest
CQueueTest
CRedBlackTreeTest
CRunTests
CSListTest
CSparseMatrixCSTest
CSparseMatrixTest
CStackTest
CVectorTest
►Nutil	Utilities (not related to AuD lecture)
CColormap	Simple interface for color map
CColormapCount	Color map for (small) positive integer counts
CColormapJet	Map values in [minValue,maxValue] to color
CCommonGraphvizDecorator	Interface for simple decorator with preset properties
CDotViewer	Simple viewer for Graphvizable
CGraphDemo	Demonstrate visualization of graph algorithms
CGraphviz	Use GraphViz to render graph structures
CGraphvizable	Interface for GraphViz rendering
CGraphvizDecorable	Interface for decorating items of Graphvizable objects
CGraphvizDecorator	Decorator for items of Graphvizable objects
CLexicalScanner	Base class for a simple lexical scanner
CPermutationIterator	Iterator over all permutations of length n
CPermutations	Generate permutations
CSimpleDecorator	Example for a simple decorator
CSingleStepper	Simple framework for single stepping code
CSingleStepperDemo	Demonstrate use of SingleStepper
CSVGViewer	Simple SVG viewer based on Batik's SVGCanvas
CSys	System related utilities
CTerminal
CA234Tree< Key extends Comparable	Simple implementation of 2-3-4-trees based on KTreeNode
CAVLTree< Key extends Comparable	Simple implementation of an AVL tree
CBinarySearchTree< Key extends Comparable	Base class for a binary search tree
CBinaryTree	Simple binary tree
►CBinaryTreeTraversal	Provide traversals of binary trees
CInorder	Helper: generates InorderIterator
CInorderIterator	Inorder iterator for BinaryTree
CLevelorder	Helper: generates LevelorderIterator
CLevelorderIterator	Level-order iterator for BinaryTree
CPostorder	Helper: generates PostorderIterator
CPostorderIterator	Postorder iterator for BinaryTree
CPreorder	Helper: generates PreorderIterator
CPreorderIterator	Preorder iterator for BinaryTree
CRecursiveTraversalIterator	Base class for stack-based pre-/in-/postorder traversal
CTraversal	Base class for traversal
CBTree< Key extends Comparable	Simple implementation of B-trees based on KTreeNode
►CDList	Implementation of a doubly linked list
CBackwardIterator	Backward iterator
CBackwards	Utility class to obtain a BackwardIterator
CForwardIterator	Forward iterator
CNode
►CHashMap	Implementation of an unordered map based on a hash table
CEntries	Provide HashMap iterator over key-value pairs (Entry)
CEntry	Entry (key,value) in HashMap (iterator)
CKTreeNode< Key extends Comparable	Node in a k-ary search tree
CPriorityQueue	Priority queue based on binary min-heap
CQueue	Implementation of AbstractQueue as a (dynamically resized) circular buffer based on array
CQueueDL	Impementation of AbstractQueue based on doubly linked list DList
CRedBlackTree< Key extends Comparable	Simple implementation of a red-black tree
►CSList	Implementation of a singly linked list
CIterator	Forward iterator
CNode
CStack	Implementation of a stack based on aud.Vector
►CVector	Implementation of an array-based vector
CIterator	Forward iterator