In the context of the Ford-Fulkerson method, what is a path from the source to the sink in the residual graph called?
Show answer
Augmenting path
An augmenting path is a path in the residual network where every edge has available capacity. The Max-Flow Min-Cut Theorem states that a flow is maximum if and only if there are no augmenting paths.
Also asked as:
- What term describes a source-to-sink path in a residual network whose every edge has available capacity, as used in the Ford-Fulkerson method?