Ford–Fulkerson algorithm

The Ford–Fulkerson method or Ford–Fulkerson algorithm (FFA) is a greedy algorithm that computes the maximum flow in a flow network. It is called a "method" instead of an "algorithm" as the approach to finding augmenting paths in a residual graph is not fully specified^[1] or it is specified in several implementations with different running times.^[2] It was published in 1956 by L. R. Ford, Jr. and D. R. Fulkerson.^[3] 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 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 the paths. Then we find another path, and so on. A path with available capacity is called an augmenting path.

Algorithm

Let $G(V,E)$ be a graph, and for each edge from $u$ to $v$ , let $c(u,v)$ be the capacity and $f(u,v)$ be the flow. We want to find the maximum flow from the source $s$ to the sink $t$ . After every step in the algorithm the following is maintained:

Capacity constraints:	$\forall (u,v)\in E\ f(u,v)\leq c(u,v)$	The flow along an edge can not exceed its capacity.
Skew symmetry:	$\forall (u,v)\in E\ f(u,v)=-f(v,u)$	The net flow from $u$ to $v$ must be the opposite of the net flow from $v$ to $u$ (see example).
Flow conservation:	$\forall u\in V:u\neq s{\text{ and }}u\neq t\Rightarrow \sum _{w\in V}f(u,w)=0$	That is, unless $u$ is $s$ or $t$ . The net flow to a node is zero, except for the source, which "produces" flow, and the sink, which "consumes" flow.
Value(f):	$\sum _{(s,u)\in E}f(s,u)=\sum _{(v,t)\in E}f(v,t)$	That is, the flow leaving from $s$ must be equal to the flow arriving at $t$ .

This means that the flow through the network is a legal flow after each round in the algorithm. We define the residual network $G_{f}(V,E_{f})$ to be the network with capacity $c_{f}(u,v)=c(u,v)-f(u,v)$ and no flow. Notice that it can happen that a flow from $v$ to $u$ is allowed in the residual network, though disallowed in the original network: if $f(u,v)>0$ and $c(v,u)=0$ then $c_{f}(v,u)=c(v,u)-f(v,u)=f(u,v)>0$ .

Algorithm Ford–Fulkerson

Inputs Given a Network

G=(V,E)

with flow capacity

c

, a source node

s

, and a sink node

t

Output Compute a flow

f

from

s

t

of maximum value

