Summary of OI knowledge points

Summary of OI knowledge points

HEY

• • [ ] Graph Theory
• • • [x] Storage of graphs
• • • [ ] Graph connectivity
• • • [ ] Connected components
• • • [ ] Euler diagrams and Euler circuits
• • • [x] Shortest path algorithm
• • • • [x]SPFA
• • • • [x] dijkstra
• • • • [x] Floyd
• • • [x] Shortest path count
• • • [ ] Tarjan
• • • [ ] binary picture
• • • [x] Topological Sort
• • [ ] Tree theory
• • • [ ] dfs order
• • • [ ] LCA
• • • [ ] Minimum spanning tree
• • • • [x] kruskal
• • • • [x] prim
• • • [x] Huffman tree
• • [ ] Dynamic programming
• • • [ ] Serial DP
• • • [ ] Backpack DP
• • • [ ] Interval DP
• • • [ ] Ring DP
• • • [ ] Checkerboard DP
• • • [ ] Multidimensional DP
• • • [ ] Digital DP
• • • [ ] shape pressure DP
• • • [ ] Multi-threaded DP
• • • [ ] Expected DP
• • • [ ] Tree DP
• • [ ] data structure
• • • [x] stack
• • • [x] queue
• • • [x] array
• • • [x] linked list
• • • [ ] heap
• • • [x] Line segment tree primary
• • • [x] Segment Tree Advanced
• • • [x] tire tree
• • • [x] Union lookup
• • • [ ] hash
• • • [ ] tree array
• • • [ ] Balanced tree
• • [ ] String arithmetic
• • • [] KMP
• • • [ ] hash
• • • [ ] BM
• • • [ ] Sunday
• • • [x] Trie tree
• • [ ] Number Theory
• • • [ ] Extended Euclidean
• • • [ ] Linear sieve primes
• • • [x] fast power
• • • [ ] Matrix fast power
• • • [ ] Pei Shu Theorem
• • • [ ] Euler function
• • • [x] Yang Hui Triangle
• • • [ ] Lucas' theorem
• • • [ ] Inclusion and exclusion principle
• • • [ ] Chinese remainder theorem