Jump to content

Ford–Fulkerson algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 62.163.16.73 (talk) at 16:25, 27 May 2002 (short description). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The Ford-Fulkerson algorithm computes the maximum flow in a graph.

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 path can be found in the graph.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Ford–Fulkerson_algorithm&oldid=469963"