- DSU
- Fenwick Tree
- 2D Fenwick Tree
- Fenwick Tree with RMQ
- Link Cut Tree
- Segment Tree
- Sparse Table
- Splay Tree
- Treap Tree
-
Edmonds Blossom-Contraction Algorithm
- Solves maximum cardinality matchings
- Time Complexity $\Theta(|V||E|^2)$
-
Dinic
-
Flow graph
-
Hungarian
- Combinatorial optimization algorithm
- Solves assignment problem
- Time complexity $\Theta(n^3)$, strictly polynomial
-
Matching
- Solves bipartite graph maximum matching
-
Minimum Cost Maximum Flow
- Edge Biconnected Component
- Vertex Biconnected Component
- Bridges
- Cut Points
- Graph classes
- Undirected graph
- Directed graph
- Forest classes
- DFS (initializes some useful vectors)
- Lowests Common Ancestor
- Heavy Light Decomposition
- Minimum Spanning Tree
- Strongly Connected Components
- 2-SAT
- Eulerian Path
- Dijkstra (heap version)
- Find cycles
- Topsort
- Fast Input & Output
- RNG
- Chinese Remainder Theorem Garner's Algorithm
- Extended GCD
- Fast Fourier Transform
- Gaussian Elimination
- Modular Integer
- Number Theroy Transform
- Polynomial
- Boyer Moore Algorithm
- Solves Pattern Matching
- Worst Time Complexity $\Theta(NM)$
- Best Time Complexity $\Theta\left(\frac{N}{M}\right)$
- Manacher
- Finds palindromes with odd length, modify if needs even length palindromes
- Linear Time Complexity
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent