Tag: Graph Theory

Dijkstra breaks on negative edges. Bellman-Ford runs O(VE). Pick wrong and debug for hours—here's the 30-second decision tree.

Read more →