Given a flow network as below with S and T as source and sink (destination). The pair of integers on each edge correspon

[answerhappygod]

Given A Flow Network As Below With S And T As Source And Sink Destination The Pair Of Integers On Each Edge Correspon 1 (157.65 KiB) Viewed 33 times

Given a flow network as below with S and T as source and sink (destination). The pair of integers on each edge corresponds to the current flow value and the capacity of that edge. For instance, the edge (S,D) has capacity 20 and currently is assigned a flow of 5 (units). Assume that we are apply the Ford- Fullkerson's method to find a maximum flow. Fill in the blanks below with your answers. a) The capacity of the backward edge D->S in the residual network is b) An augmenting path in the residual network is Note: give you answer by listing the vertices along the path, starting with S and ending with T, e.g., SABT (note that this is for demonstration purpose only and may not be a valid answer), with no spaces or punctuation marks, i.e., no commas "," or full stops ".". If there are more than one augmenting path, then you can choose one arbitrarily. c) The value of a maximum flow is Note: your answer for part a) and c) are a single integer with no spaces before or after. 7/7 A B 7/7 8/8 4/8 S 5/20 D 1/4 0/5 4/4 E T