Explain why augmenting along shortest augmenting path results in polynomial algorithm for max-flow.
My idea is that it's somehow connected to creating the residual graph along the augmenting path where we are trying to use all the flow of the edges. So in this case when we use the shortest augmenting path we will converge the fastest. Ans since to find the shortest path is in polynomial it stays in polynomial.
Any ideas how to prove this to be mathematically correct?