Difference between revisions of "Standard Library"
Jump to navigation
Jump to search
(→Others) |
|||
| Line 19: | Line 19: | ||
== Graph Theory == | == Graph Theory == | ||
| + | * [[Eulerian Path]] | ||
* [[Connected Component, 2-SAT]] | * [[Connected Component, 2-SAT]] | ||
* [[Spanning Trees]] | * [[Spanning Trees]] | ||
Revision as of 12:50, 22 March 2018
Java
Calculation
Data Structures
- Binary-Indexed Tree
- Segment Tree
- Sparse Table
- Heap
- Self-Balanced BST
- Persistence Data Structures
- Link-Cut Tree
- Cartesian Tree
Graph Theory
- Eulerian Path
- Connected Component, 2-SAT
- Spanning Trees
- Bipartite Graph
- Network Flow
- Maximal Clique
- Perfect Elimination Ordering
- Tree and Graph Isomorphism
Geometry
Linear Algebra
Number Theory
- Multiply, Power and Inverse
- Sieve
- Extended Euclid
- Chinese Remainder Theorem
- Primitive Root
- Quadratic Residue and Discrete Roots
- Discrete Logarithm
- Miller-Rabin
- Pollard's Rho
- Gaussian Elimination
- NTT & FFT
Others
- FastIO
- Date Magic
- Discretization
- Permutation Rank
- Expression Parsing
- Kth Number
- Longest Common Sequence
- Area and Circumference Union
- Mo's Algorithm
- Digit DP