<map id="math/gcd_iterative_euclidean.cpp" name="math/gcd_iterative_euclidean.cpp">
<area shape="rect" id="node1" title="Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm" alt="" coords="26,5,155,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,77,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="102,95,181,121"/>
</map>
