Max-Flow Min-cut: Help needed to understand "Image Segmentation Problem"
Difference between en1 and en2, changed 28 character(s)
I was trying to solve [this problem](http://www.lightoj.com/volume_showproblem.php?problem=1361) and found [this](https://en.wikipedia.org/wiki/Max-flow_min-cut_theorem#Application) in wiki. I am referring to the fourth application here, "Image Segmentation Problem". I think I need to understand this to solve the above problem. But the wiki article only says what to do to solve image segmentation problem. But it doesn't explain the logic or idea behind it. Can anyone help me to understand it ? ↵
This is what is written in Wikipedia:↵
↵
![ ](http://i.imgur.com/MWrsTBn.png)

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English Tanzir5 2016-09-16 16:37:30 27
en3 English Tanzir5 2016-09-16 16:35:36 4 Tiny change: 'nd it ? \nThis is ' -
en2 English Tanzir5 2016-09-16 16:33:07 28
en1 English Tanzir5 2016-09-16 16:32:47 622 Initial revision (published)