What exactly is augmenting path?

Question

When talking about computing network flows, the Algorithm Design Manual says:

Traditional network flow algorithms are based on the idea o

Answer 1

A process of finding flows from source to sink iteratively. For e.g., in the case of Ford-Fulkerson algorithm, initially all the flows on all the edges are Zero. On iteration we take the values for every path/edge leading us to find flows called augmenting paths.