Network Flow Exercises

Ford-Fulkerson Algorithm

1. For each graph (s is the source, t is the sink and the edge weights are capacities), determine 1) the max flow, 2) the corresponding residual graph (with a max flow) and 3) the min-cut:
   
   1. Digraph 1:
      
      
   2. Digraph 2:
      
      

Last Modified: