Main content of ACM

Transferred from: http://blog.csdn.net/hnuzengchao/article/details/7283609

1: Mathematics 1.1: Number theory

1.1.1: The Chinese remainder theorem
1.1.2: Euler function
1.1.3: Euclidean theorem
1.1.3.1: Euclidean theorem
1.1.3.2: Expanding Euclid
1.1.4: Decomposition of large numbers and determination of prime numbers
1.1.5: the Pell equation

1.2: Combinatorial Mathematics

1.2.1: permutations and combinations
1.2.2: The principle of tolerance and repulsion
1.2.3: Recursive relationships and generating functions
1.2.4:polya Counting method
1.2.4.1:polya Counting formula
1.2.4.2:burnside theorem

1.3: Calculation method

1.3.1: Method of dichotomy
1.3.1.1: Calculation with matrix acceleration
1.3.2: Iterative method
1.3.3: Three-part method
1.3.4: Solving systems of linear equations
1.3.4.1:lup decomposition
1.3.4.2: Gaussian elimination element
1.3.5: Chenmo linear equation Group
1.3.6: Definite integral calculation
1.3.7: The polynomial root-finding
1.3.8: Periodic equations
1.3.9: Linear programming
1.3.10: Fast Fourier transform
1.3.11: Stochastic algorithm

1.4: Construction Method

The structural solution of Queen 1.4.1:n
1.4.2: The structure of magic square
1.4.3: The construction of Hamilton Circle satisfying certain conditions

1.5: The special number

Number of 1.5.1:catalan
Number of 1.5.2:stirling
1.5.3: Fibonacci number
1.5.4: Modulation and Sum
1.5.4: Even Fractions

2: Data structure

2.1: Stack, queue, list
2.2: Hash Table
2.3: Heap, priority queue
2.3.1: Left-leaning tree
2.4: Two fork Find tree
2.4.1:treap
2.4.2: Stretching tree
2.5: And check set
2.6: Balanced binary tree
2.7: Segment Tree
2.7.1: one-dimensional line segment tree
2.7.2: Two-dimensional line segment tree
2.8: Tree-like array
2.8.1: One-dimensional tree-like array
2.8.2:n-dimensional Tree array
2.9: The Dictionary tree
2.10: Suffix array
2.11: Block List

3: Figure 3.1: Figure

3.1.1.: Breadth-First traversal
3.1.2.: Depth-First traversal
3.1.3.: Sort by topology
3.1.4.: Cutting edges and cutting points
3.1.5.: Strongly connected components
3.1.5:2-sat problems
3.1.6.: Euler circuit
3.1.7.: Hamiltonian circuit

3.2.: Minimum Spanning Tree

3.2.1.:prim algorithm
3.2.2.:kruskal algorithm
3.2.3.:sollin algorithm
3.2.4.: Sub-niche into a tree
3.2.5.: section K small Spanning tree
3.2.6.: Optimal scale Spanning tree
3.2.7.: Minimum tree diagram
3.2.8.: Minimum limit Spanning tree
3.2.9.: Euclidean minimum spanning tree for planar points
3.2.10.: Minimum spanning Tree of Manhattan in a flat point
3.2.11.: Minimum balance Spanning tree

3.3.: Shortest Path

3.3.1.: Topological ordering of the shortest path-to-loop graphs
3.3.2.: The shortest path->dijkstra algorithm for weighted graphs with nonnegative weights
3.3.3.: The shortest path->bellmanford algorithm with weighted graphs with negative weights
3.3.4.: The shortest path->SPFA algorithm with weighted graphs with negative weights
3.3.5.: Full source Shortest path Freud algorithm Floyd
3.3.6.: Full source Shortest Path Johnson algorithm
3.3.7.: Secondary Short path
3.3.8.: section K short Path
3.3.9.: Differential Constraint system
3.3.10.: Shortest path to a planar point pair (optimized)
3.3.11.: Double standard Limit Shortest path

3.4.: Maximum Flow

3.4.1.: Augmented path->ford-fulkerson algorithm
3.4.2.: Pre-push flow
3.4.3.:dinic algorithm
3.4.4.: Maximum flow with upper and lower bounds
3.4.5.: Network flow with restricted nodes
3.4.6.: The least-cut->stoer-wagner algorithm for graphs with no direction
3.4.7.: The edges of the graph and the non-intersection path
3.4.8.:ford-fulkerson superposition algorithm
3.4.9.: Minimum cost with negative cost maximum flow

3.5.: Match

3.5.1.:hungary algorithm
3.5.2.: Minimum Point Overlay
3.5.3.: Minimum Path overlay
3.5.4.: Maximum independent set problem
3.5.5.: Kuhn-munkras algorithm for optimal complete matching of binary graphs
3.5.6.: Maximum cardinality matching for general graphs
3.5.7.: Weighted matching problem for general graphs

5: Calculation geometry: 5.1 Basic formula

5.1.1: Fork Multiply
5.1.2: Point multiplication
5.1.3: Area, Perimeter, volume formula for common shapes

5.2: Line Segment

5.2.1: Determine if two segments (line, segment) intersect
5.2.2: Finding the intersection of two segments

5.3: Polygon

5.3.1: Determine convex polygons, vertices are given clockwise or counterclockwise, (not) allow adjacent edges to collinear
5.3.2: Points are in convex polygons or polygon edges, vertices are given clockwise or counterclockwise
5.3.3: Points are within a convex polygon, vertices are given clockwise or counterclockwise, and return 0 on the polygon edge
5.3.4: The point is within the freeform and the vertices are given clockwise or counterclockwise
5.3.5: The line segment is within the freeform, the vertex is given clockwise or counterclockwise, and the boundary intersects with the 1
5.3.6: Polygon Center of gravity
5.3.7: Polygon cutting (half-plane intersection)

5.4: Triangle

5.4.1: Inner
5.4.2: Circumcenter
5.4.3: Center of gravity
5.4.4: Vertical Heart
5.4.5: Pony Point

5.5: Round

5.5.1: Lines and circles intersect, including tangency
5.5.2: Intersection of segments and circles, including endpoints and tangency
5.5.3: Sentences and circles intersect, including tangency
5.5.4: Calculates the nearest point P on a circle, such as P and center, and returns p itself
5.5.5: Calculates the intersection of a line and a circle, guaranteeing the intersection of a line and a circle
5.5.6: Calculates the intersection of a segment and a circle using this function to determine whether a point is on a line segment
5.5.7: Calculates the intersection of a circle and a circle, ensuring that the circle has an intersection with the circle and the center is not coincident
5.5.8: Calculates the inner and outer Gongsche of two circles
5.5.9: Calculating the tangent point of a segment to a circle

5.6: The classic question

5.6.1: Flat Convex bag
5.6.2: three-dimensional convex bag
5.6.3:delaunay Split/voronoi diagram

Main content of ACM