Ford-Fulkerson algorithm

Ford-Fulkerson algorithm is a greedy algorithm to find a maximum flow among a graph.

Complexity

Time complexity for this algorithm is $O(E{f}_{max})$

• $E$ is the number of edges
• $f_{max}$ is the maximum flow in the graph