Bellman-ford可以一次迭代完成吗？
[英]is bellman-ford can be done in a single iteration?
问题描述
Does every graph have an order of the edges such that after running a single iteration of Bellman-Ford algorithm according to this order, every vertex is labeled with it's shortest path to the source ? 
每个图是否都具有边的顺序，以便在按照此顺序运行一次Bellman-Ford算法迭代之后，每个顶点都被标记为其到源的最短路径？
i'm quiet sure that the answer is yes, but i can't think of an Algorithm that is able to find the order of edges, thanks =] 我非常确定答案是肯定的，但是我想不出能够找到边缘顺序的算法，谢谢=]
1 个解决方案
解决方案1
1 已采纳 2014-12-01 22:42:29
对最短路径树进行拓扑排序。
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.
相关问题
Bellman-Ford算法 - Bellman-Ford Algorithm
我们能在 n 次迭代中 100% 找到 Bellman-Ford 的负循环吗？ - Can we 100% find Negative cycles in Bellman-Ford at n iteration?
为什么 Bellman-Ford 不能用于单源最长路径？ - Why can't Bellman-Ford be used for Single Source Longest Path?
贝尔曼 - 福特这样的算法，只适用于多个启动，单一目的地？ - Algorithm like Bellman-Ford, only for multiple start, single destination?
贝尔曼福特的负循环 - Negative Cycles in Bellman-Ford
在python中实现Bellman-Ford - Implementing Bellman-Ford in python
Bellman-Ford 算法轨迹 - Bellman-Ford algorithm trace
无法为 bellman-ford 算法生成正确的图 - Can't generate right graph for bellman-ford algorithm
Bellman-Ford 算法可以处理正循环吗？ - Can Bellman-Ford algorithm handle positive cycles?
我们可以将 Bellman-Ford 算法应用于无向图吗？ - Can we apply the Bellman-Ford algorithm to an Undirected Graph?
相关标签