Assignment 5: Maximum flow Solution

Due: 1st week after midterm (submission through moodle before sessional class)







All Sections




Implement Ford-Fulkerson method for solving the maximum flow problem (Cormen et al.– Chapter 26) .

Use Edmonds-Karp algorithm to find augmenting paths.




Input: A directed graph with edge capacities, a source s and a sink t.




Output: The value of maximum flow, flow along each edge and edges of a min-cut.