摘要：
一 数学(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-Netwo 阅读全文
posted @ 2013-03-29 21:04
algorithms爱好者
阅读(169)
评论(0)
推荐(0)
浙公网安备 33010602011771号