Share
Explore BrainMass

Network flow

Hi

Consider any graph G with edge capacities, a source s, and a sink t. Suppose the maximum flow from s to t is greater than 0, so there is a path from s to t. Then there always exists an edge so that increasing the capacity on the edge increases the maximum flow from s to t.

Is Answer True or False

Thanks

Solution Preview

False.

It depends on the total flow out of the source s and ...

Solution Summary

This shows how to determine if a given statement regarding network flow is true or false.

$2.19