Index A | B | C | D | E | F | G | H | I | J | L | M | N | P | Q | R | S | T | V | W A Abstract Data Type Graph, [1] adjacency ADT Deque Queue Sequence Stack algorithm B binary search Breadth-first Graph Traversal, [1], [2] built-in function seq.sort() C computation computational problem contains() (in module map) correctness deduction system definition proof testing create() (in module deque) (in module iterator) (in module map) (in module queue) (in module seq) (in module stack) cycle D data Data Structure Graph, [1] data structure Depth-first Graph Traversal, [1], [2] Deque ADT deque module dequeue() (in module queue) dequeueBack() (in module deque) dequeueFront() (in module deque) E edge enqueue() (in module queue) enqueueBack() (in module deque) enqueueFront() (in module deque) F flowchart G get() (in module map) (in module seq) Graph Data Structure, [1] 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 module deque iterator map queue seq stack N next() (in module iterator) P path pop() (in module stack) 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 seq) S search() (in module seq) seq module seq.sort() built-in function Sequence ADT size() (in module map) Stack ADT stack module symbol T testing assertions automation test case selection top() (in module stack) V vertex adjacent W walk
