“An algorithm is a rythem with in . ” -softwarebug

Bellman ford’s Algorithm is a single source shortest pathfinding algorithm, which means it helps us find the shortest distance from a single source or source vertice to other vertices in a weighted graph.

The algorithm was first proposed by Alfonso Shimbel (1955) yet is instead named after Richard Bellman and Lester Ford Jr., who published it in 1958 and 1956, respectively

The question comes why can't we use the Dijkstra algorithm, well in a negatively weighted graph there is no guarantee whether the answer arrived from Dijkstra is correct it…


Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store