Index A | B | C | D | E | F | G | H | I | J | L | M | N | O | P | Q | R | S | T | V | W A Abstract Data Type Graph add() (in module oset) adjacency ADT Deque Queue Sequence Stack algorithm B binary search Breadth-first Graph Traversal, [1] built-in function seq.sort() C cardinal() (in module oset) computation computational problem contains() (in module map) (in module oset) (in module pq) 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 D data Data Structure Graph data structure Depth-first Graph Traversal, [1] Deque ADT deque module dequeue() (in module pq) (in module queue) dequeueBack() (in module deque) dequeueFront() (in module deque) E edge enqueue() (in module pq) (in module queue) enqueueBack() (in module deque) enqueueFront() (in module deque) F flowchart G get() (in module map) (in module seq) Graph Data Structure graph cycle loop path H hasNext() (in module iterator) I incidence insert() (in module seq) interpolation search item() (in module iterator) iterator module J jump search 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() (in module oset) module deque iterator map oset pq queue seq stack N next() (in module iterator) O oset module P path peek() (in module pq) pop() (in module stack) pq module predecessor() (in module oset) program pseudocode push() (in module stack) put() (in module map) Q Queue ADT queue module R RAM architecture assembly code instructions remove() (in module map) (in module oset) (in module seq) S search() (in module seq) seq module seq.sort() built-in function Sequence ADT size() (in module map) (in module pq) Stack ADT stack module successor() (in module oset) symbol T testing assertions automation test case selection top() (in module stack) V vertex adjacent W walk
