Bellman-Ford algorithm clearly explained in 10 minutes
A clear explanation of Bellman-Ford single source shortest path algorithm with example and C++ implementation. Three implementations are provided:
1. Recursive
2. Dynamic programming using a two dimensional table
3. Dynamic programming using a one dimensional table
An article on the summary of most famous shortest path shortest algorithms and their implenetation:
/ shortest-and-longest-path-algorithms-job
interview-cheatsheet-2adc8e18869
You can download the C++ implementation of various algorithms from my GitHub:
https://github.com/ourarash/cpp_tour
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers.