Group theory of generating functions by combining recursive and recursive Mobius inversion of combinatorial mathematical arrangements
Dynamic Integer of Mathematical Linear Programming
On Vector Determinant and Matrix Calculus in Higher Mathematics
probability statistics
Elementary number theory, prime number theory, congruence and modular linear equations
computing geometry
Data structure storage structure linear table
Static: Array Stack Queue Universal Table String
Dynamic: pointer linked list dynamic array
tree
(secondary structure) represents (static and dynamic) binary tree forest
draw
(Three-level structure) Representation (matrix, adjacency list, triple)
Hash table (hash table) with special structure and set line segment tree suffix tree Huffman tree and huffman encoding address table bitmap scrolling array chessboard diagram edge top replacement diagram dichotomy diagram (network flow)
Common methods traverse the pre-/mid-/post-order priority of the tree graph.
The reverse traversal of minimum spanning tree and minimum tree graph (from three-level structure to two-level structure) is realized by transforming topological sorting.
Clustering of compressed path tree
Compressed storage
Looking for linear direct folding Fab
Tree Binary Search Tree Balanced Binary Tree B+ Tree B- Tree Clue Binary Tree Index Table
Classification insert classification direct classification, semi-classification and bidirectional classification
Exchange sort bubble sort quick sort merge sort
heapsort
Cardinal sort chain Cardinal sort bucket sort
Code reading and writing speed, code accuracy and bit error rate
Algorithm realization
algorithm optimization
Debugging error detection test
Customary variable name annotation indentation modularity
Basic Algorithm Mathematical High Precision Calculation (Analog Calculation)
Expression Processing Parentheses Prefix/Intermediate/Suffix Expressions Expression Tree
Nested control of permutation and combination evaluation
Gaussian elimination method
Fast Fourier transform
Screening prime number table
Fraction processing
The basic operation realizes a lot of functions such as data assignment, moving Fillchar fillword move and so on.
High precision processing of real number comparison size
KMP algorithm for basic functions of string processing
graph theory
(Show Graphic Search) Path Problem
A transitive closure algorithm for the minimum point basis of the maximum strongly connected subgraph of connectivity test (edge set)
Shortest path labeling method halved shortest path Dijkstra algorithm floyd algorithm bellman-ford algorithm Warshall algorithm
Special path Euler road and loop Hamilton road and loop
The center and center of gravity of a graph
Spanning tree Kruskal algorithm
collect
(vertex set) covering set
Independent set
Dominance set
Cutting top and block
Maximum/minimum network traffic with upper and lower network traffic limits.
Network minimum cost maximum/minimum flow with upper and lower capacity limits
Maximum traffic of the largest capacity network
Supply-demand constrained feasible flow
Binary matching Hungarian algorithm
Key approach
search
(Implicit Graph Search) Depth First Search
Pruning optimization (backtracking method)
pretreatment
Memory search
Variable lower bound depth first search
Random search
Breadth first search two-way wide search * multi-way wide search
Heuristic search (an algorithm)
Branch and bound
Multi-stage decision greedy algorithm
Dynamic planning of knapsack
Chessboard dynamic programming
Zoning dynamic programming
Interval dynamic programming
Tree dynamic programming
State compression dynamic programming
Other structural methods are detailed.
copy