next up previous
Next: Residual Capacity Up: CSE 2320: Algorithms and Previous: Maximum-Flow Problem

Ford-Fulkerson Method

Look for paths from s to t that can accept more flow (augmenting path) and increase flow along this path.

Ford-Fulkerson-Method(G, s, t)
   flow f = 0
   while an augmenting path p exists
      augment flow f along p
   return f

An augmenting path is a path from s to t in a residual network which consists of edges that can admit more flow.



Copyright © 1998 The University of Texas at Arlington