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.
@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.
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.
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
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)?
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?
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 literally do assignments in class and learn from your RUclips channel. Best DSA RUclips channel
Samee
Only video on youtube which could explain me how those 3 nested loops find the min distance.
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.
@Zyaire Benson instablaster :)
@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.
@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 !
@Zyaire Benson glad I could help xD
Two hours before an exam; you're a lifesaver!
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
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.
Fantastic, exactly what every other video or lecture was missing
I had to refresh my memory and that was a great resource, thank you!
Just brilliant, really helpful. keep it up.
You're the best William
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?
Good video Will! Thanks
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
This guy's doing god's work
great video my g!!!!
very helpful!
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
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)?
Hi William, what are some applications of this algorithm?
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 :-)
You can use this to solve all-pairs shortest-paths problem on a directed graph.
@@binma1476 also dijkstra fails when there are negative cycles.
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?
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.
think self loop at the end
thank you a lot
Why it is bad on weighted graph? What is the reason behide this sir?
It's better if you include a step-by-step example
This is nuts
I love u, why isn't your website working?
oh baby
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.
As I understand, the shortest path has been changed. Now we reach J from K, so it needs to be updated.
I love you.
No homo.
my school project was on this, guess whoes a[ss] just got saved.
I don't understand anything
why he sounds like bill gates,,,
Extremely poor explanation