C-Plus-Plus/d6/d4c/gcd__recursive__euclidean_8cpp__incl.svg

<?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 2.44.1 (20200629.0846)
 -->
<!-- Title: math/gcd_recursive_euclidean.cpp Pages: 1 -->
<svg width="110pt" height="95pt"
 viewBox="0.00 0.00 110.00 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)">
<title>math/gcd_recursive_euclidean.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 106,-91 106,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm">
<polygon fill="#bfbfbf" stroke="black" points="0,-56.5 0,-86.5 102,-86.5 102,-56.5 0,-56.5"/>
<text text-anchor="start" x="8" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">math/gcd_recursive</text>
<text text-anchor="middle" x="51" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_euclidean.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="24,-0.5 24,-19.5 78,-19.5 78,-0.5 24,-0.5"/>
<text text-anchor="middle" x="51" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M51,-56.4C51,-48.47 51,-38.46 51,-29.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="54.5,-29.66 51,-19.66 47.5,-29.66 54.5,-29.66"/>
</g>
</g>
</svg>