components obtained by removing this edge from the tree determine the corresponding minimum cut. Therefore once this tree is computed, the minimum cut between any pair of nodes can easily be obtained.</p>
<p>The algorithm calculates <em>n-1</em> distinct minimum cuts (currently with the <a class="el" href="a00311.html">Preflow</a> algorithm), thus it has <img class="formulaInl" alt="$O(n^3\sqrt{m})$" src="form_75.png"/> overall time complexity. It calculates a rooted Gomory-Hu tree. The structure of the tre