对ACM竞赛的算法大概分了一下类,分成了数学、数据结构和算法三大块。一数学(Mathematics)1离散数学(DiscreteMathematics)1.1图论(GraphTheory)图的遍历(GraphTraversal):DFS,BFS最小生成树(MinimumSpanningTree):Prim,Kruskal最短路径(ShortestPath):Dijkstra,Floyd传递闭包(TransitiveClosure)关节点(ArticulationPoint-UndiGraph)拓扑排序(TopologicalSo