AUGMENTING PATH

Augmenting path - In network flows , it is a path from a source (s) to sink (t) such that:

every forward arc has flow less than capacity: d(k) := c(k) - f(k);

every backward arc has positive flow: d(k) := f(k);

Then, the flow from s to t can increase by d* := Min(d(k)) > 0. The flows along the path change as: