Glossary: Algorithms Beyond the Basics in Rust
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.
Glossary: Algorithms Beyond the Basics in Rust
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.