backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-01 14:03:17 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 0953376d31

Browse Source
This commit is contained in:
github-actions
2023-06-16 21:18:14 +00:00
parent 26f1eee566
commit 14deeecd50
7241 changed files with 234176 additions and 54779 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
d4/deb/gcd__iterative__euclidean_8cpp__incl.map
View File

@@ -1,5 +1,7 @@
<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,46"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,94,77,120"/>
<area shape="rect" id="node3" title=" " alt="" coords="101,94,179,120"/>
<area shape="rect" id="Node000001" title="Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm" alt="" coords="26,5,155,46"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,77,120"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="80,48,59,82,54,80,76,45"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="101,94,179,120"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="105,45,127,80,122,82,100,48"/>
</map>

2
d4/deb/gcd__iterative__euclidean_8cpp__incl.md5
View File

@@ -1 +1 @@
b1b93c9a1ddeea50d0cc6ae44ff58e1a
87d3949a1bd6086aae368d9606e3485e

47
d4/deb/gcd__iterative__euclidean_8cpp__incl.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: math/gcd_iterative_euclidean.cpp Pages: 1 -->
<svg width="138pt" height="94pt"
viewBox="0.00 0.00 138.12 93.75" 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" onload="init(evt)">
<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="node1" class="node">
<g id="Node000001" 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">
<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 text-anchor="start" x="23.62" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">math/gcd_iterative</text>
<text text-anchor="middle" x="63.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_euclidean.cpp</text>
@@ -19,34 +29,55 @@
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink: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 text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M54.6,-54.95C49.67,-47.1 43.54,-37.35 38.29,-28.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="40.74,-27.31 32.45,-20.7 34.81,-31.03 40.74,-27.31"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink: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 text-anchor="middle" x="100.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stdexcept</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M72.9,-54.95C77.83,-47.1 83.96,-37.35 89.21,-28.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="92.69,-31.03 95.05,-20.7 86.76,-27.31 92.69,-31.03"/>
</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>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

58
d4/deb/gcd__iterative__euclidean_8cpp__incl_org.svg Normal file
View File

@@ -0,0 +1,58 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: math/gcd_iterative_euclidean.cpp Pages: 1 -->
<svg width="138pt" height="94pt"
viewBox="0.00 0.00 138.12 93.75" 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 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 text-anchor="start" x="23.62" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">math/gcd_iterative</text>
<text 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 text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M54.6,-54.95C49.67,-47.1 43.54,-37.35 38.29,-28.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="40.74,-27.31 32.45,-20.7 34.81,-31.03 40.74,-27.31"/>
</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 text-anchor="middle" x="100.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stdexcept</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M72.9,-54.95C77.83,-47.1 83.96,-37.35 89.21,-28.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="92.69,-31.03 95.05,-20.7 86.76,-27.31 92.69,-31.03"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.5 KiB