mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-13 11:09:48 +08:00
85 lines
3.4 KiB
XML
85 lines
3.4 KiB
XML
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
|
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
|
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
|
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
|
-->
|
|
<!-- Title: math/gcd_iterative_euclidean.cpp Pages: 1 -->
|
|
<svg width="138pt" height="94pt"
|
|
viewBox="0.00 0.00 138.00 94.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
|
|
|
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
|
|
|
|
<style type="text/css"><![CDATA[
|
|
.node, .edge {opacity: 0.7;}
|
|
.node.selected, .edge.selected {opacity: 1;}
|
|
.edge:hover path { stroke: red; }
|
|
.edge:hover polygon { stroke: red; fill: red; }
|
|
]]></style>
|
|
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
|
|
<svg id="graph" class="graph">
|
|
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.75)">
|
|
<title>math/gcd_iterative_euclidean.cpp</title>
|
|
<!-- Node1 -->
|
|
<g id="Node000001" class="node">
|
|
<title>Node1</title>
|
|
<g id="a_Node000001"><a xlink:title="Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm">
|
|
<polygon fill="#999999" stroke="#666666" points="111.88,-85.75 15.62,-85.75 15.62,-55.25 111.88,-55.25 111.88,-85.75"/>
|
|
<text xml:space="preserve" text-anchor="start" x="23.62" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">math/gcd_iterative</text>
|
|
<text xml:space="preserve" text-anchor="middle" x="63.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_euclidean.cpp</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node2 -->
|
|
<g id="Node000002" class="node">
|
|
<title>Node2</title>
|
|
<g id="a_Node000002"><a xlink:title=" ">
|
|
<polygon fill="#e0e0e0" stroke="#999999" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
|
|
<text xml:space="preserve" text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node2 -->
|
|
<g id="edge1_Node000001_Node000002" class="edge">
|
|
<title>Node1->Node2</title>
|
|
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
|
<path fill="none" stroke="#63b8ff" d="M54.6,-54.95C49.73,-47.19 43.68,-37.56 38.46,-29.26"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="41.54,-27.59 33.26,-20.98 35.62,-31.31 41.54,-27.59"/>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node3 -->
|
|
<g id="Node000003" class="node">
|
|
<title>Node3</title>
|
|
<g id="a_Node000003"><a xlink:title=" ">
|
|
<polygon fill="#e0e0e0" stroke="#999999" points="130.12,-19.25 71.38,-19.25 71.38,0 130.12,0 130.12,-19.25"/>
|
|
<text xml:space="preserve" text-anchor="middle" x="100.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stdexcept</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node3 -->
|
|
<g id="edge2_Node000001_Node000003" class="edge">
|
|
<title>Node1->Node3</title>
|
|
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
|
<path fill="none" stroke="#63b8ff" d="M72.9,-54.95C77.77,-47.19 83.82,-37.56 89.04,-29.26"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="91.88,-31.31 94.24,-20.98 85.96,-27.59 91.88,-31.31"/>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
</g>
|
|
</svg>
|
|
</svg>
|
|
|
|
<style type='text/css'>
|
|
<![CDATA[
|
|
[data-mouse-over-selected='false'] { opacity: 0.7; }
|
|
[data-mouse-over-selected='true'] { opacity: 1.0; }
|
|
]]>
|
|
</style>
|
|
<script type="application/ecmascript"><![CDATA[
|
|
document.addEventListener('DOMContentLoaded', (event) => {
|
|
highlightEdges();
|
|
highlightAdjacentNodes();
|
|
});
|
|
]]></script>
|
|
</svg>
|