ACM template Finishing:
Math:
Number Theory - Cantor Cantor launched against expansion and Templates
Number theory - the number of combinations (Lucas + extension Lucas) template
Number theory -Miller_Rabin determine prime numbers
Number Theory - Chinese remainder theorem template
Number Theory - inverse (expand Euclid) template
Number Theory - inverse (Fermat's little theorem) template
Mathematics - Number Theory - factor and linear sieve (template)
Mathematics - Number Theory - Quick power - the common denominator - bit computing Templates
Screen template is linear function of the product
Mathematics - graph theory - Mobius linear screen template
Mathematics - Number Theory - Euler screen template
Mathematics - Number Theory - prime number
Graph Theory:
Shortest:
Graph theory - the shortest - K-short circuit (IDA *) (IDA Star) template
Graph theory - the shortest --dijkstra (including the path output) template
Graph theory - the longest road - based adjustment templates SPFA
Transitive Closure:
Euler and Hamilton paths:
Graph Theory - Euler - Fu Luolai algorithm template
LCA：
Graph Theory --LCA - Tarjan (offline)
Graph Theory --LCA-- tree multiplication method (online)
Graph Theory --LCA-- online RMQ ST
The smallest ring:
Graph theory - the smallest ring --Floyd template
Tree diameter:
FIG theory - the diameter of the tree template --DFS + tree DP
Tree of focus:
Graph theory - the center of gravity of the tree (DFS) template
Spanning Tree:
Graph theory - minimum spanning tree --Kruscal template
Graph theory - the shortest path spanning tree (right side and minimum) template
Graph theory - the shortest path spanning tree count - Template
Graph theory - Spanning Tree - the second smallest Spanning Tree Template
Graph Theory - Manhattan from the minimum spanning tree template
Graph theory - spanning count template
Graph theory - --Prim minimum spanning tree algorithm (band edge output) template
Connectivity:
Graph Theory - cut points --Tarjan template
Graph theory - cutting edge --Tarjan template
FIG Theory - bis edge V-DCC condensation point communication
FIG Theory - bis E-DCC condensation point communication template
Graph Theory - strongly connected SCC shrink point template
Bipartite graph matching:
Graph Theory - bipartite graph maximum matching - Hungary
Graph Theory - bipartite graph best perfect match --KM
FIG blooms with generally matching:
Graph Theory - General view of the belt matching blooms (condensing point)
Network flow:
The maximum flow (Dinic matrix version)
The maximum flow (Dinic adjacency list version)
2-SAT:
Seeking lexicographically smallest stencil 2-SAT-- staining violence
2-SAT-- violence staining template (minimum solution lexicographical) RQ board
2-SAT - Tarjan topological sort connected components + O (N + M) Template
Topological sorting:
Graph theory - topological sorting - to determine whether the DAG
Differential constraints:
Graph Theory - differential constraint template
