DSA
Pushing the most flow through a network using the Ford-Fulkerson and Edmonds-Karp algorithms.
The Maximum Flow problem is about finding the maximum flow through a directed graph, from one place in the graph to another.
The Ford-Fulkerson algorithm solves the maximum flow problem.
The Edmonds-Karp algorithm solves the maximum flow problem.