Index A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W A Abstract Data Type Graph add() (in module oset) (in module tries) adjacency ADT Deque Queue Sequence Stack algorithm all-pairs shortest path B Bellman-Ford algorithm binary search Breadth-first Graph Traversal breadth-first search, [1], [2] built-in function seq.sort() C cardinal() (in module oset) clustering components computation computational problem computer vision contains() (in module map) (in module oset) (in module pq) (in module tries) correctness deduction system definition proof testing create() (in module deque) (in module iterator) (in module map) (in module oset) (in module pq) (in module queue) (in module seq) (in module stack) cycle, [1], [2] D data Data Structure Graph data structure Depth-first Graph Traversal depth-first search Deque ADT deque module dequeue() (in module pq) (in module queue) dequeueBack() (in module deque) dequeueFront() (in module deque) Dijkstra's algorithm disjoint sets dynamic programming E edge edge relaxation edge weight enqueue() (in module pq) (in module queue) enqueueBack() (in module deque) enqueueFront() (in module deque) F flowchart Floyd-Warshall algorithm forest G get() (in module map) (in module seq) Graph Data Structure graph cycle loop path graph traversal greedy algorithm, [1] H hasNext() (in module iterator) I image segmentation incidence insert() (in module seq) interpolation search item() (in module iterator) iterator module J jump search K Kruskal's algorithm L length() (in module deque) (in module queue) (in module seq) (in module stack) loop loop invariant M map module maximum() (in module oset) minimum spanning tree, [1], [2] minimum() (in module oset) module deque iterator map oset pq queue seq stack tries MST N negative cycle, [1], [2] negative edge negative weights next() (in module iterator) O oset module P path, [1] peek() (in module pq) pop() (in module stack) positive cycle pq module predecessor() (in module oset) prefix_search() (in module tries) Prim's algorithm program pseudocode push() (in module stack) put() (in module map) Q Queue ADT queue module R RAM architecture assembly code instructions reachability relaxation remove() (in module map) (in module oset) (in module seq) (in module tries) S search() (in module seq) seq module seq.sort() built-in function Sequence ADT shortest path, [1], [2], [3], [4] shortest path existence shortest path problem, [1] single-linkage clustering size() (in module map) (in module pq) spanning tree Stack ADT stack module successor() (in module oset) symbol T testing assertions automation test case selection top() (in module stack) traveling salesperson problem tree tries module TSP approximation U union-find unweighted graph V vertex adjacent W walk, [1] weighted graph, [1] weighted shortest path
