- 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.
- set(int, E) - Method in class support.graph.NodeSequence
-
- set(Position<E>, E) - Method in class support.graph.NodeSequence
-
- 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
-
- 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.
- setDecoration(K, V) - Method in interface support.graph.CS16Decorator
-
Sets the decoration for some given key.
- 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
-
- setElement(Integer) - Method in class support.graph.GraphEdge
-
- setElement(V) - Method in class support.graph.GraphVertex
-
Sets the element stored in this vertex.
- setFromVertex(CS16Vertex<V>) - Method in interface support.graph.CS16Edge
-
Sets one of the edge's vertices to the given vertex.
- setFromVertex(CS16Vertex<V>) - Method in class support.graph.GraphEdge
-
- 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
-
- 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
-
- 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
-
- setToVertex(CS16Vertex<V>) - Method in interface support.graph.CS16Edge
-
Sets one of the edge's vertices to the given vertex.
- setToVertex(CS16Vertex<V>) - Method in class support.graph.GraphEdge
-
- 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
-
- setVertexNumber(Integer) - Method in interface support.graph.CS16Vertex
-
Sets the number corresponding to this vertex.
- setVertexNumber(Integer) - Method in class support.graph.GraphVertex
-
- 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() - Method in class net.datastructures.LinkedBinaryTree
-
Returns the number of nodes in the tree.
- 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() - 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() - Method in class net.datastructures.NodeQueue
-
- 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.
- size() - Method in class support.graph.CS16AdaptableHeapPriorityQueue
-
Returns the size of the heap.
- size() - Method in class support.graph.NodeSequence
-
- 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.
- 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.
- 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.
- status(String, Object) - Method in class net.datastructures.ArrayStack
-
Prints status information about a recent operation and the stack.
- 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.
- support.graph - package support.graph
-
- 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