Glossary: Algorithms Beyond the Basics in C++

Bellman-Ford

A shortest-path algorithm that still works when some edges have negative weights, where Dijkstra's algorithm fails. It is slower than Dijkstra's algorithm, so it is used only when negative weights are possible.