Lecture 21

Learning objectives

After this class, you should be able to:

1. Given a graph, show the minimum spanning trees returned by Kruskal's and Prim's algorithms.
2. Prove the correctness of the above algorithms, and derive their time complexities.
3. Write a program implementing the above algorithms.
4. Given alternate algorithms for determining the minimum spanning tree, or for similar problems, prove their correctness or disprove them.

Reading assignment

1. CLR: Chapter 23.

Exercises and review questions

• Questions on current lecture's material
  1. Exercise 23.1-1.
  2. Exercise 23.2-2.
  3. Exercise 23.2-4.

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