Number Theory
- prime number
- greatest common divisor
- Euler function (unfamiliar)
- Sieve method
- Euler's Theorem & Fermat's Little Theorem (not familiar with it)
- Euclidean-like algorithm
- Peishu theorem
- Multiplicative inverse (unfamiliar) (link)
- Linear congruence equation (unfamiliar)
- Chinese Remainder Theorem
- quadratic remainder
- BSGS
- original root
- Lucas theorem (proof)
- Möbius inversion
- Du Jiaosie
- Min_25 sieve
- Factoring prime factors
string
- string matching
- string hash
- Dictionary tree (Trie)
- Prefix function and KMP algorithm (unfamiliar)
- Boyer-Moore algorithm
- Z function (extended KMP)
- Automata
- AC automatic machine (unfamiliar)
- Suffix array (SA)
- Suffix Automata (SAM)
- Generalized suffix automata
- suffix tree
- Manacher(unfamiliar)
- palindrome tree
- sequential automata
- minimal representation
- Lyndon Decomposition
data structure
- stack
- queue
- linked list
- Hash table
- And search the collection
- Heap (only ordinary heap)
- Block data structures (very unfamiliar)
- monotonic stack
- monotonic queue
- ST table (unfamiliar)
- tree array
- Segment tree
- Li Chao line segment tree
- Interval maximum value operation & interval historical maximum value
- Partition tree
- Binary search tree & balanced tree
- Treap
- Splay
- WBLT
- Size Balanced Tree
- AVL tree
- scapegoat tree
- Cartesian tree
- Left-biased red-black tree
- Jump table
- Persistent segment trees
- Persistent block array
- Persistible balanced tree
- Persistent dictionary tree
- Durable and heap-combinable
- Line segment tree within line segment tree
- Balanced tree set within line segment tree
- Balanced tree within line segment tree
- Tree Array Set Chairman Tree
- Blocked tree array
- K-D Tree
- Khodori tree
- dynamic tree
- analysis tree
Graph Theory
- Graph storage
- DFS (graph theory)
- BFS (graph theory)
- tree diameter
- most recent common ancestor
- center of gravity of tree
- tree chain splitting
- Heuristic merging on trees
- virtual tree
- tree divide and conquer
- Dynamic tree divide and conquer
- AHU algorithm
- tree hash
- Matrix tree theorem
- directed acyclic graph
- topological sort
- minimum spanning tree
- steiner tree
- minimal tree diagram
- minimum diameter spanning tree
- shortest route
- Split points
- differential constraints
- k short circuit
- Same shortest route
- Strongly connected component
- biconnected component
- cut points and bridges
- round square tree
- 2-SAT
- Euler diagram
- Hamiltonian graph
- binary picture
- minimal ring
- floor plan
- Coloring of Figures
- Maximum flow (unfamiliar)
- Minimum cut (unripe)
- cost flow
- upper and lower bound network flow
- graph matching
- Zengguang Road (not familiar)
- 二分图最大匹配(不熟)
- 二分图最大权匹配
- 一般图最大匹配
- 一般图最大权匹配
- Prufer 序列
- LGV 引理
- 弦图