Комментарии:
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
Ответить