A* | acyclic | adjacency list |
adjacency matrix | arc | AVL tree |
balanced tree | bandwidth | B-tree |
bijective | binary heap | binding |
binding list | Boolean matrix | bucket |
cache | Cartesian product | clustering |
collision | comparison | critical path |
cycle | DAG | dense graph |
Dijkstra's algorithm | directed | directed acyclic graph |
discrete event simulation | domain | edge |
exclusive or | external sort | |
fold | geometric series | gradient ascent |
graph | ||
greedy algorithm | hash function | hashing with buckets |
heuristic | ||
in-place | injective | internal sort |
iterator | latency | load factor |
map | mapping | master |
max queue | memory hierarchy | memory locality |
min queue | minimum spanning tree | on-line |
one-to-one | onto | parsing |
path | pattern | pattern variable |
pivot | priority queue | randomized algorithm |
range | Red-Black tree | reduce |
rehash | ||
row-major order | scalability | separate chaining |
shortest path | ||
simple path | slack | slave |
sparse array | sparse graph | spatial locality |
Splay tree | stable | surjective |
symbol table | temporal locality | topological sort |
tree rotation | undirected | unparsing |
vertex | weight | XOR |