William, thank you so much for a nice example of Ford-Fulkerson algorithm application! That was the best explanation of how to apply this algorithm that's I've ever met (even better than in Sedgewick's course). And in general, I consider your channel the best source on algorithms and data-structures on UA-cam. Please, keep doing your videos!
Now a little twist: Each mouse can run r units in any direction every second. Find the minimum time in which at least K mice will be safe ;) PD: Great video!
Is it alright if I had the mice on the right side and the holes on the left so that the flow was coming from the holes? Everything else about the problem was the same.
i think visually, he doesn't explain the connection well but he initially creates the edges that were fetched with max bipartite matching and then afterwards, reuses those edges in the network flow problem.
William, thank you so much for a nice example of Ford-Fulkerson algorithm application!
That was the best explanation of how to apply this algorithm that's I've ever met (even better than in Sedgewick's course).
And in general, I consider your channel the best source on algorithms and data-structures on UA-cam.
Please, keep doing your videos!
dude, your videos are awesome! this is far better explanation than on geeksforgeeks. its so underrated, you deserve more views btw!
Good code. Many would just say
Hole extends Mouse implements capacity
Sir, thank you for doing this. Your videos are amazing. The amount of effort you put in for a video! Absolutely amazing
Thanks for wonderfully explaining the problem and solution. Grateful for your efforts please keep it up. Great work! (y)
Now a little twist: Each mouse can run r units in any direction every second. Find the minimum time in which at least K mice will be safe ;)
PD: Great video!
thank you so much for this video truly appreciate you!
Is it alright if I had the mice on the right side and the holes on the left so that the flow was coming from the holes? Everything else about the problem was the same.
The 3blue1brown of computer science!
you should keep doing vids vary interesting
This is a flow problem, not a matching one.
i think visually, he doesn't explain the connection well but he initially creates the edges that were fetched with max bipartite matching and then afterwards, reuses those edges in the network flow problem.