Bellman-Ford algorithm

noun1

1. •
   An algorithm that computes single-source shortest paths in a weighted digraph, capable (unlike the faster Dijkstra's algorithm) of handling graphs with negative edge weights.