Catalog · Introduction to Algorithms (SMA 5503) Lecture 17 of 23 Lecture 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search ← Previous Lecture 16: Greedy Algorithms, Minimum Spanning Trees Next → Lecture 18: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints ✓ Mark complete Materials Transcript (PDF) ↗ transcript