Glossary: Algorithms Beyond the Basics in Go

Bellman-Ford

Also written: Bellman Ford

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