ACM Algorithm Catalog

Data
Stacks, queues, linked lists
? hashtable, hash array
Heap, Priority queue
Dual-ended queues
Can and Heap
Left bias Heap
? binary search Tree
Treap
Stretching tree
? and check Set
Collection Count Issues
The recognition of the dichotomy graph
? Balanced binary Tree
? binary sort Tree
? Line tree
One-dimensional line segment tree
Two-dimensional line segment tree
? tree-like array
One-dimensional tree-like array
n-dimensional tree-like array
? Dictionary Tree
? suffix array, suffix tree
? Block List
? Huffman Tree
Barrels, jumping tables
? Trie tree (static achievements, dynamic achievements)
? AC Automatic Machine
? LCA and RMQ Issues
? KMP algorithm

*************************************************************************************************************** ******
*************************************************************************************************************** ******
*************************************************************************************************************** ******
Graph theory
Basic Diagram Algorithm diagram
Breadth-First traversal
Depth-First traversal
Topological sorting
Cut the edges and cut.
Strongly connected components
Tarjan algorithm
Dual Connected components
Strongly connected branches and their shrinking points
Cutting edges and cutting points of graphs
Minimum cut model, network flow protocol
2-sat problems
Euler circuit
Hamiltonian circuit
? minimum spanning Tree
Prim algorithm
Kruskal algorithm (sparse graph)
Sollin algorithm
Sub-niche into a tree
Section K Small Spanning tree
Optimal scale spanning tree
Minimum tree diagram
Minimum limit Spanning tree
Euclidean minimum spanning tree of planar points
Minimum spanning tree of Manhattan in a flat point
Minimum balance Spanning tree
? Shortest path
Topological ordering of shortest path with direction-free graphs
The shortest path->dijkstra algorithm for weighted graphs with nonnegative weights (can be optimized with two fork heap)
The shortest path->bellmanford algorithm for weighted graphs with negative weights
The shortest path->SPFA algorithm for weighted graphs with negative weights
(The efficiency of SPFA is not as high as that of bellman-ford in the dense and negative weight graph)
Full source Shortest path Freud algorithm Floyd
Full source Shortest Path Johnson algorithm
Second short path
Section K Short Path
Differential constraint system
Shortest path (optimization) of a planar point pair
Double standard Limit Shortest path
? Maximum Flow
Augmented path->ford-fulkerson algorithm
Pre-push flow
Dinic algorithm
Maximum flow with upper and lower bounds
Network flow with restricted nodes
A minimum cut->stoer-wagner algorithm for non-direction graphs
The edges of the graphs and the non-direction graphs are not intersection paths
Ford-fulkerson superposition algorithm
Minimum cost maximum flow with negative charges
? match
Hungary algorithm
Minimum point Overlay
Minimum path Overlay
Maximum independent set problem
An optimal complete matching kuhn-munkras algorithm for two-fractal graphs
No weighted binary matching: Hungarian algorithm
Weighted binary matching: km algorithm
Maximum cardinality matching for general graphs
The weighted matching problem of general graphs
? Topology ordering
? Chord Chart
? Stable marital problems
*************************************************************************************************************** ******
*************************************************************************************************************** ******
*************************************************************************************************************** ******
Search
State optimization of wide search
Storing state with M-binary number
Convert to string hash table weight
Press bit to compress storage state
Bi-directional wide search
A * algorithm
? Deep Search Optimization
Bit arithmetic
Pruning
function parameters as few as possible
The number of layers is not too large
Two-way search or a rotation search
ida* algorithm
? Memory Search
*************************************************************************************************************** ******
*************************************************************************************************************** ******
*************************************************************************************************************** ******
Dynamic planning
The theory of quadrilateral inequalities
? Incomplete status record
Frog Crossing the river problem
Using Interval DP
? knapsack problem
0-1 Backpack, Classic questions
Infinity Backpack, Classic question
The question of the judgement knapsack
Knapsack problem with affiliated relationship
+-1 knapsack problem
Double Backpack for optimal value
Structure Triangle problem
Knapsack problem with upper bound limit (012 backpack)
? linear dynamic Programming problem
Bricks Game Problem
Duel (Judgment question)
The maximum polygon problem for a circle
Counting the number of words
Checkerboard Segmentation
Scheduling issues
The minimum approximation problem (finding the ratio of two numbers closest to a certain number/two number equals a certain number, etc.)
Block Elimination game (a range can be eliminated continuously for maximum benefit)
Resource allocation issues
Digital triangle problem
Nice print.
Post Office questions and structuring answers
Top Bricks problem
Two consecutive and maximum
2 Powers and problems
n the maximum number of M segments and
Cross Maximum number problem
The DP (such as division of judgment, determination of accessibility, etc.) of the determinant problem
DP for modulo k problem
Special modulo k problem, the number of maximum (minimum) modulus k is obtained.
Transform number problem
Dynamic Programming for monotonic optimization
1-sum problems
2-sum problems
Sequence partitioning problem (monotonic queue optimization)
Split problem (polygon split/stone merge/Circle split/Product max)
Triangulation problem of convex polygon
The biggest problem of product
Polygon Game (operator on polygon Edge, vertex right value)
Stone Merging (N^3/n^2/nlogn various optimizations)
? greedy dynamic Planning
Optimal loading problem
Partial knapsack problem
Boat problems
Greedy strategy
Johnson algorithm for two-machine scheduling problem
? State DP
Cowboy Shooting problem (game class)
State DP of the Hamiltonian path
Balance problem of two-pivot balance
The nearest two-part diagram of a forward graph
? tree-Type DP
Perfect server problem (3 states per node)
Little fat, keep the palace.
Network charge issue
Roaming problems in Trees
The game on the tree
The maximum independent set problem of a tree
The maximum equilibrium value problem of a tree
The minimum ring of the construction tree
*************************************************************************************************************** ******
*************************************************************************************************************** ******
*************************************************************************************************************** ******
Arithmetical
Chinese remainder theorem
? Euler functions
? Euclidean theorem
? Euclid's GCD (Greatest common divisor)
? Expand Euclid
The decomposition of large numbers and the determination of prime numbers
? Pell equation
The congruence theorem (large numbers for redundancy)
? Prime number Test
10 million or less: Screening method
10 million Outside: Miller test method
? Continuous fractional approximation
? factoring
? cyclic group Generation meta
The problem of prime number and division of integers
? binary bits.
? Same Comodule operation
*************************************************************************************************************** ******
Combinatorial mathematics
Permutation combinations
The principle of tolerance and repulsion
? recursive relationships and generating functions
? Polya counting method
Polya counting formula
Burnside theorem
? N Queen Tectonic solution
The construction of Magic Square
? The construction of Hamilton Circle satisfying certain conditions
? Number of Catalan
? Number of Stirling
? Fibonacci number
? Harmonic number
? even fractions
? Mobius Inversion
? The theory of partial order relation
? addition principle and multiplication principle
*************************************************************************************************************** ******
*************************************************************************************************************** ******
*************************************************************************************************************** ******
Mathematical
*************************************************************************************************************** ******
Calculate geometry
? Basic formula
Fork Multiply
Point multiplication
Area, perimeter, volume formula for common shapes
discretization of coordinates
? line segments
Determine if two segments (line, segment) intersect
Finding the intersection of two segments
? polygon
Determine convex polygons, vertices are given clockwise or counterclockwise, (not) allow adjacent edges to collinear
Points are in convex polygons or polygon edges, vertices are given clockwise or counterclockwise
Points are within a convex polygon, vertices are given clockwise or counterclockwise, and return 0 on the polygon edge
Points are within a freeform polygon, and vertices are given clockwise or counterclockwise
The line segment is within the freeform, the vertex is given clockwise or counterclockwise, and the boundary intersects with the border returns 1
Polygon Center of gravity
Polygon cutting (half-plane intersection)
Scan line algorithm
The core of the polygon
? triangles
Heart
Circumcenter
Focus
Vertical Heart
Fermat Point
? round
Intersection of lines and circles, including tangency
Intersection of segments and circles, including endpoints and tangency
Intersecting circles, including tangency
Calculates the nearest point on a circle, such as P coincident with the center, and returns p itself
Calculates the intersection of a line and a circle, guaranteeing the intersection of a line and a circle
Calculates the intersection of a segment and a circle using this function to determine whether a point is on a line segment
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
Calculate the inner and outer Gongsche of two circles
To calculate the tangent point of a segment to a circle
Point Set minimum Circle overlay
The creation of visual graphs
? to the heel point
? Classic Questions
Flat Convex bag
Three-dimensional convex bag
Delaunay split/voronoi diagram
*************************************************************************************************************** ******
Calculation method
Two-part method
The dichotomy method for solving the related knowledge of monotone function
Calculation using matrix acceleration
? Iterative method
? Three-Part method
Solve a linear equation group
Lup decomposition
Gaussian elimination element
The solution of a linear equation set
Calculation of Definite integral
? polynomial root-finding
? periodic equations
? Linear programming
? Fast Fourier Transform
? Random algorithm
? 0/1 Fractional Planning
Three-part method for solving the extremum of single-peak (valley)
? Iterative approximation
? Matrix method
*************************************************************************************************************** ******
Game theory
Maximum minimum process
? Nim question
*************************************************************************************************************** ******
*************************************************************************************************************** ******
*************************************************************************************************************** ******

ACM Algorithm Catalog