Machine learningGraph Algorithms
Bellman-Ford 算法
Bellman-Ford 算法由 Richard Bellman 和 Lester R. Ford 于 20 世纪 50 年代开发，是一种用于计算带负数边权图的最短路径的基本算法。与 Dijkstra 算法不同，它能正确处理负权边，并能检测负权环的存在。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87-90. DOI: 10.1090/qam/102435 ↗
- Ford, L. R. (1956). Network Flow Theory. RAND Corporation Paper P-923. link ↗
如何引用本页
ScholarGate. (2026, June 3). Bellman-Ford Algorithm for Shortest Path. ScholarGate. https://scholargate.app/zh/operations-research/bellman-ford-algorithm
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →