Decide whether you think the following statement is true or false. If it is true, give a short explanation. If it is false, give a counterexample.
Let G be an arbitrary flow network, with a source s, a sink t, and a positive integer capacity ce on every edge e. Iff is a maximum s-t flow in G, then f saturates every edge out of s with flow (i.e., for all edges e out of s, we have f (e) = ce).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.