 Geometric convergence of widest-path augmentation

Starting from zero flow, a widest augmenting path increases the current flow by at least $F_k/m$, where $F_k$ is its remaining optimality gap. Therefore $F_{k+1}\le (1-1/m)F_k$. Integer capacities keep this gap integer, so a gap below one is zero. The method takes $O(m\log f^{\ast })$ augmentations for $f^{\ast }\ge 2$, or uniformly $O(m\log (1+f^{\ast }))$; zero maximum flow requires no augmentation.