Bellman Ford Algorithm:
Bellman Ford algorithm helps us find the shortest path from a vertex to all other
vertices of a weighted graph.
It works correctly when some of the edges of the directed graph G may have negative
weight. When there are no cycles of negative weight, we can find the shortest path
between source and destination.
It is slower than Dijkstra’s Algorithm but more versatile as it is capable of handling
some of the negative weight edges.
Based on the ‘Principle of Relaxation’ in which more accurate values gradually
recovered an approximation to the proper distance by until eventually reaching the
optimal solution.
Flowchart:
