Bellman-Ford Algorithm: Finding shortest path from a node

graph-algorithm
shortest-path
bellman-ford-algorithm

(Team) #1
Bellman-Ford Algorithm is an algorithm for single source shortest path where edges can be negative (but if there is a cycle with negative weight, then this problem will be NP).

The credit of Bellman-Ford Algorithm goes to Alfonso Shimbel, Richard Bellman, Lester Ford and Edward F. Moore.

Average case time complexity: Θ(VE)

Space complexity: Θ(V)
This is a companion discussion topic for the original entry at http://iq.opengenus.org/bellman-ford-algorithm/