Posted by: atri | November 5, 2010

Lect 28: Correctness of Kruskal’s algorithm

In today’s lecture, we proved the correctness of the Kruskal’s algorithm.The slides have been uploaded.

Next lecture, we will quickly prove the correctness of Prim’s algorithm and then move on to the proof of the correctness of the “cut property” lemma. This material will still be from Sec 4.5 in the book.

Below are links to the student blog posts for the 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: