Minimum Spanning Trees - Prim’s algorithm & Single-Source Shortest Paths - Dijkstra’s algorithm
2012-09-26 20:02
495 查看
前者用于最小生成树;后者用于单源最小路径搜索。
两者均通过维护待处理节点队列中的当前“最小”信息完成新节点的并入:
前者维护的是到部分树的最短距离;后者维护的是到源节点的最短距离。
前者用于最小生成树;后者用于单源最小路径搜索。
最小生成树算法:Kruskal,Prim
单源最小路径算法:Bellman-Ford,Dijkstra
相关文章推荐
- Prim's minimum spanning tree algorithm
- 最小生成树(Minimum-cost Spanning Trees)(Prim算法&&Kruskal算法)
- Geeks : Kruskal’s Minimum Spanning Tree Algorithm 最小生成树
- Single-source shortest path problem: SPFA vs. Dijkstra
- 【.Net码农】C#如何判断XML结点xmldocSource.SelectSingleNode("dd") 是否存在
- MST(Kruskal’s Minimum Spanning Tree Algorithm)
- Minimum Spanning Tree (MST) -- Prim's Algorithm (c++实现)
- Dijkstra's Shortest-Path Algorithm Implementation(TODO)
- [矩阵树定理 模板题] BZOJ 1016 [JSOI2008]最小生成树计数 & HDU 4408 Minimum Spanning Tree
- 最小生成树(Minimum Spanning Trees)
- Kruskal Algorithm for Minimum Spanning Tree
- Kruskal’s Minimum Spanning Tree Algorithm
- POJ-1258(Minimum Spanning Tree,Prim)
- 2011-02-26 CLRS Chapter23 Minimum Spanning Trees 最小生成树
- 2011-02-27 CLRS Chapter24 Single-Source Shortest Paths 单源点最短路径
- 2011-02-28 CLRS Chapter24 Single-Source Shortest Paths (下) 单源点最短路径 下
- Directed Minimum Spanning Tree: Chu-Liu/Edmonds Algorithm
- MST(Kruskal’s Minimum Spanning Tree Algorithm)
- Lecture 16 Minimum Spanning Trees
- Minimum Spanning Tree.prim/kruskal(并查集)