Ford-Fulkerson: Difference between revisions

From Algowiki
Jump to navigation Jump to search
 
(31 intermediate revisions by 3 users not shown)
Line 1: Line 1:
== General Information ==
== General information ==
'''Algorithmic problem:''' [[Max-Flow Problems]] <br>
 
'''Prerequisites:'''<br>
'''Algorithmic problem:''' [[Max-Flow Problems#Standard version|Max-flow problems (standard version)]] <br>
 
'''Type of algorithm:''' loop<br>
'''Type of algorithm:''' loop<br>
'''Auxiliary data:'''


== Abstract View ==
== Abstract view ==
'''Invariant:''' After <math>i \ge 0</math> ierations <math>f</math> is a fleasible flow.<br>
 
'''Variant:''' The value of <math>f</math> increases.<br>
'''Invariant:'''
'''Break condition:''' There is no flow-augumenting path.
After <math>i \ge 0</math> iterations:
# The flow <math>f</math> is a [[basic flow definitions#Feasible flow|feasible flow]].
# If all upper bounds are integral, <math>f</math> is integral as well.
 
'''Variant:''' The [[Basic flow definitions#Flow value|flow value]] of <math>f</math> increases.


== Induction Basis ==
'''Break condition:''' There is no [[Basic flow definitions#Flow-augmenting paths and saturated arcs|flow-augmenting path]].
 
== Induction basis ==
'''Abstract view:''' We start with some feasible flow, for example, the zero flow.
'''Abstract view:''' We start with some feasible flow, for example, the zero flow.


'''Implementation:''' <math> \forall a \in A:f(a):=0. </math>
'''Implementation:''' Obvious.


'''Proof:''' Obvious.
'''Proof:''' Obvious.


== Induction Step ==
== Induction step ==
'''Abstract view:''' Find a [[Basic flow definitions|flow-augmenting path]] and increase <math>f</math> along this path by the maximal value such that the flow value of each <math>a\in A</math> remains in the interval <math>[0...u(a)]</math>.<br>
'''Abstract view:''' Find a [[Basic flow definitions#Flow-augmenting path|flow-augmenting path]] and increase <math>f</math> along this path up to saturation. If no path is found, the break condition applies, and the loop is terminated.
'''Implementation:'''
# Apply a graph traversal algorithm from <math>s</math> as follows:
##if <math>f(v,w)<c(v,w)</math>, <math>(v,w)\in A</math> can be used for going forward in the direction <math>v \rightarrow w</math>;
##if <math>f(v,w)>0</math>, <math>(v,w)\in A</math>  can be used for going forward in the direction <math> w\rightarrow v</math>; .
#Terminate this graph traversal once either  is seen or all reachable nodes were seen (whatever occurs first).
#In the latter case, the break condition of the loop applies.
#Otherwise,
##let <math>p</math> denote the current path of the traversal (which is an <math>(s,t)</math>-path in this case);
##let <math>x</math> denote the minimum of the values <math>c(a)-f(a)</math> on all forward arcs of <math>p</math>;
##let <math>y</math> denote the minimum of the values <math>f(a)</math> on all backward arcs of <math>p</math>.
##For each arc <math>a \in A</math> on <math>p</math>, increase the flow value by <math>min \{x,y \}</math> if <math>a</math> is a forward arc on <math>p</math>, otherwise, decrease the flow value by <math>min \{x,y \}</math>.


'''Correctness:''' If the graph traversal does not hit <math>t</math>, the break condition is fulfilled, so nothing is to show. So consider the case that the graph traversal does hit <math>t</math>. Then <math>p</math> is an <math>(s,t)</math>-path. By definition of <math>x</math> and <math>y</math>, the capacity constraints are preserved. To see that the flow conservation conditions are preserved as well, only the internal nodes <math>p</math> of  are relevant. Let <math>v</math> be such an internal node, and let <math>u</math> and <math>w</math> denote the immediate predecessor and successor of <math>v</math> on <math>p</math>, respectively. Basically, there are four cases:
'''Proof:''' If the graph traversal does not hit <math>t</math>, the break condition is fulfilled, and nothing is to show. So consider the case that the graph traversal does hit <math>t</math>. Then an <math>(s,t)</math>-path is found. [[Basic flow definitions#Augmenting along a path|Augmenting along this path up to saturation]] preserves feasibility of the flow.
*Either <math>(u,v)</math> is on <math>p</math> as a forward arc or <math>(v,u)</math> is on <math>p</math>  as a backward arc.
*Either <math>(v,w)</math> is on <math>p</math> as a forward arc or <math>(w,v)</math> is on <math>p</math> as a backward arc.
It is easy to check preservation of the flow conservation conditions for each of these four cases.


== Pseudocode ==  
== Correctness ==
<code>
FORD-FULKERSON(''G,s,t'')
1 '''for''' each edge (''u,v'')  &isin; ''G.E''
2    (''u,v'').''f'' = 0
3 '''while''' there exists a path ''p'' from ''s'' to ''t'' in the residual Network G<sub>f</sub>''
4    ''c<sub>f</sub>''(''p'') = min{''c<sub>f</sub>''(''u,v'') : (''u,v'') is in ''p''} 
5    '''for''' each each edge (''u,v'') in ''p''
6        '''if''' (''u,v'') &isin; ''E''
7              (''u,v'').''f'' = (''v,u'').''f'' + ''c<sub>f</sub>''(''p'') 
8        '''else''' (''v,u'').''f'' = (''v,u'').''f'' - ''c<sub>f</sub>''(''p'') 


</code>
Due to the invariant, the flow is feasible before and after each iteration. Termination results from the complexity considerations below. Due to the [[Max-flow min-cut|max-flow min-cut theorem]], the break condition implies that the final flow is maximum.


== Complexity ==
== Complexity ==


'''Statement:''' If all capacity values are integral, the asymptotic worst-case complexity is <math>\Omicron (m*F)</math>, where <math>m = |A|</math> and <math>F</math> is the maximum total flow value.
'''Statement:''' If all capacity values are integral, the asymptotic worst-case complexity is <math>\mathcal{O} (m\cdot F)</math>, where <math>m = |A|</math> and <math>F</math> is the maximum total flow value.
 
'''Proof:''' A graph search from <math>s</math> requires <math>\Omicron (m)</math> . Obviously, determining <math>x</math> and <math>y</math> and changing the flow values along <math>p</math> requires <math>\mathcal{O}(m)</math> as well.
It is also evident that, before and after each iteration, the flow values on all arcs are integral. In particular, the total flow value is integral. The variant implies that, in case of integral capacity values, the total flow value increases by at least one unit in every iteration. Since the total flow value is always in the interval <math>[0...F]</math>, this may happen at most <math>F</math> times.


'''Proof:''' A graph search from <math>s</math> requires <math>\Omicron (m)</math> . Obviously, determining <math>x</math> and <math>y</math> and changing the flow values along <math>p</math> requires <math>Omicron m</math> as well.
'''Remark:'''
It is also evident that, after  iterations, the flow values on all arcs are integral. In particular, the total flow value is integral. The variant implies that, in case of integral capacity values, the total flow value increases by at least one unit in every iteration. Since the total flow value is always in the interval <math>[0...F]</math>, this may happen at most <math>F</math> times.
The number of nodes is irrelevant because at most <math>m</math> nodes are reachable from <math>s</math> (not including <math>s</math> itself).

Latest revision as of 11:49, 23 June 2015

General information

Algorithmic problem: Max-flow problems (standard version)

Type of algorithm: loop

Abstract view

Invariant: After [math]\displaystyle{ i \ge 0 }[/math] iterations:

  1. The flow [math]\displaystyle{ f }[/math] is a feasible flow.
  2. If all upper bounds are integral, [math]\displaystyle{ f }[/math] is integral as well.

Variant: The flow value of [math]\displaystyle{ f }[/math] increases.

Break condition: There is no flow-augmenting path.

Induction basis

Abstract view: We start with some feasible flow, for example, the zero flow.

Implementation: Obvious.

Proof: Obvious.

Induction step

Abstract view: Find a flow-augmenting path and increase [math]\displaystyle{ f }[/math] along this path up to saturation. If no path is found, the break condition applies, and the loop is terminated.

Proof: If the graph traversal does not hit [math]\displaystyle{ t }[/math], the break condition is fulfilled, and nothing is to show. So consider the case that the graph traversal does hit [math]\displaystyle{ t }[/math]. Then an [math]\displaystyle{ (s,t) }[/math]-path is found. Augmenting along this path up to saturation preserves feasibility of the flow.

Correctness

Due to the invariant, the flow is feasible before and after each iteration. Termination results from the complexity considerations below. Due to the max-flow min-cut theorem, the break condition implies that the final flow is maximum.

Complexity

Statement: If all capacity values are integral, the asymptotic worst-case complexity is [math]\displaystyle{ \mathcal{O} (m\cdot F) }[/math], where [math]\displaystyle{ m = |A| }[/math] and [math]\displaystyle{ F }[/math] is the maximum total flow value.

Proof: A graph search from [math]\displaystyle{ s }[/math] requires [math]\displaystyle{ \Omicron (m) }[/math] . Obviously, determining [math]\displaystyle{ x }[/math] and [math]\displaystyle{ y }[/math] and changing the flow values along [math]\displaystyle{ p }[/math] requires [math]\displaystyle{ \mathcal{O}(m) }[/math] as well. It is also evident that, before and after each iteration, the flow values on all arcs are integral. In particular, the total flow value is integral. The variant implies that, in case of integral capacity values, the total flow value increases by at least one unit in every iteration. Since the total flow value is always in the interval [math]\displaystyle{ [0...F] }[/math], this may happen at most [math]\displaystyle{ F }[/math] times.

Remark: The number of nodes is irrelevant because at most [math]\displaystyle{ m }[/math] nodes are reachable from [math]\displaystyle{ s }[/math] (not including [math]\displaystyle{ s }[/math] itself).

Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=Ford-Fulkerson&oldid=3471"