11. Dynamic Programming: All-Pairs Shortest Paths

wouldn't the most optimal for an unweighted graph be A*?

I got pretty lost in my parallel algorithms class at university, where we had floyds and johnsons algorithm explained very shortly and in a confusing way. This video however is an amazing explanation which I understood the first time going through it. Thank you very much for sharing!

Now that EndSems are at door ,I feel so regretful for attending DAA lectures at college ,I should have learnt everything from here in more depth , accuracy and easier way , Sadlife

magic moment at the end.

The camera taking the floor level shots has a nice quality to it.

SO wtf do you do when you have negative weight cycles

Love this!

He is a genius and also looks like a genius

Does anyone know in which lesson does MIT professors lecture on Fibonacci Heap?
Plz and thanks a lotttttttttttt

Why am I paying for college when I all do is watch this guy for my algo class

Very well explained

HUST

Incomprehensible, especially towards the end.

Even if it's not optimal, that matrix multiplication algorithm is beautiful.

explanation is not helpful ,need more visuals to explain floyd warshall. :/

wish they had edx versions of these courses

OMG, the definition of this video is damn good

Give him a Nobel prize already!!

DMANN my OCD on his sleeve is not letting me to focus

I like this guy