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

You're viewing a comment by Sapping and its responses.

Sapping Permalink
December 14, 2009, 20:09

In your lecture notes for lecture 19, I think you wrote a j in the recurrence on the top of the second page instead of a k. The line is min {Cij(k-1), Cik(k-1) + Ckj(k-1)}. Other than that, thanks for posting these. It helps when you're not quite sure of what the teacher wrote on the chalkboard.

Reply to this comment

Reply To This Comment

(why do I need your e-mail?)

(Your twitter name, if you have one. (I'm @pkrumins, btw.))

Comment Help

Type first 3 letters of your name: (just to make sure you're a human)

Please preview the comment before submitting to make sure it's OK.