backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-29 13:03:58 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 1a1570d775

Browse Source
This commit is contained in:
github-actions
2023-04-28 14:48:59 +00:00
parent ffdd173f0d
commit 7312767170
3827 changed files with 57379 additions and 55777 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
d6/d4c/gcd__recursive__euclidean_8cpp__incl.map
View File

@@ -1,4 +1,4 @@
<map id="math/gcd_recursive_euclidean.cpp" name="math/gcd_recursive_euclidean.cpp">
<area shape="rect" id="node1" title="Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm" alt="" coords="5,5,141,45"/>
<area shape="rect" id="node2" title=" " alt="" coords="37,93,109,119"/>
<area shape="rect" id="node1" title="Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm" alt="" coords="5,5,141,46"/>
<area shape="rect" id="node2" title=" " alt="" coords="37,94,109,120"/>
</map>

22
d6/d4c/gcd__recursive__euclidean_8cpp__incl.svg
View File

@@ -1,20 +1,20 @@
<?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.2 (20230410.1723)
<!-- Generated by graphviz version 8.0.4 (20230421.1958)
-->
<!-- Title: math/gcd_recursive_euclidean.cpp Pages: 1 -->
<svg width="110pt" height="93pt"
viewBox="0.00 0.00 110.00 93.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 89)">
<svg width="110pt" height="94pt"
viewBox="0.00 0.00 109.50 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_recursive_euclidean.cpp</title>
<!-- 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="#999999" stroke="#666666" points="102,-85 0,-85 0,-55 102,-55 102,-85"/>
<text text-anchor="start" x="8" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">math/gcd_recursive</text>
<text text-anchor="middle" x="51" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">_euclidean.cpp</text>
<polygon fill="#999999" stroke="#666666" points="101.5,-85.75 0,-85.75 0,-55.25 101.5,-55.25 101.5,-85.75"/>
<text text-anchor="start" x="8" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">math/gcd_recursive</text>
<text text-anchor="middle" x="50.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_euclidean.cpp</text>
</a>
</g>
</g>
@@ -22,16 +22,16 @@
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="78,-19 24,-19 24,0 78,0 78,-19"/>
<text text-anchor="middle" x="51" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
<polygon fill="#e0e0e0" stroke="#999999" points="77.5,-19.25 24,-19.25 24,0 77.5,0 77.5,-19.25"/>
<text text-anchor="middle" x="50.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">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="#63b8ff" d="M51,-54.54C51,-47.17 51,-38.1 51,-30.11"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="54.5,-30.18 51,-20.18 47.5,-30.18 54.5,-30.18"/>
<path fill="none" stroke="#63b8ff" d="M50.75,-54.95C50.75,-47.62 50.75,-38.62 50.75,-30.66"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="54.25,-30.7 50.75,-20.7 47.25,-30.7 54.25,-30.7"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.6 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB