Negative edge lengths and all pairs shortest paths (Fundamental Algorithms, Spring 2022, Lecture 9)
About this video
Editorial reviewFull-course playlist 'Fundamental Algorithms, Spring 2022' from a curated course list (Purdue CS 381 Fundamental Algorithms, by Kent Quanrud (Spring 2022)); uploader is instructor; playlist judged: Full-length university lecture series on algorithms taught by the instructor himself, with substantive 55-76 minute lectures and accompanying notes.; title passed a strict title check; oEmbed verified.
Video by Kent Quanrud, played through YouTube's embedded player.