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

You're viewing a comment by Peteris Krumins and its responses.

December 14, 2009, 20:34

Sapping, thanks for spotting the error. Indeed, it's Cij(k-1), Cik(k-1) + Ckj(k-1). It's easy to remember because Cik Ckj is how you multiply matrices. (the lecture then proceeds to solving transitive closure via strassen's matrix multiplication analogy).

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.