- 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.
- add(int, E) - Method in class support.graph.NodeSequence
-
- 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.
- addAfter(Position<E>, E) - Method in class support.graph.NodeSequence
-
- 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.
- addBefore(Position<E>, E) - Method in class support.graph.NodeSequence
-
- addCloudAnimation(CS16Decorator<CS16Vertex<V>, Integer>, CS16Decorator<CS16Vertex<V>, CS16Vertex<V>>) - Method in interface support.graph.CS16GraphVisualizer
-
Adds a cloud animation.
- addEdgeAnimation(CS16Decorator<CS16Edge<V>, Boolean>) - Method in interface support.graph.CS16GraphVisualizer
-
Adds an edge animation.
- 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.
- addFirst(E) - Method in class support.graph.NodeSequence
-
- 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.
- addLast(E) - Method in class support.graph.NodeSequence
-
- 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
- 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
- areAdjacent(CS16Vertex<V>, CS16Vertex<V>) - Method in interface support.graph.Graph
-
Returns true if there exists an Edge that connects Vertex v1 and Vertex
v2.
- 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
- 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.
- atIndex(int) - Method in class support.graph.NodeSequence
-
- attach(Position<E>, BinaryTree<E>, BinaryTree<E>) - Method in class net.datastructures.LinkedBinaryTree
-
Attaches two trees to be subtrees of an external node.
- 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
-