Uses of Package
net.datastructures

Packages that use net.datastructures

Package	Description
net.datastructures
support.graph

Classes in net.datastructures used by net.datastructures

Class and Description
AdaptablePriorityQueue Interface for an adaptable priority queue.
BinarySearchTree Realization of a dictionary by means of a binary search tree.
BinaryTree An interface for a binary tree, where each node can have zero, one, or two children.
BoundaryViolationException Signals that the boundaries of a data structure have been illegally traversed (e.g.
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: a collection of objects that are inserted and removed at both ends; a subset of java.util.LinkedList methods.
DFS Generic DFS traversal of a graph using the template method pattern.
Dictionary An interface for a dictionary storing (key-value) pairs.
DLNode A simple node class for a doubly-linked list.
DNode A simple node class for a doubly-linked list.
Edge An interface for an edge of a graph.
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.
Entry Interface for a key-value pair entry
FullStackException Runtime exception thrown when the capacity of the array used by an ArrayStack has been exceeded.
Graph An interface for a graph.
HeapPriorityQueue Realization of a priority queue by means of a heap.
IndexList An interface for array lists.
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.
LinkedBinaryTree An implementation of the BinaryTree interface by means of a linked structure.
Map An interface for a map which binds a key uniquely to a value.
Node Node of a singly linked list, which stores references to its element and to the next node in the list.
NonEmptyTreeException Runtime exception thrown when one tries to create the root of a tree that is not empty.
Position An interface for a position, which is a holder object storing a single element.
PositionList An interface for positional lists.
PriorityQueue Interface for the priority queue ADT
Queue Interface for a queue: a collection of elements that are inserted and removed according to the first-in first-out principle.
SortedListPriorityQueue Realization of a priority queue by means of a sorted node list in nondecreasing order.
Stack Interface for a stack: a collection of objects that are inserted and removed according to the last-in first-out principle.
Tree An interface for a tree where nodes can have an arbitrary number of children.
TreePosition Interface for a node of a binary tree.
Vertex An interface for a vertex of a graph.

Classes in net.datastructures used by support.graph

Class and Description
AdaptablePriorityQueue Interface for an adaptable priority queue.
BoundaryViolationException Signals that the boundaries of a data structure have been illegally traversed (e.g.
CompleteBinaryTree An interface for a complete binary tree.
Deque Interface for a deque: a collection of objects that are inserted and removed at both ends; a subset of java.util.LinkedList methods.
EmptyDequeException Runtime exception thrown when one tries to perform an access or removal operation on an empty deque.
EmptyPriorityQueueException Thrown when a priority queue cannot fulfill the requested operation because it is empty.
Entry Interface for a key-value pair entry
IndexList An interface for array lists.
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.
Position An interface for a position, which is a holder object storing a single element.
PositionList An interface for positional lists.
PriorityQueue Interface for the priority queue ADT
Sequence An interface for a sequence, a data structure supporting all operations of a deque, indexed list and position list.