Question

A. Given the network G = (V, E, c, s, t) shown below, provide a flow f on this network which has the following properties. 1. f is not a maximum flow for G. 2. The only positive-capacity path Pin N(G, f) from s to t has the property that it traverses exactly two backward edges. 3. Af, P) is a maximum flow for G. Draw N(G, f) and highlight P in this graph. (10 pts) 1 6 b 5 8 2 5 4 7 9 5

Answer 1

Answer:

3

Explanation:

ap,p) is a maximum flow for g draw N(G,f). and higlight p in this grape