Negative edge lengths and all pairs shortest paths (Fundamental Algorithms, Spring 2022, Lecture 9)
Kent Quanrud · 57:54
Kent’s lecture shows how to compute single-source and all-pairs shortest paths when directed edges may have negative lengths: finite distances are always attained by simple paths, Bellman–Ford recovers them (and flags...