Shortest paths
Kent Quanrud · 75:34
This lecture develops shortest-path algorithms from first principles: BFS on unweighted graphs, a correctness-preserving reduction from integer weights to BFS that is too slow, Dijkstra as the same layering logic with...