in what way the flow capacity of an arc limits (has an impact on) a maximal flow problem? It would be easier to solve such a problem if the flow capacities are large numbers?
ANSWER:
A
maximum flow in this new-built network is the solution to the
problem, the sources now become ordinary vertices, and they are
subject to the entering-flow equals leaving-flow property.
They must lead to at least O(N³) approach.
If the flow capacities are large numbers, then another
algorithm (such as dynamic programming or greedy), is more
appropriate.
Get Answers For Free
Most questions answered within 1 hours.