In the following network flow graph, the following values are given. It is aimed to find maximum flow from source to sink.

Augment flow along the augmenting path “source-A-sink” , what will be the change in capacity and flow values along the edges .

Question

In the following network flow graph, the following values are given. It is aimed to find maximum flow from source to sink. 
  
 Augment flow along the  augmenting path “source->A->sink” , what will be the  change in capacity and flow values along the edges .

Accepted Answer

(source, A).capacity=6, (source, A).flow=7, (A, sink).capacity=0, (A, sink).flow =7

Answer

(source, A).capacity=7 , (source, A).flow=6, (A, sink).capacity=1, (A, sink).flow =6

Answer

(source, A).capacity=9 , (source, A).flow=4, (A, sink).capacity=3, (A, sink).flow =4

Answer

(source, A).capacity=8 , (source, A).flow=5, (A, sink).capacity=2, (A, sink).flow =5

Crowdly

In the following network flow graph, the following values are given. It is ai...

Want instant access to all verified answers on moovit.vit.ac.in?