Suppose we have a directed graph, and we want to get the maxflow out of this graph. How can we decide the maxflow of this graph is unique?
I have an idea that after we found a maxflow out of the graph, we compute the residual graph of this graph. If there is a cycle in this residual graph, then we can generate another maxflow by modifying the previous maxflow path along this cycle.
But how can we prove that if there is no cycle in the residual graph, then the maxflow is unique in the graph?