Maximum Flow - Ford-Fulkerson and Edmonds-Karp

Source : 

Link1  Link2 Link3

Code :

Applications :

1. Max-Flow Min-Cut Theorem : It says that the capacity of the maximum flow has to be equal to the capacity of the minimum cut.

2. Multiple Source & Sink : We will connect multiple source to a super source and multiple sink to a super sink. 

3. Node Capacity : Normally we have edge capacity. If we have node capacity then we will make there two nodes instead of one node. Like - If we have 4 nodes then we will make 1 to (1 -> 5) where there is an edge between 1 & 5.

*** Under construction...