
net.datastructures  version 3.0  
PREV PACKAGE NEXT PACKAGE  FRAMES NO FRAMES 
net.datastructures
package contains all of the components in the Data
Structures Package.
See:
Description
Interface Summary  
AdaptablePriorityQueue  Interface for an adaptable priority queue. 
BinaryTree  An interface for a binary tree, where each node can have zero, one, or two children. 
BTPosition  Interface for a node of a binary tree. 
CompleteBinaryTree  An interface for a complete binary tree. 
DecorablePosition  An interface for a position that can be marked with an arbitrary number of decorations. 
Deque  Interface for a deque (doubleended queue). 
Dictionary  An interface for a dictionary storing (keyvalue) pairs. 
Edge  An interface for an edge of a graph. 
Entry  Interface for a keyvalue pair entry 
EqualityTester  An interface for an equality tester, used to determine whether two objects are equal. 
Graph  An interface for a graph. 
List  An interface for a list. 
Map  An interface for a map which binds a key uniquely to a value. 
Position  An interface for a position, which is a holder object storing a single element. 
PriorityQueue  Interface for the priority queue ADT 
Queue  Interface for a queue: a collection of elements that are inserted and removed according to the firstin firstout principle. 
Sequence  An interface for a sequence, a data structure supporting all operations of a vector and a list. 
Stack  Interface for a stack: a collection of objects that are inserted and removed according to the lastin firstout principle. 
Tree  An interface for a tree where nodes can have an arbitrary number of children. 
Vector  Interface for a vector. 
Vertex  An interface for a vertex of a graph. 
Class Summary  
AdjacencyListGraph  An realization of a graph according to adjacency list structure. 
AdjacencyListGraph.MyEdge  Implementation of an edge for an undirected adjacency list graph. 
AdjacencyListGraph.MyPosition  Implementation of a decorable position by means of a hash table. 
AdjacencyListGraph.MyVertex  Implementation of a vertex for an undirected adjacency list graph. 
ArrayStack  Implementation of the Stack interface using a fixedlength array. 
ArrayVector  Realization of a vector by means of an array. 
AVLTree  AVLTree class  implements an AVL Tree by extending a binary search tree. 
AVLTree.AVLNode  Nested class for the nodes of an AVL tree. 
BinarySearchTree  Realization of a dictionary by means of a binary search tree. 
BinarySearchTree.BSTEntry  Nested class for locationaware binary search tree entries 
BTNode  Class implementing a node of a binary tree by storing references to an element, a parent node, a left node, and a right node. 
ConnectivityDFS  This class specializes DFS to determine whether the graph is connected. 
DefaultComparator  A default comparator, which uses the natural ordering 
DFS  Generic depth first search traversal of a graph using the template method pattern. 
Dijkstra  Dijkstra's algorithm for the singlesource shortest path problem in an undirected graph whose edges have integer weights. 
DLNode  A simple node class for a doublylinked list. 
DNode  A simple node class for a doublylinked list. 
ElementIterator  A simple iterator class for lists. 
FindCycleDFS  A specialization of a generic DFS used to find a cycle in a graph. 
FindPathDFS  This class specializes DFS to find a path between the start vertex and a given target vertex. 
HashTable  A hash table data structure that uses linear probing to handle collisions. 
HashTable.DefaultEqualityTester  An inner class for a simple equality tester. 
HashTable.HashEntry  Nested class for an entry in a hash table. 
HeapAdaptablePriorityQueue  Realization of an adaptable priority queue by means of a heap. 
HeapAdaptablePriorityQueue.LocationAwareEntry  Inner class for a locationaware entry. 
HeapPriorityQueue  Realization of a priority queue by means of a heap. 
HeapPriorityQueue.DefaultComparator  Inner class for a comparator that uses the natural ordering of keys. 
HeapPriorityQueue.MyEntry  Inner class for heap entries. 
LinkedBinaryTree  An implementation of the BinaryTree interface by means of a linked structure. 
Node  Node of a singly linked list, which stores references to its element and to the next node in the list. 
NodeDeque  Implementation of the Deque interface by means of a doubly linked list. 
NodeList  Realization of a List using a doublylinked list of nodes. 
NodeQueue  Realization of a queue by means of a singlylinked list of nodes. 
NodeSequence  Implementation of a sequence by means of a doubly linked list. 
NodeStack  Implementation of a stack by means of a singly linked list. 
PositionIterator  A simple iterator class for lists. 
RBTree  Realization of a dictionary by means of a redblack tree. 
RBTree.RBNode  Nested class for the nodes of a redblack tree 
Sort  Class containing various sorting algorithms. 
SortedListAdaptablePriorityQueue  Implementation of a priority queue by means of a sorted list 
SortedListAdaptablePriorityQueue.LocationAwareEntry  Inner class for a locationaware entry. 
SortedListPriorityQueue  Realization of a priority queue by means of a sorted linkedlist in nondecreasing order. 
SortedListPriorityQueue.DefaultComparator  Inner class for a default comparator using the natural ordering 
SortedListPriorityQueue.MyEntry  Inner class for entries 
VectorCompleteBinaryTree  A speedy implementation of the CompleteBinaryTree interface using a vector. 
VectorCompleteBinaryTree.VectorNode  Nested class for a vectorbased complete binary tree node. 
Exception Summary  
BoundaryViolationException  Signals that the boundaries of a data structure have been illegally traversed (e.g. past the end of a list). 
EmptyDequeException  Runtime exception thrown when one tries to perform an access or removal operation on an empty deque. 
EmptyListException  Thrown when a list cannot fulfill the requested operation because it is empty. 
EmptyPriorityQueueException  Thrown when a priority queue cannot fulfill the requested operation because it is empty. 
EmptyQueueException  Runtime exception thrown when one tries to perform operation front or dequeue on an empty queue. 
EmptyStackException  Runtime exception thrown when one tries to perform operation top or pop on an empty stack. 
EmptyTreeException  Runtime exception thrown when one tries to access the root of an empty tree. 
FullStackException  Runtime exception thrown when the capacity of the array used by an ArrayStack has been exceeded. 
InvalidEntryException  Thrown when an entry is discovered to be invalid. 
InvalidKeyException  Thrown when a key is determined to be invalid. 
InvalidPositionException  Thrown when a position is determined to be invalid. 
NonEmptyTreeException  Runtime exception thrown when one tries to create the root of a tree that is not empty. 
The net.datastructures
package contains all of the components in the Data
Structures Package.

net.datastructures  version 3.0  
PREV PACKAGE NEXT PACKAGE  FRAMES NO FRAMES 