Bellman-Ford

Also written: Bellman-Ford algorithm

A shortest-path algorithm that still works when some edges have negative weights, though it is slower than Dijkstra's algorithm.