Bellman Ford Algorithm - Single Source Shortest Path

  Explanation Video

Relax values of edges V-1 times.


This algorithm won't work if there is -ve weight edge and form a circle. To verify if there is a circle we can run algorithm 1 additional time and see if weight is getting relaxed for any edge.

Greeksforgreeks 

Comments

Popular posts from this blog

SQL basic interview question

gsutil Vs Storage Transfer Service Vs Transfer Appliance