Shortest paths (Fundamental algorithms, Spring 2023, Lecture 7)
Kent Quanrud · 78:56
This lecture builds shortest-path algorithms from first principles: BFS computes unweighted distances from \(s\) in linear time by growing layers, and Dijkstra is the same idea for positive weights—implicitly skipping...