Ford-Fulkerson Maximum Network Flow

##### Description
In optimization theory, maximum flow problems involve finding a feasible flow through a single-source, single-sink flow network that is maximum.<div><br></div><div>The Ford?Fulkerson method is an algorithm which computes the maximum flow in a flow network. It was published in 1956 by L. R. Ford, Jr. and D. R. Fulkerson.&nbsp;The idea behind the algorithm is as follows: As long as there is a path from the source (start node) to the sink (end node), with available capacity on all edges in the path, we send flow along one of these paths. Then we find another path, and so on. A path with available capacity is called an augmenting path.<br></div><div><br></div><div><a href="http://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm">http://en.wikipedia.org/wiki/Ford-Fulkerson_algorithm</a><br></div>
Fulfilled By
• FordFulkersonMaxFlow

/

Ford-Fulkerson (BFS-based aka Edmonds-Karp) Computes a maximum flow given a weighted directed graph.

• requests
• /

• requests

## Discussion

Status
Fulfilled
Bounty expires in
Bounty expired
Bounty
0