Bellman-Ford & Negative Edges

Dijkstra trusts that a popped distance is final, but a negative edge can later make a path cheaper. So it breaks.

Bellman-Ford handles negative edge weights. It is slower than Dijkstra but robust where greedy logic cannot be trusted.