Algorithms and Data Structures (INF1)
Lecture 14
Main topic: Shortest paths.
Lecture Plan
- shortest paths in DAGs
- Bellman-Moore algorithm
- Dijkstra's algorithm
Reading
-
Section 12.1
of Algorithms and Data Structures: Design, Correctness and Analysis
by Jeffrey H. Kingston.