$f(u,v)\leftarrow 0$ for all edges $(u,v)$
While there is a path $p$ from $s$ to $t$ in $G_{f}$ , such that $c_{f}(u,v)>0$ for all edges $(u,v)\in p$ :
1. Find $c_{f}(p)=\min\{c_{f}(u,v):(u,v)\in p\}$
2. For each edge $(u,v)\in p$
  1. $f(u,v)\leftarrow f(u,v)+c_{f}(p)$ (Send flow along the path)
  2. $f(v,u)\leftarrow f(v,u)-c_{f}(p)$ (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 $G_{f}(V,E_{f})$ . If you use the former, the algorithm is called Edmonds–Karp.

When no more paths in step 2 can be found, $s$ will not be able to reach $t$ in the residual network. If $S$ is the set of nodes reachable by $s$ in the residual network, then the total capacity in the original network of edges from $S$ to the remainder of $V$ is on the one hand equal to the total flow we found from $s$ to $t$ , and on the other hand serves as an upper bound for all such flows. This proves that the flow we found is maximal. See also Max-flow Min-cut theorem.

If the graph $G(V,E)$ has multiple sources and sinks, we act as follows: Suppose that $T=\{t|t{\text{ is a sink}}\}$ and $S=\{s|s{\text{ is a source}}\}$ . Add a new source $s^{*}$ with an edge $(s^{*},s)$ from $s^{*}$ to every node $s\in S$ , with capacity $c(s^{*},s)=d_{s}\;(d_{s}=\sum _{(s,u)\in E}c(s,u))$ . And add a new sink $t^{*}$ with an edge $(t,t^{*})$ from every node $t\in T$ to $t^{*}$ , with capacity $c(t,t^{*})=d_{t}\;(d_{t}=\sum _{(v,t)\in E}c(v,t))$ . Then apply the Ford–Fulkerson algorithm.

Also, if a node $u$ has capacity constraint $d_{u}$ , we replace this node with two nodes $u_{{in}},u_{{out}}$ , and an edge $(u_{in},u_{out})$ , with capacity $c(u_{in},u_{out})=d_{u}$ . Then apply the Ford–Fulkerson algorithm.

Complexity

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. However, there is no certainty that this situation will ever be reached, so the best that can be guaranteed is that the answer will be correct if the algorithm terminates. In the case that the algorithm runs forever, the flow might not even converge towards the maximum flow. However, this situation only occurs with irrational flow values. When the capacities are integers, the runtime of Ford–Fulkerson is bounded by $O(Ef)$ (see big O notation), where $E$ is the number of edges in the graph and $f$ is the maximum flow in the graph. This is because each augmenting path can be found in $O(E)$ time and increases the flow by an integer amount of at least $1$ , with the upper bound $f$ .

A variation of the Ford–Fulkerson algorithm with guaranteed termination and a runtime independent of the maximum flow value is the Edmonds–Karp algorithm, which runs in $O(VE^{2})$ time.

Integral example

The following example shows the first steps of Ford–Fulkerson in a flow network with 4 nodes, source $A$ and sink $D$ . This example shows the worst-case behaviour of the algorithm. In each step, only a flow of $1$ is sent across the network. If breadth-first-search were used instead, only two steps would be needed.

Path	Capacity	Resulting flow network
Initial flow network
$A,B,C,D$	${\begin{aligned}&\min(c_{f}(A,B),c_{f}(B,C),c_{f}(C,D))\\=&\min(c(A,B)-f(A,B),c(B,C)-f(B,C),c(C,D)-f(C,D))\\=&\min(1000-0,1-0,1000-0)=1\end{aligned}}$
$A,C,B,D$	${\begin{aligned}&\min(c_{f}(A,C),c_{f}(C,B),c_{f}(B,D))\\=&\min(c(A,C)-f(A,C),c(C,B)-f(C,B),c(B,D)-f(B,D))\\=&\min(1000-0,0-(-1),1000-0)=1\end{aligned}}$
After 1998 more steps …
Final flow network

Notice how flow is "pushed back" from $C$ to $B$ when finding the path $A,C,B,D$ .

Non-terminating example

Consider the flow network shown on the right, with source $s$ , sink $t$ , capacities of edges $e_{1}$ , $e_{2}$ and $e_{3}$ respectively $1$ , $r=({\sqrt {5}}-1)/2$ and $1$ and the capacity of all other edges some integer $M\geq 2$ . The constant $r$ was chosen so, that $r^{2}=1-r$ . We use augmenting paths according to the following table, where $p_{1}=\{s,v_{4},v_{3},v_{2},v_{1},t\}$ , $p_{2}=\{s,v_{2},v_{3},v_{4},t\}$ and $p_{3}=\{s,v_{1},v_{2},v_{3},t\}$ .

Step	Augmenting path	Sent flow	Residual capacities
Step	Augmenting path	Sent flow	$e_{1}$	$e_{2}$	$e_{3}$
0			$r^{0}=1$	$r$	$1$
1	$\{s,v_{2},v_{3},t\}$	$1$	$r^{0}$	$r^{1}$	$0$
2	$p_{1}$	$r^{1}$	$r^{2}$	$0$	$r^{1}$
3	$p_{2}$	$r^{1}$	$r^{2}$	$r^{1}$	$0$
4	$p_{1}$	$r^{2}$	$0$	$r^{3}$	$r^{2}$
5	$p_{3}$	$r^{2}$	$r^{2}$	$r^{3}$	$0$

Note that after step 1 as well as after step 5, the residual capacities of edges $e_{1}$ , $e_{2}$ and $e_{3}$ are in the form $r^{n}$ , $r^{n+1}$ and $0$ , respectively, for some $n\in \mathbb {N}$ . This means that we can use augmenting paths $p_{1}$ , $p_{2}$ , $p_{1}$ and $p_{3}$ infinitely many times and residual capacities of these edges will always be in the same form. Total flow in the network after step 5 is $1+2(r^{1}+r^{2})$ . If we continue to use augmenting paths as above, the total flow converges to $\textstyle 1+2\sum _{i=1}^{\infty }r^{i}=3+2r$ , while the maximum flow is $2M+1$ . In this case, the algorithm never terminates and the flow doesn't even converge to the maximum flow.^[4]

Python implementation of Edmonds-Karp algorithm

import collections
 
# This class represents a directed graph using adjacency matrix representation
class Graph:
  
    def __init__(self,graph):
        self.graph = graph # residual graph
        self. ROW = len(graph)
  
    def BFS(self,s, t, parent):
        '''Returns true if there is a path from source 's' to sink 't' in
        residual graph. Also fills parent[] to store the path '''

        # Mark all the vertices as not visited
        visited = [False] * (self.ROW)
         
        # Create a queue for BFS
        queue = collections.deque()
         
        # Mark the source node as visited and enqueue it
        queue.append(s)
        visited[s] = True
         
        # Standard BFS Loop
        while queue:
            u = queue.popleft()
         
            # Get all adjacent vertices's of the dequeued vertex u
            # If a adjacent has not been visited, then mark it
            # visited and enqueue it
            for ind, val in enumerate(self.graph[u]):
                if visited[ind] == False and val > 0 :
                    queue.append(ind)
                    visited[ind] = True
                    parent[ind] = u
 
        # If we reached sink in BFS starting from source, then return
        # true, else false
        return visited[t]
             
    # Returns the maximum flow from s to t in the given graph
    def EdmondsKarp(self, source, sink):
 
        # This array is filled by BFS and to store path
        parent = [-1] * (self.ROW)
 
        max_flow = 0 # There is no flow initially
 
        # Augment the flow while there is path from source to sink
        while self.BFS(source, sink, parent) :
 
            # Find minimum residual capacity of the edges along the
            # path filled by BFS. Or we can say find the maximum flow
            # through the path found.
            path_flow = float("Inf")
            s = sink
            while s !=  source:
                path_flow = min (path_flow, self.graph[parent[s]][s])
                s = parent[s]
 
            # Add path flow to overall flow
            max_flow +=  path_flow
 
            # update residual capacities of the edges and reverse edges
            # along the path
            v = sink
            while v !=  source:
                u = parent[v]
                self.graph[u][v] -= path_flow
                self.graph[v][u] += path_flow
                v = parent[v]
 
        return max_flow

Notes

↑ Laung-Terng Wang, Yao-Wen Chang, Kwang-Ting (Tim) Cheng (2009). Electronic Design Automation: Synthesis, Verification, and Test. Morgan Kaufmann. p. 204. ISBN 0080922007.
↑ Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest; Clifford Stein (2009). Introduction to Algorithms. MIT Press. p. 714. ISBN 0262258102.
↑ Ford, L. R.; Fulkerson, D. R. (1956). "Maximal flow through a network" (PDF). Canadian Journal of Mathematics. 8: 399–404. doi:10.4153/CJM-1956-045-5.
↑ Zwick, Uri (21 August 1995). "The smallest networks on which the Ford–Fulkerson maximum flow procedure may fail to terminate". Theoretical Computer Science. 148 (1): 165–170. doi:10.1016/0304-3975(95)00022-O.

References

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). "Section 26.2: The Ford–Fulkerson method". Introduction to Algorithms (Second ed.). MIT Press and McGraw–Hill. pp. 651–664. ISBN 0-262-03293-7.
George T. Heineman; Gary Pollice; Stanley Selkow (2008). "Chapter 8:Network Flow Algorithms". Algorithms in a Nutshell. Oreilly Media. pp. 226–250. ISBN 978-0-596-51624-6.
Jon Kleinberg; Éva Tardos (2006). "Chapter 7:Extensions to the Maximum-Flow Problem". Algorithm Design. Pearson Education. pp. 378–384. ISBN 0-321-29535-8.

External links

Media related to Ford–Fulkerson algorithm at Wikimedia Commons

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.