The Bellman-Ford algorithm

最新推荐文章于 2024-07-10 23:54:17 发布

weixin_30418341

最新推荐文章于 2024-07-10 23:54:17 发布

阅读量96

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Antech/p/3663176.html

本文详细介绍了贝尔曼-福特算法，这是一种适用于带负权边的有向图的单源最短路径算法。该算法能在O(VE)的时间复杂度内运行，并能检测图中是否存在负权回路。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

This algorithm deals with the general case, where G is a directed, weight graph, and it can contains negative edge weigths, cycles and even negative-weight cycles. It runs in O(VE) time, which means O(V^3) when the graph is dense.

This algorithm detects cycles by checking "v.d > u.d + w(u, v)", this is viable because if there are no negative-weight cycles, and there is an edge which satisfies "v.d > u.d + w(u, v)", v.d would be replaced by u.d + w(u, v) which is exactly what Relax(u,v, w) does. Thus at the time of checking all edges would satisfiy "v.d <= u.d + w(u, v)". Consider the Relax(u,v,w) procedure as "If there are still space for optimizing, then optimize it."

If there are negative-weight cycles, we can consider this as there are infinite optimizing space which can never be fulled exploited. So there will always be some edge whose shortest distance can still be optimized after the "enough" Relax process.

转载于:https://www.cnblogs.com/Antech/p/3663176.html