max-flow

I've tried to solve a question about the maximum-flow problem . I have one source and two sinks. I need to find a maximum flow in this network. This part is general max-flow. However, both targets have to get same amount of flow in this special version of the max-flow problem. Is there anyone who can help me what should I do to do that? Let s be your source vertex and t1 and t2 the two sinks. You can use the following algorithm: Use regular max-flow with two sinks, for example by connecting t1 and t2 to a super-sink via edges with infinite capacities. You now have the solution with maximum

I have to do a foreground/background segmentation using maxflow algorithm in C++. ( http://wiki.icub.org/iCub/contrib/dox/html/poeticon_2src_2objSeg_2src_2maxflow-v3_802_2maxflow_8cpp_source.html ). I get an array of pixels from a png file according to their RBG but what are the next steps. How could I use this algorithm for my problem? I recognize that source very well. That's the Boykov-Kolmogorov Graph Cuts library. What I would recommend you do first is read their paper . Graph Cuts is an interactive image segmentation algorithm. You mark pixels in your image on what you believe belong to

I need to find the minimum cut on a graph. I've been reading about flow networks, but all I can find are maximum flow algorithms such as Ford-Fulkerson, push-relabel, etc. Given the max flow-min cut theorem, is it possible to use one of those algorithms to find the minimum cut on a graph using a maximum flow algorithm? How? The best information I have found so far is that if I find "saturated" edges i.e. edges where flow equals capacity, those edges correspond to the minimum cut. Is that true? It doesn't sound 100% right to me. It is true that all edges on the minimum cut will be saturated,