Posted by: atri | November 5, 2012

Lect 27: Correctness of Kruskal and Prim’s Algorithms

In today’s lecture we stated the cut property lemma and then used it to prove the correctness of both Kruskal’s and Prim’s algorithms. Next lecture, we will prove the cut property lemma. All the material is from Section 4.5 in the book.

The slides and notes have been uploaded.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: