Shortest Path with limit on #steps

When to use Bellman-Ford algorithm? If a negative weighted rings are allowed in a graph, then Dijkstra's algorithm is not applicable to solve SSSP problem, consider to use Bellman-Ford! Basic idea: Simply loop |V| times, for each time, traverse throu...