- actionPos - Variable in class net.datastructures.BinarySearchTree
-
- actionPos - Variable in class net.datastructures.SortedListPriorityQueue
-
- AdaptablePriorityQueue<K,V> - Interface in net.datastructures
-
Interface for an adaptable priority queue.
- add(int, E) - Method in class net.datastructures.ArrayIndexList
-
Inserts an element at the given index.
- add(E) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Adds an element just after the last node (in a level numbering).
- add(E) - Method in interface net.datastructures.CompleteBinaryTree
-
Adds an element to the tree just after the last node.
- add(int, E) - Method in interface net.datastructures.IndexList
-
Inserts an element e to be at index i, shifting all elements after this.
- addAfter(Position<E>, E) - Method in class net.datastructures.NodePositionList
-
Insert the given element after the given position;
O(1) time
- addAfter(Position<E>, E) - Method in interface net.datastructures.PositionList
-
Inserts an element after the given node in the list.
- addAll(PositionList<Entry<K, V>>, Position<Entry<K, V>>, K) - Method in class net.datastructures.BinarySearchTree
-
Adds to L all entries in the subtree rooted at v having keys
equal to k.
- addBefore(Position<E>, E) - Method in class net.datastructures.NodePositionList
-
Insert the given element before the given position;
O(1) time
- addBefore(Position<E>, E) - Method in interface net.datastructures.PositionList
-
Inserts an element before the given node in the list.
- addFirst(E) - Method in interface net.datastructures.Deque
-
Inserts an element to be the first in the deque.
- addFirst(E) - Method in class net.datastructures.NodeDeque
-
- addFirst(E) - Method in class net.datastructures.NodePositionList
-
Insert the given element at the beginning of the list, returning
the new position; O(1) time
- addFirst(E) - Method in interface net.datastructures.PositionList
-
Inserts an element at the front of the list, returning new position.
- addLast(E) - Method in interface net.datastructures.Deque
-
Inserts an element to be the last in the deque.
- addLast(E) - Method in class net.datastructures.NodeDeque
-
- addLast(E) - Method in class net.datastructures.NodePositionList
-
Insert the given element at the end of the list, returning
the new position; O(1) time
- addLast(E) - Method in interface net.datastructures.PositionList
-
Inserts and element at the back of the list, returning new position.
- addRoot(E) - Method in class net.datastructures.LinkedBinaryTree
-
Adds a root node to an empty tree
- addRoot(E) - Method in class net.datastructures.LinkedTree
-
Adds a root node to an empty tree
- AdjacencyListGraph<V,E> - Class in net.datastructures
-
An realization of a graph according to adjacency list structure.
- AdjacencyListGraph() - Constructor for class net.datastructures.AdjacencyListGraph
-
Default constructor that creates an empty graph
- AdjacencyListGraph.MyEdge<E> - Class in net.datastructures
-
Implementation of an edge for an undirected adjacency list
graph.
- AdjacencyListGraph.MyPosition<T> - Class in net.datastructures
-
Implementation of a decorable position by means of a hash
table.
- AdjacencyListGraph.MyVertex<V> - Class in net.datastructures
-
Implementation of a vertex for an undirected adjacency list
graph.
- areAdjacent(Vertex<V>, Vertex<V>) - Method in class net.datastructures.AdjacencyListGraph
-
Test whether two vertices are adjacent
- areAdjacent(Vertex<V>, Vertex<V>) - Method in interface net.datastructures.Graph
-
Tests whether two vertices are adjacent
- ArrayIndexList<E> - Class in net.datastructures
-
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.
- ArrayIndexList() - Constructor for class net.datastructures.ArrayIndexList
-
Creates the indexed list with initial capacity 16.
- ArrayListCompleteBinaryTree<E> - Class in net.datastructures
-
A speedy implementation of the CompleteBinaryTree interface using
a vector.
- ArrayListCompleteBinaryTree() - Constructor for class net.datastructures.ArrayListCompleteBinaryTree
-
default constructor
- ArrayListCompleteBinaryTree.BTPos<E> - Class in net.datastructures
-
Nested class for a index list-based complete binary tree node.
- ArrayStack<E> - Class in net.datastructures
-
Implementation of the stack ADT using a fixed-length array.
- ArrayStack() - Constructor for class net.datastructures.ArrayStack
-
Initializes the stack to use an array of default length.
- ArrayStack(int) - Constructor for class net.datastructures.ArrayStack
-
Initializes the stack to use an array of given length.
- atIndex(int) - Method in interface net.datastructures.Sequence
-
Returns the position containing the element at the given index.
- attach(Position<E>, BinaryTree<E>, BinaryTree<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Attaches two trees to be subtrees of an external node.
- AVAILABLE - Variable in class net.datastructures.HashTableMap
-
- AVLTree<K,V> - Class in net.datastructures
-
AVLTree class - implements an AVL Tree by extending a binary
search tree.
- AVLTree(Comparator<K>) - Constructor for class net.datastructures.AVLTree
-
- AVLTree() - Constructor for class net.datastructures.AVLTree
-
- AVLTree.AVLNode<K,V> - Class in net.datastructures
-
Nested class for the nodes of an AVL tree.
- C - Variable in class net.datastructures.BinarySearchTree
-
- c - Variable in class net.datastructures.SortedListPriorityQueue
-
- capacity - Variable in class net.datastructures.ArrayStack
-
Length of the array used to implement the stack.
- CAPACITY - Static variable in class net.datastructures.ArrayStack
-
Default array capacity.
- capacity - Variable in class net.datastructures.HashTableMap
-
- checkEdge(Edge<E>) - Method in class net.datastructures.AdjacencyListGraph
-
Determines whether a given edge is valid.
- checkEntry(Entry<K, V>) - Method in class net.datastructures.BinarySearchTree
-
Checks whether a given entry is valid.
- checkEntry(Entry<K, V>) - Method in class net.datastructures.HeapAdaptablePriorityQueue
-
Check whether a given entry is valid.
- checkEntry(Entry) - Method in class net.datastructures.SortedListAdaptablePriorityQueue
-
Determines whether a given entry is valid
- checkIndex(int, int) - Method in class net.datastructures.ArrayIndexList
-
Checks whether the given index is in the range [0, n - 1]
- checkKey(K) - Method in class net.datastructures.BinarySearchTree
-
Checks whether a given key is valid.
- checkKey(K) - Method in class net.datastructures.HashTableMap
-
Determines whether a key is valid.
- checkKey(K) - Method in class net.datastructures.HeapPriorityQueue
-
Determines whether a given key is valid
- checkKey(K) - Method in class net.datastructures.SortedListPriorityQueue
-
Determines whether a key is valid.
- checkPosition(Position) - Method in class net.datastructures.AdjacencyListGraph
-
Determines whether a given position is valid.
- checkPosition(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Determines whether the given position is a valid node.
- checkPosition(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
If v is a good binary tree node, cast to BTPosition, else throw exception
- checkPosition(Position<E>) - Method in class net.datastructures.LinkedTree
-
If v is a good tree node, cast to TreePosition, else throw exception
- checkPosition(Position<E>) - Method in class net.datastructures.NodePositionList
-
Checks if position is valid for this list and converts it to
DNode if it is valid; O(1) time
- checkVertex(Vertex<V>) - Method in class net.datastructures.AdjacencyListGraph
-
Determines whether a given vertex is valid.
- children(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns an iterable collection of the children of v.
- children(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Returns an iterable collection of the children of a node.
- children(Position<E>) - Method in class net.datastructures.LinkedTree
-
Returns an iterable collection of the children of a node.
- children(Position<E>) - Method in interface net.datastructures.Tree
-
Returns an iterable collection of the children of a given node.
- comp - Variable in class net.datastructures.HeapPriorityQueue
-
- compare(E, E) - Method in class net.datastructures.DefaultComparator
-
Compares two given elements
//end#fragment DefaultComparator
- CompleteBinaryTree<E> - Interface in net.datastructures
-
An interface for a complete binary tree.
- compNumber - Variable in class net.datastructures.ComponentsDFS
-
- COMPONENT - Variable in class net.datastructures.ComponentsDFS
-
- ComponentsDFS<V,E> - Class in net.datastructures
-
This class extends DFS to compute the connected components of a graph.
- ComponentsDFS() - Constructor for class net.datastructures.ComponentsDFS
-
- ConnectivityDFS<V,E> - Class in net.datastructures
-
This class specializes DFS to determine whether the graph is connected.
- ConnectivityDFS() - Constructor for class net.datastructures.ConnectivityDFS
-
- createNode(Entry<K, V>, BTPosition<Entry<K, V>>, BTPosition<Entry<K, V>>, BTPosition<Entry<K, V>>) - Method in class net.datastructures.AVLTree
-
Creates a new binary search tree node (overrides super's version).
- createNode(E, BTPosition<E>, BTPosition<E>, BTPosition<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Creates a new binary tree node
- createNode(E, TreePosition<E>, PositionList<Position<E>>) - Method in class net.datastructures.LinkedTree
-
Creates a new tree node
- createNode(Entry<K, V>, BTPosition<Entry<K, V>>, BTPosition<Entry<K, V>>, BTPosition<Entry<K, V>>) - Method in class net.datastructures.RBTree
-
Creates a new tree node.
- cursor - Variable in class net.datastructures.ElementIterator
-
- cycle - Variable in class net.datastructures.FindCycleDFS
-
- cycleStart - Variable in class net.datastructures.FindCycleDFS
-
- Edge<E> - Interface in net.datastructures
-
An interface for an edge of a graph.
- edges() - Method in class net.datastructures.AdjacencyListGraph
-
Return an iterator over the edges of the graph
- edges() - Method in interface net.datastructures.Graph
-
Returns the edges of the graph as an iterable collection
- elem - Variable in class net.datastructures.AdjacencyListGraph.MyPosition
-
The element stored at this position.
- element() - Method in class net.datastructures.AdjacencyListGraph.MyPosition
-
Returns the element stored at this position.
- element() - Method in class net.datastructures.ArrayListCompleteBinaryTree.BTPos
-
- element() - Method in class net.datastructures.BTNode
-
Returns the element stored at this position
- element() - Method in class net.datastructures.DNode
-
- element() - Method in interface net.datastructures.Position
-
Return the element stored at this position.
- element() - Method in class net.datastructures.TreeNode
-
Returns the element stored at this position
- ElementIterator<E> - Class in net.datastructures
-
A simple iterator class for lists.
- ElementIterator(PositionList<E>) - Constructor for class net.datastructures.ElementIterator
-
Creates an element iterator over the given list.
- EList - Variable in class net.datastructures.AdjacencyListGraph
-
- EmptyDequeException - Exception in net.datastructures
-
Runtime exception thrown when one tries to perform an access or
removal operation on an empty deque.
- EmptyDequeException(String) - Constructor for exception net.datastructures.EmptyDequeException
-
- EmptyListException - Exception in net.datastructures
-
Thrown when a list cannot fulfill the requested operation because
it is empty.
- EmptyListException(String) - Constructor for exception net.datastructures.EmptyListException
-
- EmptyPriorityQueueException - Exception in net.datastructures
-
Thrown when a priority queue cannot fulfill the requested operation
because it is empty.
- EmptyPriorityQueueException(String) - Constructor for exception net.datastructures.EmptyPriorityQueueException
-
- EmptyQueueException - Exception in net.datastructures
-
Runtime exception thrown when one tries to perform operation front
or dequeue on an empty queue.
- EmptyQueueException(String) - Constructor for exception net.datastructures.EmptyQueueException
-
- EmptyStackException - Exception in net.datastructures
-
Runtime exception thrown when one tries to perform operation top or
pop on an empty stack.
- EmptyStackException(String) - Constructor for exception net.datastructures.EmptyStackException
-
- EmptyTreeException - Exception in net.datastructures
-
Runtime exception thrown when one tries to access the root of an
empty tree.
- EmptyTreeException(String) - Constructor for exception net.datastructures.EmptyTreeException
-
- endVertices(Edge<E>) - Method in class net.datastructures.AdjacencyListGraph
-
Return the endvertices of a edge in an array of length 2
- endVertices - Variable in class net.datastructures.AdjacencyListGraph.MyEdge
-
The end vertices of the edge.
- endVertices() - Method in class net.datastructures.AdjacencyListGraph.MyEdge
-
Returns the end vertices of the edge.
- endVertices(Edge<E>) - Method in interface net.datastructures.Graph
-
Returns the endvertices of a vertex as an array of length 2
- enqueue(E) - Method in class net.datastructures.NodeQueue
-
- enqueue(E) - Method in interface net.datastructures.Queue
-
Inserts an element at the rear of the queue.
- entries() - Method in class net.datastructures.BinarySearchTree
-
Returns an iterator containing all entries in the tree.
- entries() - Method in interface net.datastructures.Dictionary
-
Returns an iterator containing all the entries in the dictionary.
- entries() - Method in class net.datastructures.HashTableMap
-
Returns an iterable object containing all of the entries.
- entries() - Method in interface net.datastructures.Map
-
Returns an iterable object containing all the entries in the map.
- entries - Variable in class net.datastructures.SortedListPriorityQueue
-
- entry(Position<Entry<K, V>>) - Method in class net.datastructures.BinarySearchTree
-
Extracts the entry at a given node of the tree.
- ENTRY - Variable in class net.datastructures.Dijkstra
-
Decoration key for entries in the priority queue
- Entry<K,V> - Interface in net.datastructures
-
Interface for a key-value pair entry
- equals(Object) - Method in class net.datastructures.HashTableMap.HashEntry
-
- EulerTour<E,R> - Class in net.datastructures
-
Template for algorithms traversing a binary tree using an Euler
tour.
- EulerTour() - Constructor for class net.datastructures.EulerTour
-
- eulerTour(Position<E>) - Method in class net.datastructures.EulerTour
-
Template method
- EulerTour.TourResult<R> - Class in net.datastructures
-
- execute(Graph<V, E>, Vertex<V>, I) - Method in class net.datastructures.DFS
-
Execute a depth first search traversal on graph g, starting
from a start vertex s, passing in an information object (in)
- execute(Graph<V, E>, Vertex<V>, Object) - Method in class net.datastructures.Dijkstra
-
Executes Dijkstra's algorithm.
- execute(BinaryTree<E>) - Method in class net.datastructures.EulerTour
-
Execution of the traversal.
- expandExternal(Position<E>, E, E) - Method in class net.datastructures.LinkedBinaryTree
-
Expand an external node into an internal node with two external
node children
- HashEntry(K, V) - Constructor for class net.datastructures.HashTableMap.HashEntry
-
- HashTableMap<K,V> - Class in net.datastructures
-
A hash table data structure that uses linear probing to handle
collisions.
- HashTableMap() - Constructor for class net.datastructures.HashTableMap
-
Creates a hash table with prime factor 109345121 and capacity 1000.
- HashTableMap(int) - Constructor for class net.datastructures.HashTableMap
-
Creates a hash table with prime factor 109345121 and given capacity.
- HashTableMap(int, int) - Constructor for class net.datastructures.HashTableMap
-
Creates a hash table with the given prime factor and capacity.
- HashTableMap.HashEntry<K,V> - Class in net.datastructures
-
Nested class for an entry in a hash table.
- hashValue(K) - Method in class net.datastructures.HashTableMap
-
Hash function applying MAD method to default hash code.
- hasLeft(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns whether v has a left child.
- hasLeft(Position<E>) - Method in interface net.datastructures.BinaryTree
-
Returns whether a node has a left child.
- hasLeft(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Returns whether a node has a left child.
- hasNext() - Method in class net.datastructures.ElementIterator
-
Returns whether the iterator has a next object.
- hasRedChild(Position<Entry<K, V>>) - Method in class net.datastructures.RBTree
-
Returns whether a node has a red child.
- hasRight(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns whether v has a right child.
- hasRight(Position<E>) - Method in interface net.datastructures.BinaryTree
-
Returns whether a node has a right child.
- hasRight(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Returns whether a node has a right child.
- head - Variable in class net.datastructures.NodeQueue
-
- header - Variable in class net.datastructures.NodeDeque
-
- header - Variable in class net.datastructures.NodePositionList
-
- heap - Variable in class net.datastructures.HeapPriorityQueue
-
- HeapAdaptablePriorityQueue<K,V> - Class in net.datastructures
-
Realization of an adaptable priority queue by means of a heap.
- HeapAdaptablePriorityQueue() - Constructor for class net.datastructures.HeapAdaptablePriorityQueue
-
Creates an empty heap with a default comparator.
- HeapAdaptablePriorityQueue(Comparator) - Constructor for class net.datastructures.HeapAdaptablePriorityQueue
-
Creates an empty heap with the given comparator.
- HeapAdaptablePriorityQueue.LocationAwareEntry<K,V> - Class in net.datastructures
-
Inner class for a location-aware entry.
- HeapPriorityQueue<K,V> - Class in net.datastructures
-
Realization of a priority queue by means of a heap.
- HeapPriorityQueue() - Constructor for class net.datastructures.HeapPriorityQueue
-
Creates an empty heap with the default comparator
- HeapPriorityQueue(Comparator<K>) - Constructor for class net.datastructures.HeapPriorityQueue
-
Creates an empty heap with the given comparator
- HeapPriorityQueue.MyEntry<K,V> - Class in net.datastructures
-
Inner class for heap entries.
- height - Variable in class net.datastructures.AVLTree.AVLNode
-
- height(Position<Entry<K, V>>) - Method in class net.datastructures.AVLTree
-
Returns the height of a node (call back to an AVLNode).
- Inc - Variable in class net.datastructures.AdjacencyListGraph.MyEdge
-
The positions of the entries for the edge in the incidence
containers of the end vertices.
- incEdges - Variable in class net.datastructures.AdjacencyListGraph.MyVertex
-
Incidence container of the vertex.
- incidences() - Method in class net.datastructures.AdjacencyListGraph.MyEdge
-
Returns the positions of the edge in the incidence containers
of its end vertices.
- incidentEdges(Vertex<V>) - Method in class net.datastructures.AdjacencyListGraph
-
Return an iterator over the edges incident on a vertex
- incidentEdges() - Method in class net.datastructures.AdjacencyListGraph.MyVertex
-
Returns the incident edges on this vertex.
- incidentEdges(Vertex<V>) - Method in interface net.datastructures.Graph
-
Returns the edges incident on a vertex as an iterable collection
- index() - Method in class net.datastructures.ArrayListCompleteBinaryTree.BTPos
-
- IndexList<E> - Interface in net.datastructures
-
An interface for array lists.
- indexOf(Position<E>) - Method in interface net.datastructures.Sequence
-
Returns the index of the element stored at the given position.
- INFINITE - Static variable in class net.datastructures.Dijkstra
-
Infinity value.
- info - Variable in class net.datastructures.DFS
-
- init(BinaryTree<E>) - Method in class net.datastructures.EulerTour
-
Initialization of the traversal
- initResult() - Method in class net.datastructures.DFS
-
Initializes result (called first, once per vertex visited).
- inorderPositions(Position<E>, PositionList<Position<E>>) - Method in class net.datastructures.LinkedBinaryTree
-
Creates a list storing the the nodes in the subtree of a node,
ordered according to the inorder traversal of the subtree.
- insert(K, V) - Method in class net.datastructures.AVLTree
-
Inserts an item into the dictionary and returns the newly created
entry.
- insert(K, V) - Method in class net.datastructures.BinarySearchTree
-
Inserts an entry into the tree and returns the newly created entry.
- insert(K, V) - Method in interface net.datastructures.Dictionary
-
Inserts an item into the dictionary.
- insert(K, V) - Method in class net.datastructures.HeapAdaptablePriorityQueue
-
Inserts a key-value pair and returns the entry created.
- insert(K, V) - Method in class net.datastructures.HeapPriorityQueue
-
Inserts a key-value pair and returns the entry created
- insert(K, V) - Method in interface net.datastructures.PriorityQueue
-
Inserts a key-value pair and return the entry created.
- insert(K, V) - Method in class net.datastructures.RBTree
-
Inserts an item into the dictionary and returns the newly
created entry.
- insert(K, V) - Method in class net.datastructures.SortedListAdaptablePriorityQueue
-
Inserts a key-value pair and returns the entry created
- insert(K, V) - Method in class net.datastructures.SortedListPriorityQueue
-
Inserts a key-value pair and return the entry created.
- insertAtExternal(Position<Entry<K, V>>, Entry<K, V>) - Method in class net.datastructures.BinarySearchTree
-
Auxiliary method for inserting an entry at an external node
- insertEdge(Vertex<V>, Vertex<V>, E) - Method in class net.datastructures.AdjacencyListGraph
-
Insert and return a new edge with a given element between two
vertices
- insertEdge(Vertex<V>, Vertex<V>, E) - Method in interface net.datastructures.Graph
-
Inserts and return a new edge with a given element between two
vertices
- insertEntry(Entry<K, V>) - Method in class net.datastructures.SortedListPriorityQueue
-
Auxiliary method used for insertion.
- insertIncidence(Edge<E>) - Method in class net.datastructures.AdjacencyListGraph.MyVertex
-
Inserts an edge into the incidence container of this vertex.
- insertLeft(Position<E>, E) - Method in class net.datastructures.LinkedBinaryTree
-
Inserts a left child at a given node.
- insertRight(Position<E>, E) - Method in class net.datastructures.LinkedBinaryTree
-
Inserts a right child at a given node.
- insertVertex(V) - Method in class net.datastructures.AdjacencyListGraph
-
Insert and return a new vertex with a given element
- insertVertex(V) - Method in interface net.datastructures.Graph
-
Inserts and return a new vertex with a given element
- InvalidEntryException - Exception in net.datastructures
-
Thrown when an entry is discovered to be invalid.
- InvalidEntryException(String) - Constructor for exception net.datastructures.InvalidEntryException
-
- InvalidKeyException - Exception in net.datastructures
-
Thrown when a key is determined to be invalid.
- InvalidKeyException(String) - Constructor for exception net.datastructures.InvalidKeyException
-
- InvalidPositionException - Exception in net.datastructures
-
Thrown when a position is determined to be invalid.
- InvalidPositionException(String) - Constructor for exception net.datastructures.InvalidPositionException
-
- InvalidPositionException() - Constructor for exception net.datastructures.InvalidPositionException
-
- isBalanced(Position<Entry<K, V>>) - Method in class net.datastructures.AVLTree
-
Returns whether a node has balance factor between -1 and 1.
- isDone() - Method in class net.datastructures.DFS
-
Determines whether the traversal is done early.
- isDone() - Method in class net.datastructures.FindCycleDFS
-
- isDone() - Method in class net.datastructures.FindPathDFS
-
- isEmpty() - Method in class net.datastructures.ArrayIndexList
-
Returns whether the indexed list is empty.
- isEmpty() - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns whether the tree is empty.
- isEmpty() - Method in class net.datastructures.ArrayStack
-
Testes whether the stack is empty.
- isEmpty() - Method in class net.datastructures.BinarySearchTree
-
Returns whether the tree is empty.
- isEmpty() - Method in interface net.datastructures.Deque
-
Returns whether the deque is empty.
- isEmpty() - Method in interface net.datastructures.Dictionary
-
Returns whether the dictionary is empty.
- isEmpty() - Method in class net.datastructures.HashTableMap
-
Returns whether or not the table is empty.
- isEmpty() - Method in class net.datastructures.HeapPriorityQueue
-
Returns whether the heap is empty
- isEmpty() - Method in interface net.datastructures.IndexList
-
Returns whether the list is empty.
- isEmpty() - Method in class net.datastructures.LinkedBinaryTree
-
Returns whether the tree is empty.
- isEmpty() - Method in class net.datastructures.LinkedTree
-
Returns whether the tree is empty.
- isEmpty() - Method in interface net.datastructures.Map
-
Returns whether the map is empty.
- isEmpty() - Method in class net.datastructures.NodeDeque
-
This function returns true if and only if the deque is empty
- isEmpty() - Method in class net.datastructures.NodePositionList
-
Returns whether the list is empty; O(1) time
- isEmpty() - Method in class net.datastructures.NodeQueue
-
- isEmpty() - Method in class net.datastructures.NodeStack
-
- isEmpty() - Method in interface net.datastructures.PositionList
-
Returns whether the list is empty.
- isEmpty() - Method in interface net.datastructures.PriorityQueue
-
Returns whether the priority queue is empty.
- isEmpty() - Method in interface net.datastructures.Queue
-
Returns whether the queue is empty.
- isEmpty() - Method in class net.datastructures.SortedListPriorityQueue
-
Returns whether the priority queue is empty.
- isEmpty() - Method in interface net.datastructures.Stack
-
Return whether the stack is empty.
- isEmpty() - Method in interface net.datastructures.Tree
-
Returns whether the tree is empty.
- isExternal(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns whether v is an external node.
- isExternal(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Returns whether a node is external.
- isExternal(Position<E>) - Method in class net.datastructures.LinkedTree
-
Returns whether a node is external.
- isExternal(Position<E>) - Method in interface net.datastructures.Tree
-
Returns whether a given node is external.
- isFirst(Position<E>) - Method in class net.datastructures.NodePositionList
-
Returns whether a position is the first one; O(1) time
- isInternal(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns whether v is an internal node.
- isInternal(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Returns whether a node is internal.
- isInternal(Position<E>) - Method in class net.datastructures.LinkedTree
-
Returns whether a node is internal.
- isInternal(Position<E>) - Method in interface net.datastructures.Tree
-
Returns whether a given node is internal.
- isLast(Position<E>) - Method in class net.datastructures.NodePositionList
-
Returns whether a position is the last one; O(1) time
- isPosRed(Position<Entry<K, V>>) - Method in class net.datastructures.RBTree
-
Returns whether a node is red.
- isRed - Variable in class net.datastructures.RBTree.RBNode
-
- isRed() - Method in class net.datastructures.RBTree.RBNode
-
- isRoot(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns whether v is the root node.
- isRoot(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Returns whether a node is the root.
- isRoot(Position<E>) - Method in class net.datastructures.LinkedTree
-
Returns whether a node is the root.
- isRoot(Position<E>) - Method in interface net.datastructures.Tree
-
Returns whether a given node is the root of the tree.
- isVisited(DecorablePosition<?>) - Method in class net.datastructures.DFS
-
Test if a position (vertex or edge) has been visited.
- iterator() - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns an iterator of the elements stored at all nodes in the tree.
- iterator() - Method in class net.datastructures.LinkedBinaryTree
-
Returns an iterator of the elements stored at the nodes
- iterator() - Method in class net.datastructures.LinkedTree
-
Returns an iterator of the elements stored at the nodes
- iterator() - Method in class net.datastructures.NodePositionList
-
Returns an iterator of all the elements in the list.
- iterator() - Method in interface net.datastructures.PositionList
-
Returns an iterator of all the elements in the list.
- iterator() - Method in interface net.datastructures.Tree
-
Returns an iterator of the elements stored in the tree.
- main(String[]) - Static method in class net.datastructures.ArrayStack
-
Test our program by performing a series of operations on stacks,
printing the operations performed, the returned elements and the
contents of the stack involved, after each operation.
- main(String[]) - Static method in class net.datastructures.NodeQueue
-
Test program that performs a series of operations on on a queue and
prints the operation performed, the returned element and the
content of the stack after each operation.
- main(String[]) - Static method in class net.datastructures.NodeStack
-
Test program that performs a series of operations on on a stack and
prints the operation performed, the returned element and the
content of the stack after each operation.
- main(String[]) - Static method in class net.datastructures.Sort
-
- makeBlack() - Method in class net.datastructures.RBTree.RBNode
-
- makeRed() - Method in class net.datastructures.RBTree.RBNode
-
- Map<K,V> - Interface in net.datastructures
-
An interface for a map which binds a key uniquely to a value.
- merge(PositionList<E>, PositionList<E>, Comparator<E>, PositionList<E>) - Static method in class net.datastructures.Sort
-
Merges two sorted lists, in1 and in2, into a sorted list in.
- merge(E[], E[], Comparator<E>, int, int) - Static method in class net.datastructures.Sort
-
Merges two subarrays, specified by a start and increment.
- mergeSort(PositionList<E>, Comparator<E>) - Static method in class net.datastructures.Sort
-
Sorts the elements of list in in nondecreasing order according
to comparator c, using the merge-sort algorithm.
- mergeSort(E[], Comparator<E>) - Static method in class net.datastructures.Sort
-
Sorts an array with a comparator using nonrecursive merge sort.
- min() - Method in class net.datastructures.HeapPriorityQueue
-
Returns but does not remove an entry with minimum key
- min() - Method in interface net.datastructures.PriorityQueue
-
Returns but does not remove an entry with minimum key.
- min() - Method in class net.datastructures.SortedListPriorityQueue
-
Returns but does not remove an entry with minimum key.
- MyEntry(K, V) - Constructor for class net.datastructures.HeapPriorityQueue.MyEntry
-
- MyEntry(K, V) - Constructor for class net.datastructures.SortedListPriorityQueue.MyEntry
-
- MyPosition() - Constructor for class net.datastructures.AdjacencyListGraph.MyPosition
-
- parent(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns the parent of v.
- parent(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Returns the parent of a node.
- parent(Position<E>) - Method in class net.datastructures.LinkedTree
-
Returns the parent of a node.
- parent(Position<E>) - Method in interface net.datastructures.Tree
-
Returns the parent of a given node.
- path - Variable in class net.datastructures.FindPathDFS
-
- pop() - Method in class net.datastructures.ArrayStack
-
Removes the top element from the stack.
- pop() - Method in class net.datastructures.NodeStack
-
- pop() - Method in interface net.datastructures.Stack
-
Remove the top element from the stack.
- pos - Variable in class net.datastructures.BinarySearchTree.BSTEntry
-
- position() - Method in class net.datastructures.BinarySearchTree.BSTEntry
-
- Position<E> - Interface in net.datastructures
-
An interface for a position, which is a holder object storing a
single element.
- PositionList<E> - Interface in net.datastructures
-
An interface for positional lists.
- positions() - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns an iterable collection of all the nodes in the tree.
- positions() - Method in class net.datastructures.LinkedBinaryTree
-
Returns an iterable collection of the tree nodes.
- positions() - Method in class net.datastructures.LinkedTree
-
Returns an iterable collection of the tree nodes.
- positions() - Method in class net.datastructures.NodePositionList
-
Returns an iterable collection of all the nodes in the list.
- positions() - Method in interface net.datastructures.PositionList
-
Returns an iterable collection of all the nodes in the list.
- positions() - Method in interface net.datastructures.Tree
-
Returns an iterable collection of the the nodes.
- preorderPositions(Position<E>, PositionList<Position<E>>) - Method in class net.datastructures.LinkedBinaryTree
-
Creates a list storing the the nodes in the subtree of a node,
ordered according to the preorder traversal of the subtree.
- preorderPositions(Position<E>, PositionList<Position<E>>) - Method in class net.datastructures.LinkedTree
-
Creates a list storing the the nodes in the subtree of a node,
ordered according to the preorder traversal of the subtree.
- prev(Position<E>) - Method in class net.datastructures.NodePositionList
-
Returns the position before the given one; O(1) time
- prev(Position<E>) - Method in interface net.datastructures.PositionList
-
Returns the node before a given node in the list.
- prime - Variable in class net.datastructures.HashTableMap
-
- PriorityQueue<K,V> - Interface in net.datastructures
-
Interface for the priority queue ADT
- push(E) - Method in class net.datastructures.ArrayStack
-
Inserts an element at the top of the stack.
- push(E) - Method in class net.datastructures.NodeStack
-
- push(E) - Method in interface net.datastructures.Stack
-
Insert an element at the top of the stack.
- put(K, V) - Method in class net.datastructures.HashTableMap
-
Put a key-value pair in the map, replacing previous one if it exists.
- put(K, V) - Method in interface net.datastructures.Map
-
Puts a given key-value pair in the map, replacing a previous
one, if any, and returns the old value.
- RBTree<K,V> - Class in net.datastructures
-
Realization of a dictionary by means of a red-black tree.
- RBTree() - Constructor for class net.datastructures.RBTree
-
- RBTree(Comparator<K>) - Constructor for class net.datastructures.RBTree
-
- RBTree.RBNode<K,V> - Class in net.datastructures
-
Nested class for the nodes of a red-black tree
- reached - Variable in class net.datastructures.ConnectivityDFS
-
- rebalance(Position<Entry<K, V>>) - Method in class net.datastructures.AVLTree
-
Rebalance method called by insert and remove.
- redChild(Position<Entry<K, V>>) - Method in class net.datastructures.RBTree
-
Returns a red child of a node.
- rehash() - Method in class net.datastructures.HashTableMap
-
Doubles the size of the hash table and rehashes all the entries.
- remedyDoubleBlack(Position<Entry<K, V>>) - Method in class net.datastructures.RBTree
-
Remedies a double black violation at a given node caused by removal.
- remedyDoubleRed(Position<Entry<K, V>>) - Method in class net.datastructures.RBTree
-
Remedies a double red violation at a given node caused by insertion.
- remove(Entry<K, V>) - Method in interface net.datastructures.AdaptablePriorityQueue
-
Removes and returns an entry from the priority queue.
- remove(int) - Method in class net.datastructures.ArrayIndexList
-
Removes the element stored at the given index.
- remove() - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Removes and returns the element at the last node.
- remove(Entry<K, V>) - Method in class net.datastructures.AVLTree
-
Removes and returns an entry from the dictionary.
- remove(Entry<K, V>) - Method in class net.datastructures.BinarySearchTree
-
Removes and returns a given entry.
- remove() - Method in interface net.datastructures.CompleteBinaryTree
-
Removes and returns the element stored in the last node of the
tree.
- remove(Entry<K, V>) - Method in interface net.datastructures.Dictionary
-
Removes and returns the given entry from the dictionary.
- remove() - Method in class net.datastructures.ElementIterator
-
Throws an UnsupportedOperationException in all cases,
because removal is not a supported operation in this iterator.
- remove(K) - Method in class net.datastructures.HashTableMap
-
Removes the key-value pair with a specified key.
- remove(Entry<K, V>) - Method in class net.datastructures.HeapAdaptablePriorityQueue
-
Removes and returns the given entry from the heap.
- remove(int) - Method in interface net.datastructures.IndexList
-
Removes and returns the element at index i, shifting the elements after this.
- remove(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Removes a node with zero or one child.
- remove(K) - Method in interface net.datastructures.Map
-
Removes the key-value pair with a given key.
- remove(Position<E>) - Method in class net.datastructures.NodePositionList
-
Remove the given position from the list; O(1) time
- remove(Position<E>) - Method in interface net.datastructures.PositionList
-
Removes a node from the list, returning the element stored there.
- remove(Entry<K, V>) - Method in class net.datastructures.RBTree
-
Removes and returns the given entry from the dictionary.
- remove(Entry<K, V>) - Method in class net.datastructures.SortedListAdaptablePriorityQueue
-
Removes and returns the given entry
- removeAboveExternal(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Remove an external node v and replace its parent with v's
sibling
- removeEdge(Edge<E>) - Method in class net.datastructures.AdjacencyListGraph
-
Remove an edge and return its element
- removeEdge(Edge<E>) - Method in interface net.datastructures.Graph
-
Removes an edge and return its element
- removeExternal(Position<Entry<K, V>>) - Method in class net.datastructures.BinarySearchTree
-
Auxiliary method for removing an external node and its parent
- removeFirst() - Method in interface net.datastructures.Deque
-
Removes the first element; an exception is thrown if deque is empty.
- removeFirst() - Method in class net.datastructures.NodeDeque
-
- removeIncidence(Position<Edge<E>>) - Method in class net.datastructures.AdjacencyListGraph.MyVertex
-
Removes an edge from the incidence container of this vertex.
- removeLast() - Method in interface net.datastructures.Deque
-
Removes the last element; an exception is thrown if deque is empty.
- removeLast() - Method in class net.datastructures.NodeDeque
-
- removeMin() - Method in class net.datastructures.HeapPriorityQueue
-
Removes and returns an entry with minimum key
- removeMin() - Method in interface net.datastructures.PriorityQueue
-
Removes and returns an entry with minimum key.
- removeMin() - Method in class net.datastructures.SortedListPriorityQueue
-
Removes and returns an entry with minimum key.
- removeVertex(Vertex<V>) - Method in class net.datastructures.AdjacencyListGraph
-
Remove a vertex and all its incident edges and return the
element stored at the removed vertex
- removeVertex(Vertex<V>) - Method in interface net.datastructures.Graph
-
Removes a vertex and all its incident edges and returns the
element stored at the removed vertex
- replace(Position, Object) - Method in class net.datastructures.AdjacencyListGraph
-
Replace the element a given position (vertex or edge) with a new
element and return the old element
- replace(Vertex<V>, V) - Method in class net.datastructures.AdjacencyListGraph
-
- replace(Edge<E>, E) - Method in class net.datastructures.AdjacencyListGraph
-
- replace(Position<E>, E) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Replaces the element at v.
- replace(Vertex<V>, V) - Method in interface net.datastructures.Graph
-
Replaces the element of a given vertex with a new element and
returns the old element
- replace(Edge<E>, E) - Method in interface net.datastructures.Graph
-
Replaces the element of a given edge with a new element and
returns the old element
- replace(Position<E>, E) - Method in class net.datastructures.LinkedBinaryTree
-
Replaces the element at a node.
- replace(Position<E>, E) - Method in class net.datastructures.LinkedTree
-
Replaces the element at a node.
- replace(Position<E>, E) - Method in interface net.datastructures.Tree
-
Replaces the element stored at a given node.
- replaceEntry(Position<Entry<K, V>>, Entry<K, V>) - Method in class net.datastructures.BinarySearchTree
-
Replaces an entry with a new entry (and reset the entry's location)
- replaceEntry(Position, HeapAdaptablePriorityQueue.LocationAwareEntry<K, V>) - Method in class net.datastructures.HeapAdaptablePriorityQueue
-
Replaces the element of the given position with the given
location-aware entry.
- replaceKey(Entry<K, V>, K) - Method in interface net.datastructures.AdaptablePriorityQueue
-
Replaces the key of an entry and returns the old key.
- replaceKey(Entry<K, V>, K) - Method in class net.datastructures.HeapAdaptablePriorityQueue
-
Replaces the key of the given entry.
- replaceKey(Entry<K, V>, K) - Method in class net.datastructures.SortedListAdaptablePriorityQueue
-
Replaces the key of the given entry
- replaceValue(Entry<K, V>, V) - Method in interface net.datastructures.AdaptablePriorityQueue
-
Replaces the value of an entry and returns the old value.
- replaceValue(Entry<K, V>, V) - Method in class net.datastructures.HeapAdaptablePriorityQueue
-
Replaces the value of the given entry.
- replaceValue(Entry<K, V>, V) - Method in class net.datastructures.SortedListAdaptablePriorityQueue
-
Replaces the value of the given entry
- restructure(Position<Entry<K, V>>) - Method in class net.datastructures.BinarySearchTree
-
Performs a tri-node restructuring.
- result() - Method in class net.datastructures.DFS
-
Returns a result of a visit (if needed).
- right(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns the right child of v.
- right(Position<E>) - Method in interface net.datastructures.BinaryTree
-
Returns the right child of a node.
- right - Variable in class net.datastructures.EulerTour.TourResult
-
- right(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Returns the right child of a node.
- root() - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns the root of the tree.
- root - Variable in class net.datastructures.LinkedBinaryTree
-
- root() - Method in class net.datastructures.LinkedBinaryTree
-
Returns the root of the tree.
- root - Variable in class net.datastructures.LinkedTree
-
- root() - Method in class net.datastructures.LinkedTree
-
Returns the root of the tree.
- root() - Method in interface net.datastructures.Tree
-
Returns the root of the tree.
- S - Variable in class net.datastructures.ArrayStack
-
Array used to implement the stack.
- scale - Variable in class net.datastructures.HashTableMap
-
- Sequence<E> - Interface in net.datastructures
-
An interface for a sequence, a data structure supporting all
operations of a deque, indexed list and position list.
- serialVersionUID - Static variable in exception net.datastructures.InvalidKeyException
-
- set(int, E) - Method in class net.datastructures.ArrayIndexList
-
Replaces the element stored at the given index.
- set(int, E) - Method in interface net.datastructures.IndexList
-
Replaces the element at index i with e, returning the previous element at i.
- set(Position<E>, E) - Method in class net.datastructures.NodePositionList
-
Replace the element at the given position with the new element
and return the old element; O(1) time
- set(Position<E>, E) - Method in interface net.datastructures.PositionList
-
Replaces the element stored at the given node, returning old element.
- setBlack(Position<Entry<K, V>>) - Method in class net.datastructures.RBTree
-
Colors a node black.
- setChildren(PositionList<Position<E>>) - Method in class net.datastructures.TreeNode
-
Sets the right child of this position
- setChildren(PositionList<Position<E>>) - Method in interface net.datastructures.TreePosition
-
- setColor(boolean) - Method in class net.datastructures.RBTree.RBNode
-
- setColor(Position<Entry<K, V>>, boolean) - Method in class net.datastructures.RBTree
-
Sets the color of a node.
- setComparator(Comparator<K>) - Method in class net.datastructures.HeapPriorityQueue
-
Sets the comparator used for comparing items in the heap.
- setComparator(Comparator<K>) - Method in class net.datastructures.SortedListPriorityQueue
-
Sets the comparator for this priority queue.
- setElement(T) - Method in class net.datastructures.AdjacencyListGraph.MyPosition
-
Sets the element stored at this position.
- setElement(E) - Method in class net.datastructures.ArrayListCompleteBinaryTree.BTPos
-
- setElement(E) - Method in class net.datastructures.BTNode
-
Sets the element stored at this position
- setElement(E) - Method in interface net.datastructures.BTPosition
-
- setElement(E) - Method in class net.datastructures.DLNode
-
- setElement(E) - Method in class net.datastructures.DNode
-
- setElement(E) - Method in class net.datastructures.Node
-
- setElement(E) - Method in class net.datastructures.TreeNode
-
Sets the element stored at this position
- setElement(E) - Method in interface net.datastructures.TreePosition
-
- setHeight(int) - Method in class net.datastructures.AVLTree.AVLNode
-
- setHeight(Position<Entry<K, V>>) - Method in class net.datastructures.AVLTree
-
Sets the height of an internal node (call back to an AVLNode).
- setIncidences(Position<Edge<E>>, Position<Edge<E>>) - Method in class net.datastructures.AdjacencyListGraph.MyEdge
-
Sets the positions of the edge in the incidence containers of
its end vertices.
- setKey(K) - Method in class net.datastructures.HeapAdaptablePriorityQueue.LocationAwareEntry
-
- setKey(K) - Method in class net.datastructures.SortedListAdaptablePriorityQueue.LocationAwareEntry
-
- setLeft(BTPosition<E>) - Method in class net.datastructures.BTNode
-
Sets the left child of this position
- setLeft(BTPosition<E>) - Method in interface net.datastructures.BTPosition
-
- setLocation(Position<Edge<E>>) - Method in class net.datastructures.AdjacencyListGraph.MyEdge
-
Sets the position of the edge in the edge container of the
graph.
- setLocation(Position<Vertex<V>>) - Method in class net.datastructures.AdjacencyListGraph.MyVertex
-
Sets the position of this vertex in the vertex container of
the graph.
- setLocation(Position) - Method in class net.datastructures.HeapAdaptablePriorityQueue.LocationAwareEntry
-
- setLocation(Position<Entry<K, V>>) - Method in class net.datastructures.SortedListAdaptablePriorityQueue.LocationAwareEntry
-
- setNext(DLNode<E>) - Method in class net.datastructures.DLNode
-
- setNext(DNode<E>) - Method in class net.datastructures.DNode
-
- setNext(Node<E>) - Method in class net.datastructures.Node
-
- setParent(BTPosition<E>) - Method in class net.datastructures.BTNode
-
Sets the parent of this position
- setParent(BTPosition<E>) - Method in interface net.datastructures.BTPosition
-
- setParent(TreePosition<E>) - Method in class net.datastructures.TreeNode
-
Sets the parent of this position
- setParent(TreePosition<E>) - Method in interface net.datastructures.TreePosition
-
- setPrev(DLNode<E>) - Method in class net.datastructures.DLNode
-
- setPrev(DNode<E>) - Method in class net.datastructures.DNode
-
- setRed(Position<Entry<K, V>>) - Method in class net.datastructures.RBTree
-
Colors a node red.
- setRight(BTPosition<E>) - Method in class net.datastructures.BTNode
-
Sets the right child of this position
- setRight(BTPosition<E>) - Method in interface net.datastructures.BTPosition
-
- setup() - Method in class net.datastructures.ComponentsDFS
-
- setup() - Method in class net.datastructures.ConnectivityDFS
-
Executes the DFS algorithm.
- setup() - Method in class net.datastructures.DFS
-
Setup method that is called prior to the DFS execution.
- setup() - Method in class net.datastructures.FindCycleDFS
-
Executes the DFS algorithm.
- setup() - Method in class net.datastructures.FindPathDFS
-
Setup method to initialize the path.
- setValue(V) - Method in class net.datastructures.HashTableMap.HashEntry
-
- setValue(V) - Method in class net.datastructures.HeapAdaptablePriorityQueue.LocationAwareEntry
-
- setValue(V) - Method in class net.datastructures.SortedListAdaptablePriorityQueue.LocationAwareEntry
-
- shift - Variable in class net.datastructures.HashTableMap
-
- sibling(Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns the sibling of v.
- sibling(Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Return the sibling of a node
- size() - Method in class net.datastructures.ArrayIndexList
-
Returns the number of elements in the indexed list.
- size() - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns the number of (internal and external) nodes.
- size() - Method in class net.datastructures.ArrayStack
-
Returns the number of elements in the stack.
- size() - Method in class net.datastructures.BinarySearchTree
-
Returns the number of entries in the tree.
- size() - Method in interface net.datastructures.Deque
-
Returns the number of elements in the deque.
- size() - Method in interface net.datastructures.Dictionary
-
Returns the number of entries in the dictionary.
- size() - Method in class net.datastructures.HashTableMap
-
Returns the number of entries in the hash table.
- size() - Method in class net.datastructures.HeapPriorityQueue
-
Returns the size of the heap
- size() - Method in interface net.datastructures.IndexList
-
Returns the number of elements in this list.
- size - Variable in class net.datastructures.LinkedBinaryTree
-
- size() - Method in class net.datastructures.LinkedBinaryTree
-
Returns the number of nodes in the tree.
- size - Variable in class net.datastructures.LinkedTree
-
- size() - Method in class net.datastructures.LinkedTree
-
Returns the number of nodes in the tree.
- size() - Method in interface net.datastructures.Map
-
Returns the number of items in the map.
- size - Variable in class net.datastructures.NodeDeque
-
- size() - Method in class net.datastructures.NodeDeque
-
Return the size of the deque, that is the number of elements it has.
- size() - Method in class net.datastructures.NodePositionList
-
Returns the number of elements in the list; O(1) time
- size - Variable in class net.datastructures.NodeQueue
-
- size() - Method in class net.datastructures.NodeQueue
-
- size - Variable in class net.datastructures.NodeStack
-
- size() - Method in class net.datastructures.NodeStack
-
- size() - Method in interface net.datastructures.PositionList
-
Returns the number of elements in this list.
- size() - Method in interface net.datastructures.PriorityQueue
-
Returns the number of items in the priority queue.
- size() - Method in interface net.datastructures.Queue
-
Returns the number of elements in the queue.
- size() - Method in class net.datastructures.SortedListPriorityQueue
-
Returns the number of elements in the priority queue.
- size() - Method in interface net.datastructures.Stack
-
Return the number of elements in the stack.
- size() - Method in interface net.datastructures.Tree
-
Returns the number of nodes in the tree.
- Sort - Class in net.datastructures
-
Class containing various sorting algorithms.
- Sort() - Constructor for class net.datastructures.Sort
-
- SortedListAdaptablePriorityQueue<K,V> - Class in net.datastructures
-
Implementation of an adaptable priority queue by means of a sorted list.
- SortedListAdaptablePriorityQueue() - Constructor for class net.datastructures.SortedListAdaptablePriorityQueue
-
Creates the priority queue with the default comparator
- SortedListAdaptablePriorityQueue(Comparator<K>) - Constructor for class net.datastructures.SortedListAdaptablePriorityQueue
-
Creates the priority queue with the given comparator
- SortedListAdaptablePriorityQueue(PositionList<Entry<K, V>>, Comparator<K>) - Constructor for class net.datastructures.SortedListAdaptablePriorityQueue
-
Creates the priority queue with the given comparator and list.
- SortedListAdaptablePriorityQueue.LocationAwareEntry<K,V> - Class in net.datastructures
-
Inner class for a location-aware entry
- SortedListPriorityQueue<K,V> - Class in net.datastructures
-
Realization of a priority queue by means of a sorted node list in
nondecreasing order.
- SortedListPriorityQueue() - Constructor for class net.datastructures.SortedListPriorityQueue
-
Creates the priority queue with the default comparator.
- SortedListPriorityQueue(Comparator<K>) - Constructor for class net.datastructures.SortedListPriorityQueue
-
Creates the priority queue with the given comparator.
- SortedListPriorityQueue(PositionList<Entry<K, V>>, Comparator<K>) - Constructor for class net.datastructures.SortedListPriorityQueue
-
Creates the priority queue with the given comparator and list.
- SortedListPriorityQueue.MyEntry<K,V> - Class in net.datastructures
-
Inner class for entries
- Stack<E> - Interface in net.datastructures
-
Interface for a stack: a collection of objects that are inserted
and removed according to the last-in first-out principle.
- start - Variable in class net.datastructures.DFS
-
- startVisit(Vertex<V>) - Method in class net.datastructures.ComponentsDFS
-
- startVisit(Vertex<V>) - Method in class net.datastructures.ConnectivityDFS
-
- startVisit(Vertex<V>) - Method in class net.datastructures.DFS
-
Called when we encounter a vertex (v).
- startVisit(Vertex<V>) - Method in class net.datastructures.FindCycleDFS
-
- startVisit(Vertex<V>) - Method in class net.datastructures.FindPathDFS
-
- status(String, Object) - Method in class net.datastructures.ArrayStack
-
Prints status information about a recent operation and the stack.
- STATUS - Static variable in class net.datastructures.DFS
-
- status(Queue, String, Object) - Static method in class net.datastructures.NodeQueue
-
Prints information about an operation and the queue.
- status(Stack, String, Object) - Static method in class net.datastructures.NodeStack
-
Prints information about an operation and the stack.
- swap(Position<Entry<K, V>>, Position<Entry<K, V>>) - Method in class net.datastructures.HeapAdaptablePriorityQueue
-
Swaps the elements of the two positions.
- swap(Position<Entry<K, V>>, Position<Entry<K, V>>) - Method in class net.datastructures.HeapPriorityQueue
-
Swaps the entries of the two given positions
- swap(Position<Entry<K, V>>, Position<Entry<K, V>>) - Method in class net.datastructures.RBTree
-
Swaps the colors and elements at the two nodes.
- swapColor(Position<Entry<K, V>>, Position<Entry<K, V>>) - Method in class net.datastructures.RBTree
-
Swaps the colors of a and b if they are
different and returns whether a was red.
- swapElements(Position<E>, Position<E>) - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Swaps the elements at two nodes.
- swapElements(Position<E>, Position<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Swap the elements at two nodes
- swapElements(Position<E>, Position<E>) - Method in class net.datastructures.LinkedTree
-
Swap the elements at two nodes
- swapElements(Position<E>, Position<E>) - Method in class net.datastructures.NodePositionList
-
Swap the elements of two give positions; O(1) time
- T - Variable in class net.datastructures.ArrayListCompleteBinaryTree
-
- tail - Variable in class net.datastructures.NodeQueue
-
- tallerChild(Position<Entry<K, V>>) - Method in class net.datastructures.AVLTree
-
Return a child of p with height no smaller than that of the
other child.
- top - Variable in class net.datastructures.ArrayStack
-
Index of the top element of the stack in the array.
- top() - Method in class net.datastructures.ArrayStack
-
Inspects the element at the top of the stack.
- top - Variable in class net.datastructures.NodeStack
-
- top() - Method in class net.datastructures.NodeStack
-
- top() - Method in interface net.datastructures.Stack
-
Inspect the element at the top of the stack.
- toString() - Method in class net.datastructures.AdjacencyListGraph.MyEdge
-
Returns a string representation of the edge via a tuple of
vertices.
- toString() - Method in class net.datastructures.AdjacencyListGraph.MyVertex
-
Returns a string representation of the element stored at this
vertex.
- toString() - Method in class net.datastructures.AdjacencyListGraph
-
Returns a string representation of the vertex and edge lists,
separated by a newline.
- toString() - Method in class net.datastructures.ArrayListCompleteBinaryTree.BTPos
-
- toString() - Method in class net.datastructures.ArrayListCompleteBinaryTree
-
Returns a String representing this complete binary tree.
- toString() - Method in class net.datastructures.ArrayStack
-
Returns a string representation of the stack as a list of elements,
with the top element at the end: [ ...
- toString() - Method in class net.datastructures.HashTableMap.HashEntry
-
Entry visualization.
- toString() - Method in class net.datastructures.HeapPriorityQueue.MyEntry
-
- toString() - Method in class net.datastructures.HeapPriorityQueue
-
Text visualization for debugging purposes
- toString(PositionList<E>) - Static method in class net.datastructures.NodePositionList
-
Returns a textual representation of a given node list
- toString() - Method in class net.datastructures.NodePositionList
-
Returns a textual representation of the list
- toString() - Method in class net.datastructures.NodeQueue
-
- toString() - Method in class net.datastructures.NodeStack
-
Returns a string representation of the stack as a list of elements,
with the top element at the end: [ ...
- toString() - Method in class net.datastructures.SortedListPriorityQueue.MyEntry
-
- toString() - Method in class net.datastructures.SortedListPriorityQueue
-
- TourResult() - Constructor for class net.datastructures.EulerTour.TourResult
-
- trailer - Variable in class net.datastructures.NodeDeque
-
- trailer - Variable in class net.datastructures.NodePositionList
-
- traverseBack(Edge<E>, Vertex<V>) - Method in class net.datastructures.DFS
-
Called when we traverse a back edge (e) from a vertex (from).
- traverseBack(Edge<E>, Vertex<V>) - Method in class net.datastructures.FindCycleDFS
-
- traverseDiscovery(Edge<E>, Vertex<V>) - Method in class net.datastructures.DFS
-
Called when we traverse a discovery edge (e) from a vertex (from).
- traverseDiscovery(Edge<E>, Vertex<V>) - Method in class net.datastructures.FindCycleDFS
-
- traverseDiscovery(Edge<E>, Vertex<V>) - Method in class net.datastructures.FindPathDFS
-
- tree - Variable in class net.datastructures.EulerTour
-
- Tree<E> - Interface in net.datastructures
-
An interface for a tree where nodes can have an arbitrary number of children.
- TreeNode<E> - Class in net.datastructures
-
Class implementing a node of a binary tree by storing references to
an element, a parent node, a left node, and a right node.
- TreeNode() - Constructor for class net.datastructures.TreeNode
-
Default constructor
- TreeNode(E, TreePosition<E>, PositionList<Position<E>>) - Constructor for class net.datastructures.TreeNode
-
Main constructor
- TreePosition<E> - Interface in net.datastructures
-
Interface for a node of a binary tree.
- treeSearch(K, Position<Entry<K, V>>) - Method in class net.datastructures.BinarySearchTree
-
Auxiliary method used by find, insert, and remove.