Ford–Fulkerson algorithm.pdf

Ford–Fulkerson algorithm 1 Ford–Fulkerson algorithm The Ford–Fulkerson algorithm (named for L. R. Ford, Jr. and D. R. Fulkerson) computes the maximum flow in a flow network. It was published in 1956. The name Ford–Fulkerson is often also used for the Edmonds–Karp algorithm, which is a specialization of Ford–Fulkerson. The idea behind the algorithm is very simple: 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. Algorithm Let be a graph, and for each edge from to , let be the capacity and be the flow. We want to find the maximum flow from the source to the sink . After every step in the algorithm the following is maintained: Capacity constraints: The flow along an edge can not exceed its capacity. Skew symmetry: The net flow from to must be the opposite of the net flow from to (see example). Flow conservation: That is, unless or . The net flow to a node is zero, except for the source, which produces flow, and the sink, which consumes flow. This means that the flow through the network is a legal flow after each round in the algorithm. We define the residual network to be the network with capacity and no flow. Notice that it can happen that a flow from to is allowed in the residual network, though disallowed in the original network: if and then . Algorithm Ford–Fulkerson Inputs Graph with flow capacity , a source node , and a sink node Output A flow from to which is a maximum 1. for all edges 2. While there is a path from to in , such that for all edges : 1. Find 2. For each edge 1. (Send flow along the path) 2. (The flow might be returned later) The path in step 2 can be found with for example a breadth-first search or a depth-first search in . If you use the former, the algorithm is called Edmonds–Karp. When no more paths in step 2 can be found, wi