Alternative Name: Bellman-Ford-Moore
Similar to Dijkstra’s algorithm, the Bellman-Ford algorithm computes the shortest path from a single source vertex to all of the other vertices in a weighted digraph. It is computationally slower than Dijkstra’s algorithm, but is more versatile in that it can handle negative edge weight values. The name of the algorithm comes from two of its developers, Richard Bellman and Lester Ford, Jr., who had originally published it in 1958 and 1956, respectively.
|Algorithm||Data Structure||Time Complexity - Average||Time Complexity - Worst||Space Complexity - Worst|
|Bellman-Ford||Graph of |V| vertices and |E| edges||O(|V||E|)||O(|V||E|)||O(|V|)|