Bellman Ford Algorithm, Data Structure Algorithm, Algorithms, Weighted Graph, Graph Data Structure.
have a look at the problem at hand — ‘Single source shortest path’, and how the Bellman-Ford algorithm’s approach is different from Dijkstra's algorithm. Single-Source Shortest Path Problem The Bellman-Ford algorithm The problem is that we have to find the shortest path from the source vertex to