A collection of algorithms.

1. order-1 voronoi sweep-line algorithm
2. r-tree*
3. r-star-tree (2-dimensional)
4. ss-tree*
5. random knapsack**
6. backtracking knapsack
7. str bulk-loaded r-tree*
8. improved str bulk-loaded r-tree*
9. vam-split r-tree*
10. hamiltonian chain enumeration
11. mira classifier
12. json parser
13. brute-force student id censorer
14. uri parser
15. basic incognito k-anonymization with suppression
16. naive all-pairs intersected rectangles with static d-fold rectangle tree variant***
17. x-tree
18. r-star-tree (d-dimensional)
19. parallel coordinates plot with interval attribute midpoints and cell omission using hidden segments
20. rule mining parallel coordinates plot user interface
21. quantitative/categorical apriori-based association rule mining
22. bundle #1 - order maintenance list, doubly linked list, adaptable priority queue, heap, splay tree, scapegoat tree, complete binary tree; use concepts of location-aware entries, non-traditional leaf in-order pointers, lazy-remove, custom key transform, custom comparator, height-aware node, label-aware node, path labels
23. bundle #1 - red-black tree
24. bundle #1 - 1-d segment tree
25. bundle #1 - 2-d segment tree with rectangle segments
26. cooley-tukey FFT (i.e. using complex arithmetic)
27. basic and extended s-expression parsers
28. knuth-morris-pratt (KMP) pattern-matching; shortest repeating sub-pattern (SRSP) in linear time
29. fast walsh-hadamard transform and hard-coded inverse transform
30. number theoretic transform (NTT) flavor of FFT (i.e. using modular arithmetic)
31. prim-jarnik MST algorithm
32. disjoint set union-find data structure with union-by-size and path compression and named variant
33. LCA algorithm from bender and farach-colton
34. SCC algorithm from kosaraju and sharir
35. flow-graph intervals and bridges algorithm via tarjan 1976
36. strongly connected graph strong bridges via italiano et al. 2012
37. simple2ecb for 2-edge-connected blocks in strongly connected graphs via georgiadis et al. 2014
38. dominator tree construction algorithms via fraczak et al. 2013 (AD #1, AD #2, AD #3, GD #1, GD #2, GD #3, HD) and optimized version for GD #2
39. rec2ecb for 2-edge-connected blocks in strongly connected graphs via georgiadis et al. 2014
40. fast2ecb for 2-edge-connected blocks in strongly connected graphs via georgiadis et al. 2014
41. strongly connected graph strong articulation points via italiano et al. 2012
42. simplevrb for vertex-resilient blocks in strongly connected graphs via georgiadis et al. 2015
43. fastvrb for vertex-resilient blocks in strongly connected graphs via georgiadis et al. 2015
44. union-tree disjoint set union-find data structure via gabow and tarjan 1985
45. block forest for vrb
46. 2ecb, vrb, 2vcb oracles
47. bundle #1 - 1-d and 2-d range trees

*: tree is for 2-dimensional objects

**: not faster than d.p. when d.p. is possible

***: slower than brute force with pypy until n ~= 1000 for d = 35