Class Summary |
AdjacencyListGraph<V,E> |
An realization of a graph according to adjacency list structure. |
AdjacencyListGraph.MyPosition<T> |
Implementation of a decorable position by means of a hash
table. |
ArrayIndexList<E> |
Realization of an indexed list by means of an array, which is doubled
when the size of the indexed list exceeds the capacity of the array. |
ArrayListCompleteBinaryTree<E> |
A speedy implementation of the CompleteBinaryTree interface using
a vector. |
ArrayListCompleteBinaryTree.BTPos<E> |
Nested class for a index list-based complete binary tree node. |
ArrayStack<E> |
Implementation of the stack ADT using a fixed-length array. |
AVLTree<K,V> |
AVLTree class - implements an AVL Tree by extending a binary
search tree. |
AVLTree.AVLNode<K,V> |
Nested class for the nodes of an AVL tree. |
AVLTreeMap<K,V> |
AVLTree class - implements an AVL Tree by extending a binary
search tree. |
AVLTreeMap.AVLNode<K,V> |
Nested class for the nodes of an AVL tree. |
BinarySearchTree<K,V> |
Realization of a dictionary by means of a binary search tree. |
BinarySearchTree.BSTEntry<K,V> |
Nested class for location-aware binary search tree entries |
BinarySearchTreeMap<K,V> |
Realization of a map by means of a binary search tree. |
BinarySearchTreeMap.BSTEntry<K,V> |
Nested class for location-aware binary search tree entries |
BTNode<E> |
Class implementing a node of a binary tree by storing references to
an element, a parent node, a left node, and a right node. |
ComponentsDFS<V,E> |
This class extends DFS to compute the connected components of a graph. |
ConnectivityDFS<V,E> |
This class specializes DFS to determine whether the graph is connected. |
DefaultComparator<E> |
Comparator based on the natural ordering |
DFS<V,E,I,R> |
Generic DFS traversal of a graph using the template method pattern. |
Dijkstra<V,E> |
Dijkstra's algorithm for the single-source shortest path problem in
an undirected graph whose edges have integer weights. |
DLNode<E> |
A simple node class for a doubly-linked list. |
DNode<E> |
A simple node class for a doubly-linked list. |
ElementIterator<E> |
A simple iterator class for lists. |
EulerTour<E,R> |
Template for algorithms traversing a binary tree using an Euler
tour. |
FindCycleDFS<V,E> |
This class specializes DFS to find a cycle. |
FindPathDFS<V,E> |
Class specializing DFS to find a path between a start vertex and a target
vertex. |
HashTableMap<K,V> |
A hash table data structure that uses linear probing to handle
collisions. |
HashTableMap.HashEntry<K,V> |
Nested class for an entry in a hash table. |
HeapAdaptablePriorityQueue<K,V> |
Realization of an adaptable priority queue by means of a heap. |
HeapAdaptablePriorityQueue.LocationAwareEntry<K,V> |
Inner class for a location-aware entry. |
HeapPriorityQueue<K,V> |
Realization of a priority queue by means of a heap. |
HeapPriorityQueue.MyEntry<K,V> |
Inner class for heap entries. |
LinkedBinaryTree<E> |
An implementation of the BinaryTree interface by means of a linked structure. |
LinkedTree<E> |
A linked class for a tree where nodes have an arbitrary number of children. |
Node<E> |
Node of a singly linked list, which stores references to its
element and to the next node in the list. |
NodeDeque<E> |
Implementation of the Deque interface by means of a doubly linked
list. |
NodePositionList<E> |
Realization of a PositionList using a doubly-linked list of nodes. |
NodeQueue<E> |
Realization of a queue by means of a singly-linked list of nodes. |
NodeStack<E> |
Implementation of the stack ADT by means of a singly linked list. |
RBTree<K,V> |
Realization of a dictionary by means of a red-black tree. |
RBTree.RBNode<K,V> |
Nested class for the nodes of a red-black tree |
RBTreeMap<K,V> |
Realization of a map by means of a red-black tree. |
RBTreeMap.RBNode<K,V> |
Nested class for the nodes of a red-black tree |
Sort |
Class containing various sorting algorithms. |
SortedListAdaptablePriorityQueue<K,V> |
Implementation of an adaptable priority queue by means of a sorted list. |
SortedListAdaptablePriorityQueue.LocationAwareEntry<K,V> |
Inner class for a location-aware entry |
SortedListPriorityQueue<K,V> |
Realization of a priority queue by means of a sorted node list in
nondecreasing order. |
SortedListPriorityQueue.MyEntry<K,V> |
Inner class for entries |
TreeNode<E> |
Class implementing a node of a binary tree by storing references to
an element, a parent node, a left node, and a right node. |