The Maximum Network Flow Problem - SlideServe

Figure 7.26 shows a flow network on which an s ·t flow has been computed. The capacity of each edge appears as a label next to the edge, and the numbers in boxes give the amount of flow sent on each edge. (Edges without boxed numbers-specifically, the four edges of capacity 3- have no flow being sent on them.) (a) What is the value of this flow? Is this a maximum (s, t) flow in this graph? (b) Find a minimum s-t cut in the flow network pictured in Figure 7.26 and also say what its capacity is. |

determine the maximal flow and the optimum flow in each arc for the network in figure 640 fi figure 640 network for problem 6 30 99341