Encyclopedia > Ford-Fulkerson algorithm

Article Content

Ford-Fulkerson algorithm

The Ford-Fulkerson algorithm (named for L. R. Ford and D. R. Fulkerson) computes the maximum flow[?] in a flow network[?].

It works by finding a flow augmenting path in the graph. By adding the flow augmenting path to the flow already established in the graph, the maximum flow will be reached when no more flow augmenting paths can be found in the graph.

A variation of the Ford-Fulkerson algorithm is the Edmonds-Karp algorithm.

All Wikipedia text is available under the terms of the GNU Free Documentation License

Search Encyclopedia

Search over one million articles, find something about almost anything!

Featured Article

Reformed churches

... of Faith[?] (1563). German Reformed Church[?] Toleration for the Reformed churches in Germany was established under the Peace of Westphalia, in 1648, but political ...