Common graph theory algorithms in ACM 1. topological sorting-& gt; & #160; & #160; Principle and implementation of topological sorting 2. shortest path algorithm-& gt; & #160; shortest path algorithm summary differential constrained system-& gt; & #160; differential constrained first k short circuit-& gt; & #160; first K short path problem 3. min spanning tree problem extension-& gt; & #160; Max? Small? Born? Cheng? Tree? Question? Question? Of
Common graph theory algorithms in ACM
1. Topological sorting-> principle and implementation of topological sorting
2. shortest path algorithm-> shortest path algorithm summary differential constrained system-> differential constrained first k short circuit-> first K short path problem
3. minimal spanning tree problem extension-> most? Small? Born? Cheng? Tree? Question? Question? ? ? Show the optimal rate spanning tree-> optimal rate spanning tree
Minimum k-degree limit spanning tree-> IOI2004 national training team paper, written by Wang Ting (in the online storage) or Liu Rujia's Black Book contains a raw question poj1639
4. bipartite graph matching-> bipartite graph maximum matching, perfect matching and Hungary algorithm bipartite graph maximum matching summary bipartite graph perfect matching km algorithm
5. network stream-> minimum fee for network stream learning maximum traffic introduction network stream question set
6. cut points, bridges, strongly connected components, dual-connected components-> cut points, bridges, strongly connected components, and dual-connected components of graphs
-SAT questions-> 2-SAT Summary
8. minimum tree structure-> minimum tree structure (Zhu-Liu algorithm)
9. Analysis of strongly connected components and point-down tarjan algorithm
Some OI papers Baidu network disk sharing address