100xuexi20090406132407519.docVIP

ACM算法分类 -----数学、数据结构和算法三大块。 一 数学(Mathematics) 1 离散数学(Discrete Mathematics) 1.1 图论(Graph Theory)图的遍历(Graph Traversal): DFS, BFS最小生成树(Minimum Spanning Tree): Prim, Kruskal最短路径(Shortest Path): Dijkstra, Floyd传递闭包(Transitive Closure)关节点(Articulation Point - UndiGraph)拓扑排序(Topological Sort - AOV-Network)关键路径(Critical Path - AOE-Network)回路问题: 欧拉路(Euler Path), 汉密尔顿回路(Hamilton Tour)差分约束(Difference Constraints): Bellman-Ford二部图匹配(Bipartite Matching)网络流(Network Flow) 1.2 组合数学(Combinatorics) 2 数论(Number Theory)2.1 素数: GCD, LCM...2.2 同余 3 计算几何(Computational Geometry)线段相交, 多边形面积, 内点外点的判断, 凸