Edmonds-karp algorithm - A C++ program which returns the largest flow and flow through each edge.-Edmonds-karp algorithm- A C++ program which returns the largest flow and flow through each edge.

This source code contains: -BFS algorithm on a graph -Edmonds­ Karp algorithm on a graph -minimal cut on a graph -disjunct paths in a graph.