ree. ">rootDist()</a></code>. The functions <code><a class="el" href="a00182.html#a8fd9a551129afe8068e2dc820be68fc9" title="Return the minimum cut between two nodes. ">minCutMap()</a></code> and <code><a class="el" href="a00182.html#ab6912debf06e1db6c9c267a93368af51" title="Return the minimum cut value between two nodes. ">minCutValue()</a></code> calculate the minimum cut and the minimum cut value between any two nodes in the graph. You can also list (iterate on) the nodes and the edges of the cuts using <