Question: Suppose you have a network N and a maximum flow on the network. Now suppose that one edge is removed from the network (for example,
Suppose you have a network N and a maximum flow on the network. Now suppose that one edge is removed from the network (for example, that pipe requires maintenance). Calculate a new maximum flow for the network. The number of iterations your algorithm uses should be bounded by the capacity of the edge that was removed from the network, not the resulting flow volume. Give the running time and prove your algorithm is correct.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
