Negative-length shortest paths and all-pairs shortest paths
Kent Quanrud · 76:14
Lecture on shortest paths with negative edge weights: Dijkstra fails, so the lecture builds Bellman-Ford (O(mn)) by adding an edge-count parameter and uses a DFS to find negative-infinity vertices. It then covers all-...