motion-planning 8 
kd-trees ANN 9
nearest-neighbor ANN 9
unconstrained-optimization ASA 6
voronoi-diagrams CONVEX-HUL
convex-hull CONVEX-HULL-JAVA 5
fourier-transform FFT 9
traveling-salesman GAPlay 4
unconstrained-optimization GAPlay 5
text-compression JPEG 6
dictionaries LEDA 10
graph-data-structures LEDA 10
determinants LEDA 2
linear-equations LEDA 3
graph-partition LEDA 4
matrix-multiplication LEDA 4
random-numbers LEDA 4
generating-graphs LEDA 5
high-precision-arithmetic LEDA 5
network-flow LEDA 5
set-data-structures LEDA 5
convex-hull LEDA 6
minimum-spanning-tree LEDA 6
nearest-neighbor LEDA 6
transitive-closure LEDA 6
triangulations LEDA 6
voronoi-diagrams LEDA 6
intersection-detection LEDA 7
maintaining-arrangements LEDA 7
matching LEDA 7
planar-drawing LEDA 7
point-location LEDA 7
range-search LEDA 7
searching LEDA 7
shortest-path LEDA 7
topological-sorting LEDA 7
dfs-bfs LEDA 8
geometric-primitives LEDA 8
priority-queues LEDA 9
linear-programming NEOS 7
unconstrained-optimization NEOS 8
network-flow NEOS 9
polygon-partitioning ParMetis 4
generating-partitions ParMetis 7
graph-partition ParMetis 9
intersection-detection RAPID 8
motion-planning RAPID 9
generating-partitions SAT 4
satisfiability SAT 5
intersection-detection SOLID 7
motion-planning SOLID 8
intersection-detection V-CLIP 9
motion-planning V_COLLIDE 7
intersection-detection V_COLLIDE 8
approximate-pattern-matching agrep 10
point-location arrange 6
maintaining-arrangements arrange 9
matching bipm 8
linear-programming cGOP 5
unconstrained-optimization cGOP 6
longest-common-substring cap 8
shortest-common-superstring cap 8
eulerian-cycle chinese-postman 6
convex-hull clarkson 6
independent-set clique 5
clique clique 6
vertex-coloring clique 6
vertex-cover clique 6
clique combinatorica 1
longest-common-substring combinatorica 2
planar-drawing combinatorica 2
sorting combinatorica 2
dfs-bfs combinatorica 3
eulerian-cycle combinatorica 3
graph-isomorphism combinatorica 3
hamiltonian-cycle combinatorica 3
matching combinatorica 3
minimum-spanning-tree combinatorica 3
network-flow combinatorica 3
shortest-path combinatorica 3
topological-sorting combinatorica 3
traveling-salesman combinatorica 3
vertex-coloring combinatorica 3
determinants combinatorica 4
edge-coloring combinatorica 4
edge-vertex-connectivity combinatorica 4
transitive-closure combinatorica 4
vertex-cover combinatorica 4
drawing-graphs combinatorica 6
drawing-trees combinatorica 6
graph-data-structures combinatorica 6
generating-partitions combinatorica 7
generating-permutations combinatorica 7
generating-subsets combinatorica 7
generating-graphs combinatorica 8
edge-coloring culberson 4
vertex-coloring culberson 6
drawing-graphs da-Vinci 5
drawing-trees da-Vinci 5
dictionaries dimacs 1
kd-trees dimacs 1
priority-queues dimacs 1
vertex-cover dimacs 5
independent-set dimacs 7
vertex-coloring dimacs 7
network-flow dimacs 8
satisfiability dimacs 8
clique dimacs 9
matching dimacs 9
minkowski-sum eppstein 4
string-matching eppstein 4
fourier-transform fftpack 10
triangulations fortune 7
drawing-graphs ged 5
drawing-trees ged 5
unconstrained-optimization genocop 5
geometric-primitives geolab 5
polygon-partitioning geompack 8
triangulations geompack 8
clique gmt 5
independent-set gmt 5
shape-similarity gmt 5
graph-isomorphism gmt 9
network-flow goldberg 10
matching goldberg 9
shortest-path goldberg 9
finite-state-minimization grail 9
generating-graphs graphbase 10
priority-queues graphbase 2
cryptography graphbase 3
shortest-path graphbase 3
topological-sorting graphbase 3
voronoi-diagrams graphbase 3
dfs-bfs graphbase 4
edge-vertex-connectivity graphbase 4
feedback-set graphbase 4
hamiltonian-cycle graphbase 4
matching graphbase 4
minimum-spanning-tree graphbase 4
generating-partitions graphbase 5
generating-permutations graphbase 5
graph-data-structures graphbase 6
random-numbers graphbase 6
network-flow graphed 3
dfs-bfs graphed 4
triangulations graphed 4
graph-data-structures graphed 8
planar-drawing graphed 8
drawing-graphs graphed 9
drawing-trees graphed 9
approximate-pattern-matching handbook 2
range-search handbook 2
suffix-trees handbook 2
kd-trees handbook 3
string-matching handbook 4
finite-state-minimization handbook 5
high-precision-arithmetic handbook 6
median handbook 6
priority-queues handbook 7
searching handbook 7
sorting handbook 7
dictionaries handbook 8
approximate-pattern-matching htdig 7
finite-state-minimization jct 3
linear-equations lapack 10
set-data-structures link 4
graph-data-structures link 6
graph-partition link 8
matrix-multiplication linpack 7
determinants linpack 8
linear-programming linprog 4
linear-programming lpsolve 9
matrix-multiplication math 6
convex-hull moret 3
intersection-detection moret 3
nearest-neighbor moret 3
point-location moret 3
priority-queues moret 3
searching moret 3
topological-sorting moret 3
dfs-bfs moret 4
edge-vertex-connectivity moret 4
fourier-transform moret 4
geometric-primitives moret 4
graph-data-structures moret 4
matching moret 4
network-flow moret 4
set-data-structures moret 4
minimum-spanning-tree moret 5
sorting moret 7
graph-isomorphism nauty 10
drawing-graphs north 7
drawing-trees north 7
linear-programming opbdp 7
satisfiability opbdp 7
motion-planning orourke 3
point-location orourke 3
triangulations orourke 3
voronoi-diagrams orourke 4
intersection-detection orourke 5
nearest-neighbor orourke 5
convex-hull orourke 6
geometric-primitives orourke 6
factoring-integers pari 9
high-precision-arithmetic pari 9
cryptography pgp 10
steiner-tree phylip 7
satisfiability posit 8
convex-hull qhull 10
intersection-detection qhull 5
triangulations qhull 6
voronoi-diagrams qhull 7
random-numbers random-numbers 8
range-search ranger 6
nearest-neighbor ranger 7
kd-trees ranger 8
calendar-calculations reingold 10
generating-graphs ruskey 7
generating-partitions ruskey 7
generating-subsets ruskey 7
generating-permutations ruskey 8
steiner-tree salowe 8
fourier-transform sedgewick 2
linear-programming sedgewick 2
matching sedgewick 2
high-precision-arithmetic sedgewick 3
minimum-spanning-tree sedgewick 3
random-numbers sedgewick 3
topological-sorting sedgewick 3
geometric-primitives sedgewick 4
range-search sedgewick 4
string-matching sedgewick 4
sorting sedgewick 5
priority-queues simpack 7
random-numbers simpack 7
simplifying-polygons skeleton 5
thinning skeleton 9
shape-similarity snns 7
bandwidth stony 6
edge-coloring stony 6
suffix-trees stony 6
linear-programming syslo 3
matching syslo 3
minimum-spanning-tree syslo 3
knapsack syslo 4
network-flow syslo 4
scheduling syslo 4
vertex-coloring syslo 4
set-cover syslo 5
set-packing syslo 5
shortest-path syslo 5
traveling-salesman syslo 5
convex-hull toms 3
cryptography toms 3
generating-subsets toms 3
matching toms 3
priority-queues toms 3
voronoi-diagrams toms 3
linear-programming toms 4
scheduling toms 4
shortest-path toms 4
sorting toms 4
triangulations toms 4
high-precision-arithmetic toms 5
minimum-spanning-tree toms 5
text-compression toms 5
fourier-transform toms 6
generating-partitions toms 6
hamiltonian-cycle toms 6
knapsack toms 6
matrix-multiplication toms 6
random-numbers toms 6
traveling-salesman toms 6
linear-equations toms 7
unconstrained-optimization toms 8
bandwidth toms 9
triangulations triangle 9
edge-coloring trick 4
vertex-coloring trick 7
traveling-salesman tsp 8
shape-similarity turn 6
string-matching watson 7
finite-state-minimization watson 8
dfs-bfs wilf 2
eulerian-cycle wilf 3
minimum-spanning-tree wilf 3
network-flow wilf 3
sorting wilf 3
vertex-coloring wilf 3
determinants wilf 4
generating-graphs wilf 4
hamiltonian-cycle wilf 5
generating-partitions wilf 8
generating-permutations wilf 8
generating-subsets wilf 8
finite-state-minimization xtango 1
intersection-detection xtango 1
dfs-bfs xtango 2
matrix-multiplication xtango 2
topological-sorting xtango 2
bin-packing xtango 3
fourier-transform xtango 3
hamiltonian-cycle xtango 3
random-numbers xtango 3
string-matching xtango 3
traveling-salesman xtango 3
convex-hull xtango 4
median xtango 4
minimum-spanning-tree xtango 4
priority-queues xtango 4
shortest-path xtango 4
vertex-coloring xtango 4
dictionaries xtango 5
sorting xtango 6L-JAVA 6
voronoi-diagrams fortune 9