Posted by: atri | November 4, 2010

Lect 27: Minimum Spanning Tree Problem

In today’s lecture, we studied the Minimum Spanning Tree (or MST) problem and looked at Kruskal and Prim’s greedy algorithms. The slides have been uploaded.

Next lecture, we will quickly look at the “reverse-delete” algorithm and then move on to proving the correctness of Kruskal and Prim’s algorithms. The material will be from Sec 4.5 in the book.

Here are links to the student blog posts for this lecture:


Leave a Reply

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

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

Google+ photo

You are commenting using your Google+ 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 )


Connecting to %s


%d bloggers like this: