Lecture 28

Learning objectives

After this class, you should be able to:

1. Given a directed graph with non-negative weights on its edges and a starting vertex, show all steps in Dijkstra's algorithm for finding the shortest path from the starting vertex to all other vertices.
2. Give the time complexity for Dijkstra's algorithm and give implementation details that will enable the algorithm to run with that time complexity.

Reading assignment

1. Chapter 8, section 8.2 -- only Dijkstra's algorithm.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Show the steps taken by Dijkstra's algorithm on the graph in figure 8.8, but using the absolute values of those weights. The starting vertex is c.
  2. If an AVL tree were used to store the set of vertices still active, and an adjacency matrix to represent the graph, then what would the time complexity of Dijkstra's algorithm be?

• Questions on next lecture's material
  1. Fill the time complexity table in the handout given today.

---

Last modified: 16 Apr 2009