backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-16 11:32:44 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for aaa08b0150

Browse Source
This commit is contained in:
github-actions
2020-06-19 16:07:44 +00:00
parent 4c261744f6
commit 93021161c2
1714 changed files with 114526 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
d4/deb/gcd__iterative__euclidean_8cpp__incl.map Normal file
View File

@@ -0,0 +1,5 @@
<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>

1
d4/deb/gcd__iterative__euclidean_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
ba1669f8a58ffa4a5dba151c4a8cfacc

53
d4/deb/gcd__iterative__euclidean_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,53 @@
<?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.0 (20200408.0750)
-->
<!-- Title: math/gcd_iterative_euclidean.cpp Pages: 1 -->
<svg width="140pt" height="95pt"
viewBox="0.00 0.00 139.50 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_iterative_euclidean.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 135.5,-91 135.5,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 iterative form of Euclidean algorithm">
<polygon fill="#bfbfbf" stroke="black" points="15.5,-56.5 15.5,-86.5 112.5,-86.5 112.5,-56.5 15.5,-56.5"/>
<text text-anchor="start" x="23.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">math/gcd_iterative</text>
<text text-anchor="middle" x="64" 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="0,-0.5 0,-19.5 54,-19.5 54,-0.5 0,-0.5"/>
<text text-anchor="middle" x="27" 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="M55.23,-56.4C50.02,-48.02 43.37,-37.33 37.83,-28.42"/>
<polygon fill="midnightblue" stroke="midnightblue" points="40.64,-26.3 32.38,-19.66 34.69,-30 40.64,-26.3"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="72.5,-0.5 72.5,-19.5 131.5,-19.5 131.5,-0.5 72.5,-0.5"/>
<text text-anchor="middle" x="102" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">stdexcept</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M73.01,-56.4C78.41,-47.93 85.33,-37.1 91.05,-28.14"/>
<polygon fill="midnightblue" stroke="midnightblue" points="94.04,-29.97 96.47,-19.66 88.14,-26.2 94.04,-29.97"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.4 KiB