The Bellman Ford algorithm finds the shortest path from a source vertex to all other vertices in a weighted graph. It can handle graphs with negative weight edges (unlike Dijkstra's algorithm).
In this visualization, we start from vertex A as our source.
| Step | A | B | C | D |
|---|