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

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

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

I literally do assignments in class and learn from your RU-vid channel. Best DSA RU-vid channel

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

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

Fantastic, exactly what every other video or lecture was missing

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.

Just brilliant, really helpful. keep it up.

You're the best William

Good video Will! Thanks

very helpful!

thank you a lot

great video my g!!!!

This guy's doing god's work

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

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?

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

Why it is bad on weighted graph? What is the reason behide this sir?

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)?

This is nuts

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

oh baby

Hi William, what are some applications of this algorithm?

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

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?

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

I love you. No homo.

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.

I don't understand anything

Extremely poor explanation

why he sounds like bill gates,,,