Lecture 7

Today’s topics: Minimal Spanning Trees.

• Minimal Spanning Trees, Prim’s algorithm.
• slides 20-49 of Greedy Algorithms II

Reading Guide

• Chapter 23 of CLRS3 or Chapter 21 of CLRS4.

What should I know by the end of this lecture?

• What is a minimal spanning tree?
• Why is the greedy algorithm correct?
• How does Prim’s Algorithm work?