Package CITS2200

Interface Summary

Combination	Interface for a combination belonging to a combination lock.
Compressor	This interface describes the operations to compress and decompress a file, using a variety of algorithms.
Deque<E>	A Classs for basic operations of a double ended queue (DEQUE).
Flow	Flow.java This interface is used to implement Max Flow and matching algorithms algorithms over Graphs.
Iterator<E>	A class for sequentially accessing collections The Iterator should initially be pointing before the first element of the collection, so the first call to next() returns the first element.
List	Interface for List ADTs that use a window for Links
Lock	Interface for a combination lock.
Map	Interface for a Map ADT
Path	Path.java This interface is used to implement Prim's and Djikstra's algorithms over a weighted, undirected Graph.
PriorityQueue<E>	PriorityQueue interface.
Queue	Queue interface.
Search	Search.java This interface specifies methods based on a Breadth First Search and Depth First Search over a directed Graph.
Sort	A class to give a comaprative view of common sorting algorithms.
Stack	Stack interface.

Class Summary

BinaryTree<E>	A class to represent binary tree where each node contains an item E The class is immutable, so after a tree is created, it cannot be changed.
Graph	Graph.java is a class to assist with graph and network algorithms for CITS3210.
Link	A link used to (recursively) construct a linked list.
ListLinked	Singly linked implementation of a List ADT
Pair	A pair (2-tuple) of information.
WindowLinked	Window for linked representations of lists

Exception Summary

DuplicateItem	Exception class for duplicate item errors in search tree insertions.
IllegalValue	Exception class for illegal decrease key operations in pairing heaps.
ItemNotFound	Exception class for failed finds/removes in search trees, hash tables, and list and tree iterators.
OutOfBounds	Indicates an attempt to access an object outside the bounds of a container class such as a list.
Overflow	Indicates an attempt to add to a full container class such as a stack or queue.
Underflow	Exception class for access in empty containers such as stacks, queues, and priority queues.