Basic algorithm
Greedy, enumeration, partition, half, doubling, * configuration, high-precision analog
Graph Theory
FIG
shortest (dijkstra, spfa, floyd), differential constrained
minimum spanning tree (kruskal, prim)
disjoint-set (an extension field)
topological sort
bipartite graph coloring, * bipartite graph matching
tarjan find SCC, bridge, cut point, condensing point
* planning score
tree
tree multiplier (LCA)
tree diameter, the center of gravity of the tree
dfs sequence
* Partition tree chain
Number Theory
gcd, lcm
Erichsen sieve
exgcd, solve the congruence equation, inverse
fast power
* combination of mathematics
matrix
data structure
Linked lists, queues (queue monotone), the stack (Stack monotone)
heap, st table, hash table
segment tree, tree array
trie
* Block
Dynamic Programming
Backpack DP, tree DP, memory search, recursive
interval DP, sequence the DP
* the DP optimization (no optimization slope, like a quadrangle inequality)
search for
Violent search (dfs, bfs)
pruning search
heuristic search (A *)
iterative deepening search, IDA * *
* random search
Other algorithms
STL basic use of
the proper use of brain-hole
* KMP
* compressed state