Data structures and Algorithms
Posted: Thu Jul 14, 2022 2:17 pm
Data structures and Algorithms
4. (5 marks) Consider the following flow network N. Run the Ford-Fulkerson algorithm to find a maximum st-flow f in N, and also find a minimum cut of N. For each iteration of Ford-Fulkerson, draw the st-flow f in N, the corresponding residual network Nf​, and indicate the augmenting path.
- Data Structures And Algorithms 1 (273.84 KiB) Viewed 32 times