Lecture 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009, recorded: November 2005, views: 19450
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.
"We're going to talk about shortest paths, and we're going to talk about shortest paths for three lectures. So, this is a trilogy. Today will be Shortest Paths One. I've been watching far too many versions of Star Wars this weekend. I saw the musical yesterday, matinee. That was an MIT musical. That was fun, of all three movies in about four hours. That was a bit long and then I saw the one-man show on Friday. One-man Star Wars: the original three movies in one hour. That was the opposite of too long. Both were fun. So I get my trilogy fix. All episodes, first we're going to start with The New Hope, and we're going to talk about the shortest paths problem and solve one particular problem of it, a very interesting version...
Download slides: mit6046jf05_demaine_lec17_01.pdf (450.8 KB)
Download mit6046jf05_demaine_lec17_01.m4v (Video - generic video source 174.5 MB)
Download mit6046jf05_demaine_lec17_01.rm (Video - generic video source 135.2 MB)
Download mit6046jf05_demaine_lec17_01.flv (Video 235.1 MB)
Download mit6046jf05_demaine_lec17_01.wmv (Video 746.4 MB)
Download mit6046jf05_demaine_lec17_01.mp3 (Audio lecture 19.5 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !