Lec 16 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
27,117
Loading...
Alert icon
Sign in or sign up now!
Alert icon
There is no Interactive Transcript.

Uploaded by on Jan 7, 2009

Lecture 16: Greedy Algorithms, Minimum Spanning Trees

View the complete course at: http://ocw.mit.edu/6-046JF05

License: Creative Commons BY-NC-SA

More information at http://ocw.mit.edu/terms

More courses at http://ocw.mit.edu

Category:

Education

License:

Standard YouTube License

  • likes, 1 dislikes

Link to this comment:

Share to:
see all

All Comments (13)

Sign In or Sign Up now to post a comment!
  • I didn't get how MST has overlapping subproblems , can somebody explain it to me

  • soso bin so einsam

  • Oh yea! How long y'all been dating ? Lol

  • Oh I love Minimum Spanning trees.

  • Minimum Spanning Tree @ 23:39

  • T-Rex @ 28:31

  • @PurpyPupple What's your point here??? I mean why should someone do such a conversion between dense and sparse graphs ????

  • Life is predictable.... :D I love this man... !!!

  • At 34:10 professor said "Its the same as I got". He should comment after that that he jointly with students proved just before existence of only one MST for this small graph.

  • @PurpyPupple if you're referring to an unweighted graph sure, why not? :)

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more