# Question

Let G = (V, E) be a flow network with source s, sink t, and integer capacities. Suppose that we are given a maximum flow in G.

a. Suppose that the capacity of a single edge (u, v) ¬ E is increased by 1. Give an O (V + E)-time algorithm to update the maximum flow.

b. Suppose that the capacity of a single edge (u, v) ¬ E is decreased by 1. Give an O (V + E)-time algorithm to update the maximum flow.

a. Suppose that the capacity of a single edge (u, v) ¬ E is increased by 1. Give an O (V + E)-time algorithm to update the maximum flow.

b. Suppose that the capacity of a single edge (u, v) ¬ E is decreased by 1. Give an O (V + E)-time algorithm to update the maximum flow.

## Answer to relevant Questions

Let G = (V, E) be a flow network with source s, sink t, and an integer capacity c (u, v) on each edge (u, v) ¬ E. Let C = max (u, v) Ec (u, v). a. Argue that a minimum cut of G has capacity at most C ...How many comparators are there in SORTER [n]?Give a counterexample to the conjecture that if there is a path from u to v in a directed graph G, then any depth-first search must result in d[v] ≤ f[u].A depth-first forest classifies the edges of a graph into tree, back, forward, and cross edges. A breadth-first tree can also be used to classify the edges reachable from the source of the search into the same four ...The compressor in a refrigerator takes refrigerant R-134a in at 100 kPa, 20C and compresses it to 1 MPa, 40C. With the room at 20C find the minimum compressor work.Post your question

0