3 The Bellman-Ford Algorithm
Shortest-paths algorithms typically exploit the property that a shortest path between two vertices contains other shortest paths within it. This optimal substructure property admits both dynamic programming and the greedy method. We have shown that Dijkstra’s algorithm might fail in