Glossary: Algorithms Beyond the Basics in JavaScript

Bellman-Ford

Also written: Bellman-Ford algorithm

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