Actually the formal thing would be to sum the capacities of the edges that "get out" from one of the sets to the other, taking into account the direction of the edges.
Excellent explanation. If an edge is in down to up direction, and the minimum cut line is crossing it from the left side, then it will be counted, otherwise, not. If an edge is in up to down direction, and the minimum cut line is crossing it from right, then it will be counted, otherwise not. If an edge is in horizontal direction, from left to right, and the minimum cut line is cross it from top to down it will be counted, otherwise not
But why isn't 5 the minimum cut? the cut can go trough 3->2 and the opposite of 5 which sums at 5 . A cut must divide the graph into 2 groups where the sink and the source must be in different groups?
If you refer to the graph at 5:55, yes, the minimum cut is 5, and yes, a cut must divide the graph into 2 sets where the sink and the source must be in different groups.
Great explanation! You did in 7 minutes what I couldn't figure out in a quarter of a semester. Thanks for the simple application.
Watched this video just before exam. And guess what? There was one question on Min Cut Theorem. You saved my 3 marks. :)
u saved my life ! after hours of searching for a good explanation ! Thank you.
I think the region above the network and below the network would be left side of the source and right side of the sink respectively. 1:17
How the red line is coming from below ? 2:48
Actually the formal thing would be to sum the capacities of the edges that "get out" from one of the sets to the other, taking into account the direction of the edges.
So we find 5 6:08, then what? what does it mean?
best explanation ever made in min cut
Great job !! keep up the work dude.
Awesome video
Next level boss! great job ;)
Best video about min cut! Great!
Great video
Great explain,thanks a lot.
Thanks a lot, other videos didn't explain it as good as you did.
Stephano you devious Denis what are you doing
You've done a good job explaining this. Thank you.
Awesome video, thanks a lot!
Thank you so much!
What a stunning explanation!That was great!Thank you so much!
Excellent explanation.
If an edge is in down to up direction, and the minimum cut line is crossing it from the left side, then it will be counted, otherwise, not.
If an edge is in up to down direction, and the minimum cut line is crossing it from right, then it will be counted, otherwise not.
If an edge is in horizontal direction, from left to right, and the minimum cut line is cross it from top to down it will be counted, otherwise not
But why isn't 5 the minimum cut?
the cut can go trough 3->2 and the opposite of 5 which sums at 5 .
A cut must divide the graph into 2 groups where the sink and the source must be in different groups?
If you refer to the graph at 5:55, yes, the minimum cut is 5, and yes, a cut must divide the graph into 2 sets where the sink and the source must be in different groups.
Thank you for a great explanation.
how do you know you are at the min cut? how can you know on a big graph you are sure this is the min cut?
Trial and error
Great explanation. thank you
I like the part that explains what to count
Great explanation!
Love it, this is awesome
Nice Video!
thank u so much..sir!
Finally understood thank you 😊
good explanation
thankyou !!
The example you use at 5:04 does not represent a flow network
it's a directed graph where every edge has a capacity, how is it not a flow network?
There is no flow. A has an input of 8 and an output of 2.
thats the capacity not the flow!
Thanks so much
thank u sir
min cut = 1020 i guess.
😒
This is wrong