COP 4531: Lecture 26

Learning objectives

After this class, you should be able to:

1. Give the recurrence on which the the Floyd-Warshall all-pairs shortest path algorithm is based, and justify it.
2. Given a weighted graph without negative weight cycles, show how the Floyd-Warshall algorithm computes the shortest path between all pairs of vertices.
3. Use the idea behind the Floyd-Warshall algorithm to solve related problems.

Reading assignment

1. CLR: Section 25.2.
2. None. Prepare for the final exam.

Exercises and review questions

• Questions on current lecture's material
  1. Exercise 25.2-1.
  2. Exercise 25.2-6.

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