For the maximum flow problem, I implemented the Ford-Fulkerson algorithm with Breadth- First Search (BFS) as the path-finding method, also known as the Edmonds-Karp algorithm. This algorithm finds the maximum flow in a network from a source to a sink node.
Supundi-D/MaxFlowSolver
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|