I am working in network coding. I have a problem determining the maximum flow for network directed acyclic graphs having multiple sources or sinks. Can anyone give an example of how to use max-flow-min-cut on a network with multiple sources and sinks and compute the maximum flow?
Examples of the kinds of networks I'm thinking of:
