是由 Richard Bellman 和 Lester Ford 創立的，求解單源最短路徑問題的一種演算法. 常見的最短路徑問題演算法還有 Dijkstra s algorithm, 且 Dijkstra 演算法不允許路徑的 cost 是負值, 但此演算法不受此限制. 但是如果圖形中有包含 cycle, 且 cycle 上面的 cost 的合為負值, 則此演算法不適合用於此種圖形-By Richard Bellman and Lester Ford founded, single-source shortest path problem solving an algorithm. Common shortest path algorithm as well as Dijkstra s algorithm, and the algorithm does not allow cost Dijkstra path is negative, but this algorithm this restriction is not fit. but if there are graphics contained cycle, and the cycle above cost is negative, this algorithm is not suitable for such graphics.