Algorithm start with initial flow as 0 while there is an augmenting path from source to sink, add this path-flow to flow return flow Time Complexity O(Ef) where: E - number of edges f - is max flow