3

Can someone please direct me to a site where step-by-step instruction is given on how to apply ford-fulkerson method on a graph to find the maximum flow.

Thank you so much in advance.

templatetypedef
  • 362,284
  • 104
  • 897
  • 1,065
sap
  • 1,141
  • 6
  • 41
  • 62

3 Answers3

3

Best I know ( link ), wikipedia ( link ) and first alternative Google hit ( Link ).

Ford-Fulkerson Labeling Algorithm

  • (Initialization) Let x be an initial feasible flow (e.g. x(e) = 0 for all e in E).
  • (Flow augmentation) If there are no augmenting path from s to t on the residual network, then stop. The present x is a max flow. If there is a flow augmenting path p, replace the flow x as 2.
    • x(e)=x(e)+delta if e is a forward arc on p.
    • x(e)=x(e)-delta if e is a backward arc on p. where delta is a minimum value of residual capacity on p. Repeat this step.

Source code example: Java

Margus
  • 19,694
  • 14
  • 55
  • 103
  • 1
    Thanks for your help. found this fantastic explanation:http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=maxFlow – sap Nov 04 '10 at 15:53
0

also interesting is the min-cut theorem. the maximum amount of flow passing from the source to the sink is equal to the minimum cut of edges and their flow. i just flunked on that question in school :(

http://en.wikipedia.org/wiki/Max-flow_min-cut_theorem

ColacX
  • 3,928
  • 6
  • 34
  • 36
0

http://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm

l337x911
  • 171
  • 4