Lecture 19: Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009, recorded: November 2005, views: 7532
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.
"-- shortest paths. This is the finale. Hopefully it was worth waiting for. Remind you there's a quiz coming up soon, you should be studying for it. There's no problem set due at the same time as the quiz because you should be studying now. It's a take-home exam. It's required that you come to class on Monday. Of course, you'll all come, but everyone watching at home should also come next Monday to get the quiz. It's the required lecture. So, we need a bit of a recap in the trilogy so far. So, the last two lectures, the last two episodes, or about single source shortest paths...
Download slides: mit6046jf05_demaine_lec19_01.pdf (312.5 KB)
Download mit6046jf05_demaine_lec19_01.m4v (Video - generic video source 155.9 MB)
Download mit6046jf05_demaine_lec19_01.rm (Video - generic video source 119.9 MB)
Download mit6046jf05_demaine_lec19_01.flv (Video 209.9 MB)
Download mit6046jf05_demaine_lec19_01.wmv (Video 660.4 MB)
Download mit6046jf05_demaine_lec19_01.mp3 (Audio lecture 17.3 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !