Ford Fulkerson Algorithm
The ford fulkerson algorithm is an algorithm that tackles the max flow min cut problem. Ford fulkerson algorithm is a greedy approach for calculating the maximum possible flow in a network or a graph. Maximum Flow Ford Fulkerson Mathematics Stack Exchange Find some augmenting path p and increas…