Lec 18 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005

[zhaoyangster]

10:15

[Asterisko90]

God bless America..thank you from an italian Student

[sadiksha3]

nice example "I know how to spell banana, just don't know when to stop!" helpful lecture

[necrowizzard]

i really liked the part around 0:50 :), coming from lp - which i didn't know - to the graph problem

[pkercov07]

For example of Bellman-Ford algorithm skip to 10:15

[sarbasov]

21:17 A redneck student raised up his stinking leg.

Why does he proof correctness? Are there any students that do not believe him?

[TheTharinduTube]

@sarbasov come on man, science and mathematics are not such dumb subjects to believe whatever our ancestors told us... it has rational thinking and always accepted by ourselves only after a logical and sensible proof... This is not like learning religion :D :D :D have a life dude...!!!

[strade88]

Due to my horrible lecture notes that are very very math-orientated, i was looking for a providing online lecture. That one fits! Thanks a lot !

[MrVoulgarakis]

and which edges do i take for the shortest path??

[sarbasov]

@MrVoulgarakis You can create additional array BEST_SOURCE[1..|V|] and save the best source vertex for any vertex when doing "relaxation". For example, if BEST_SOURCE[3] equals to 4, then it is better to go to vertex 3 from vertex 4. But I wonder why he does not explain this simple thing to let students know.

[sabiran84]

great teacher! tnx!!

[alicektn]

I had an issue with understanding the Bellman Ford algorithm. It is clear now, thank you. Nice lecture.

[magarac2]

One of the greatest teacher ever!

[abcddcbatempmask]

I watched the first 30 minute and did not enjoy. It can be described in other creative ways.

[TheTharinduTube]

@abcddcbatempmask oh poor mate, then Algorithms are not for you.. find out your match.. ;) This is one of the best I've ever witnessed ...