fa26-cs577 cs577
Lecture 10: Dijkstra’s Algorithm Lecture 10: Dijkstra’s Algorithm
Content locked
The catalog is public. Reading this content requires approved access.
Sign in to readLecture 10: Dijkstra’s Algorithm
Goal and assumptions
Intuition: subdividing weighted edges
Priority queue operations
Algorithm
Slide example
Correctness: removal finalizes a distance
Running time
Choosing an SSSP algorithm
Next: all-pairs shortest paths