Lecture 16: Greedy Algorithms, Minimum Spanning Trees
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009, recorded: November 2005, views: 14812
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
"OK, today we're going to start talking about a particular class of algorithms called greedy algorithms. But we're going to do it in the context of graphs. So, I want to review a little bit about graphs, which mostly you can find in the textbook in appendix B. And so, if you haven't reviewed in appendix B recently, please sit down and review appendix B. It will pay off especially during our take-home quiz. So, just reminder, a digraph, what's a digraph? What's that short for? Directed graph, OK? Directed graph, G equals (V,E), OK, has a set, V, of vertices...
Download slides: mit6046jf05_leiserson_lec16_01.pdf (404.7 KB)
Download mit6046jf05_leiserson_lec16_01.m4v (Video - generic video source 172.6 MB)
Download mit6046jf05_leiserson_lec16_01.rm (Video - generic video source 134.6 MB)
Download mit6046jf05_leiserson_lec16_01.flv (Video 238.1 MB)
Download mit6046jf05_leiserson_lec16_01.wmv (Video 738.4 MB)
Download mit6046jf05_leiserson_lec16_01.mp3 (Audio lecture 19.4 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !