Floyd Warshall Algorithm on Undirected Graph - Dynamic Programming Example

[@zaichuangcui5508]

Thanks for the tutorial. Really helps with my exam. And this is much better than our lectures. Much appreciated!

[@bablobko]

Yes please roll out a full fledged course of Algorithms.

[@bablobko]

Tremendous James. Keep going. You must roll out your own Algorithms course.

[@joejamesusa]

I have a Python Data Structures course on Udemy. I need to make a separate course on Algorithms.

[@bablobko]

@@joejamesusa Believe me Sir, with the kind of approach you expound the ideas of Algorithms, your course, will be a great boon for generations. Thanks once again.

[@a-mohamedabbassa27]

but how to find the short path ?

[@akpokemon]

Uggh this could have been my saving grace, except you don't even ONCE go over the ones that don't change! On the first two iterations (at least the first), you should have gone through every square. Now I'm still confused as to exactly what to check each time. It would just take 30 more seconds to make it comprehensive enough to be totally understandable. :( Good otherwise though

[@akpokemon]

nvm i remembered the easier way i was taught where you don't have to think of formulas and junk

[@joejamesusa]

+akpokemon good point. I do have another Floyd Warshall's video you could watch on KZbin where I think I did cover that.

[@akpokemon]

Joe James Thanks for the kind reply. I looked up your directed graph version. I'm working with Undirected. I think I did alright on my test today, so thanks

[@ShubhamKumar-dk9tb]

in d1 why isnt db, dc are evaluated minimum

[@nou4696]

Because they aren't connected