MIT’s Introduction to Algorithms, Lectures 17, 18 and 19: Shortest Path Algorithms

Posted by Anon84 on Tuesday January 27, 2009 @10:16AM
from the catonmat.net dept.

http://www.catonmat.net/blog/mit-introduction-to-algorithms-part-twelve/

( 4 comments | 9 points | on HN )

Re:MIT’s Introduction to Algorithms, Lectures 17, 18 and 19:... by hamidp on Tuesday January 27, 2009 @10:27AM (#452203)

I must be missing something here. Your review lists what is covered in the lecture (you can see that on the MIT website) and provides some notes (there are much better ones on the MIT website). Why not just watch the lecture or read the slides?

[ Parent | on HN ]

Re:MIT’s Introduction to Algorithms, Lectures 17, 18 and 19:... by pkrumins on Tuesday January 27, 2009 @05:23PM (#452878)

You can do that as well. I am just writing about what I have learned. I have had 100 people email me and say that they find it useful.

[ Parent | on HN ]

Re:MIT’s Introduction to Algorithms, Lectures 17, 18 and 19:... by michael_dorfman on Tuesday January 27, 2009 @12:40PM (#452435)

...and he didn't even tell people to watch out for the Star Wars jokes.

[ Parent | on HN ]

Re:MIT’s Introduction to Algorithms, Lectures 17, 18 and 19:... by hamidp on Tuesday January 27, 2009 @03:01PM (#452621)

Demaine took a stand-up comedy class once apparently and he uses it extensively.

[ Parent | on HN ]