Lecture 38

Learning objectives

After this class, you should be able to:

1. Given a graph and a source vertex, show the steps in finding weighted shortest paths from the source to all other vertices using Dijkstra's algorithm and analyze its time complexity.
2. Give an application for the weighted shortest path problem.

Reading assignment

1. Section 9.3.2.
2. Lecture: Graphs.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Find the shortest paths between vertex s and all other vertices in figure 9.79 using Dijkstra's algorithm.
  2. Give practical applications for the weighted shortest path problem. Post your answer on the discussion board.

• Questions on next lecture's material
  1. Start preparing for the final exam. Look at the finals review and post any questions that you would like answered on the discussion board.

---

Last modified: 6 Dec 2011