Question: answer in pseudo code if code is needed, no actual coding Consider a network with capacities c (e) over edges. Say that we found the

answer in pseudo code if code is needed, no actual coding
Consider a network with capacities c (e) over edges. Say that we found the maximum flow function from s to t. Denote by f (e) the flow on e. Say that we choose one of the directed edges e and increase the capacity of this edge e by 1. Namely the capacity of e is c (e) + 1 now. In the following 4 questions each can be true or false. Hence answer for each one of them if it's true or false and prove your answer. Saying only yeso will not get many points. It may be that the flow value was not increased even after the change. It may be that the flow value increased by 2 after the change. It may be that the flow increased by 1 after the change. It is possible to find in time O (m + n) if the current flow f is still a maximum flow, or otherwise find a new maximum flow. Her |V| = n and |E| = n
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
