lue between the nodes <code>s</code> and <code>t</code>. It finds the nearest common ancestor of the given nodes in the Gomory-Hu tree and calculates the minimum weight edge on the paths to the ancestor.</p>
<dl class="section pre"><dt>Precondition</dt><dd><a class="el" href="a00182.html#a13a43e6d814de94978c515cb084873b1">run()</a> must be called before using this function. </dd></dl>

</div>
</div>
<a class="anchor" id="a8fd9a551129afe8068e2dc820be68fc9"></a>
<div class="memitem">
<div class="memproto">
<t