Lecture 22

Learning objectives

After this class, you should be able to:

1. Given a source and a weighted directed graph without negative-weight edges, show how Dijkstra's algorithm will find the shortest path to all other vertices.
2. Prove the correctness of Dijkstra's algorithm and analyze its time complexity.
3. Given other possible algorithms for the single source shortest path problem, prove or disprove their correctness and analyze their time complexity.

Reading assignment

1. CLR: Chapter 24, introduction and section 24.3.

Exercises and review questions

• Questions on current lecture's material
  1. Exercise 24.3-1.
  2. Exercise 24.3-2.
  3. Exercise 24.3-3.

• Questions on next lecture's material
  1. None.