Shortest paths
Kent Quanrud · 84:28
This lecture develops shortest-path algorithms from first principles: unweighted BFS, then Dijkstra for nonnegative weights (via “skip empty layers” and a heap), then shows how to solve extra constraints like even hop...