Lecture 18: Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009, recorded: November 2005, views: 105319
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.
"Good morning, everyone. Glad you are all here bright and early. I'm counting the days till the TA's outnumber the students. They'll show up. We return to a familiar story. This is part two, the Empire Strikes Back. So last time, our adversary, the graph, came to us with a problem. We have a source, and we had a directed graph, and we had weights on the edges, and they were all nonnegative. And there was happiness. And we triumphed over the Empire by designing Dijkstra's algorithm, and very efficiently finding single source shortest paths, shortest path weight from s to every other vertex...
Download slides: mit6046jf05_demaine_lec18_01.pdf (286.5 KB)
Download mit6046jf05_demaine_lec18_01.m4v (Video - generic video source 159.8 MB)
Download mit6046jf05_demaine_lec18_01.rm (Video - generic video source 123.6 MB)
Download mit6046jf05_demaine_lec18_01.flv (Video 213.3 MB)
Download mit6046jf05_demaine_lec18_01.wmv (Video 681.1 MB)
Download mit6046jf05_demaine_lec18_01.mp3 (Audio lecture 17.8 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !