Floyd Warshall All Pairs Shortest Path Algorithm | Graph Theory | Dynamic Programming

[@abhinavbajpai795]

Only video on youtube which could explain me how those 3 nested loops find the min distance.

[@zyairebenson185]

you all probably dont care at all but does anyone know a tool to log back into an instagram account..? I was stupid forgot my password. I appreciate any help you can offer me.

[@dangelodario716]

@Zyaire Benson instablaster :)

[@zyairebenson185]

@Dangelo Dario thanks for your reply. I got to the site thru google and Im in the hacking process now. Takes quite some time so I will reply here later with my results.

[@zyairebenson185]

@Dangelo Dario It did the trick and I now got access to my account again. Im so happy! Thanks so much, you saved my ass !

[@dangelodario716]

@Zyaire Benson glad I could help xD

[@TheTechnician27]

Two hours before an exam; you're a lifesaver!

[@shreyasvishwakarma8979]

I literally do assignments in class and learn from your KZbin channel. Best DSA KZbin channel

[@sarveshahuja2385]

Samee

[@BenStuu]

Awesome video! You did a great job explaining the algorithm simply. Your channel's been a great help for my Algos class. Thanks William :D

[@byronpop2]

Great video! I watched your other one on Bellman Ford and was hoping you did one on Floyd Warshall too. You did! Thanks a bunch. These videos are helping me a lot during finals week.

[@6infinity8]

I had to refresh my memory and that was a great resource, thank you!

[@princewaesen154]

Fantastic, exactly what every other video or lecture was missing

[@factsheet4930]

8:16 Shouldn't it be dp [i] [j] = m [i] [j] if k=j? or even perhaps dp [i] [k] = m [i] [k] if k=j

[@SoloLifeJourneys]

Just brilliant, really helpful. keep it up.

[@andreamengoli4656]

You're the best William

[@nemesisanims7401]

in the reconstructPath method, why do we need the last check of next[at][end]==-1? Are we not already checking it in the loop?

[@josephlu8615]

It's better if you include a step-by-step example

[@artemis818_]

Amazing video, I have a question, for detcting a nagative cycle, can't we just check the diagonal of the last dp to see if there is a negative number (instead of 0)?

[@RushOrbit]

This guy's doing god's work

[@dmxrahul]

Good video Will! Thanks

[@briannguyen5057]

very helpful!

[@ricardomartins4608]

thank you a lot

[@user-rb3jv5rr5d]

great video my g!!!!

[@karthikrangaraju9421]

Hi William, what are some applications of this algorithm?

[@binma1476]

I think Dijkstra is always better at time and space complexity, even for the all-pairs shortest path problem. But FW is much more elegant :-)

[@pontalmoc]

You can use this to solve all-pairs shortest-paths problem on a directed graph.

[@roberthoffenheim7861]

@@binma1476 also dijkstra fails when there are negative cycles.

[@officialnizam]

I love u, why isn't your website working?

[@jakartax1x-rq8kv]

for (int interm = 0; interm < v; interm++) { for (int from = 0; from < v; from++) { for (int to = 0; to < v; to++) { if (dist[from][interm] + dist[interm][to] < dist[from][to]) { dist[from][to] = dist[from][interm] + dist[interm][to]; } } I think it would be easier to understand like this. At worst using f/t for from/to. k, i, j might be a convention and tradition for teaching PHDs but it makes no sense. This way someone can immediately tell

[@lucutes2936]

This is nuts

[@FusionX9000]

Hi, William! I have a small question for the code at 15:10. Why do we check if(next[at][end]==-1) after the for loop again? Is this only relevant in the case when start==end and it's a self negative cycle?

[@WilliamFiset-videos]

To check that the end node isn't part of a negative cycle. I don't necessarily think you need start == end for that to be true tho.

[@BipinOli90]

think self loop at the end

[@YouB3anz]

oh baby

[@janandrosiuk352]

11:14 Im struggling a bit to understand whydo we assign next[i][j] = next[i][k]. In freecodecamp video (2:27:00) William said that it's because i->k is now smaller, but I don't fully get why is that the reason.

[@allexsen9533]

As I understand, the shortest path has been changed. Now we reach J from K, so it needs to be updated.

[@albertoossola1481]

I love you. No homo.

[@MHF-go9sd]

my school project was on this, guess whoes a[ss] just got saved.

[@Antinormanisto]

I don't understand anything

[@mikhailwebb8377]

Extremely poor explanation

[@meaw3409]

why he sounds like bill gates,,,