An algorithm for computing the maximum flow through a network by repeatedly finding an augmenting path from source to sink along which more flow can be pushed, and adding that flow, until no such path remains.
Facts
Core PrincipleRepeatedly finds an augmenting path with spare capacity from source to sink in a flow network and pushes more flow along it, stopping only when no augmenting path remains, to compute a maximum flow. 1 Connections
In Field
Invented
D. R. Fulkerson co-developed the maximum flow algorithm with L. R. Ford Jr., published in 1956.
L. R. Ford Jr. co-developed the maximum flow algorithm with D. R. Fulkerson, published in 1956.
Sources
1. Wikipedia: Ford-Fulkerson Algorithm
Wikimedia FoundationLead section, third sentence
It was published in 1956 by L. R. Ford Jr. and D. R. Fulkerson.
Lead section, algorithm idea sentence
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 the paths.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.