backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-10 05:56:58 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for fddedd8864

Browse Source
This commit is contained in:
realstealthninja
2024-10-07 13:28:13 +00:00
parent 81ec715c16
commit e37aaa437e
62 changed files with 2565 additions and 1801 deletions
Download Patch File Download Diff File Expand all files Collapse all files

250
d1/d11/gcd__of__n__numbers_8cpp.html
View File

@@ -105,73 +105,193 @@ $(function(){initNavTree('d1/d11/gcd__of__n__numbers_8cpp.html','../../'); initR
<div class="header">
<div class="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">gcd_of_n_numbers.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>This program aims at calculating the GCD of n numbers by division method.
<p>This program aims at calculating the GCD of n numbers.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br />
<div class="textblock"><code>#include &lt;algorithm&gt;</code><br />
<code>#include &lt;array&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for gcd_of_n_numbers.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d7d/gcd__of__n__numbers_8cpp__incl.svg" width="200" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d7d/gcd__of__n__numbers_8cpp__incl.svg" width="344" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/ddb/namespacegcd__of__n__numbers.html">gcd_of_n_numbers</a></td></tr>
<tr class="memdesc:d2/ddb/namespacegcd__of__n__numbers"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute GCD of numbers in an array. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a25034543c20f271da04fb24ad2b2747a" id="r_a25034543c20f271da04fb24ad2b2747a"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a25034543c20f271da04fb24ad2b2747a">gcd</a> (int *a, int n)</td></tr>
<tr class="separator:a25034543c20f271da04fb24ad2b2747a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a509a35e11ed1e17a9e00dd56320a4181" id="r_a509a35e11ed1e17a9e00dd56320a4181"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a509a35e11ed1e17a9e00dd56320a4181">math::gcd_of_n_numbers::gcd_two</a> (int x, int y)</td></tr>
<tr class="memdesc:a509a35e11ed1e17a9e00dd56320a4181"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to compute GCD of 2 numbers x and y. <br /></td></tr>
<tr class="separator:a509a35e11ed1e17a9e00dd56320a4181"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a71b9357c7a722f8208499d9ba573297a" id="r_a71b9357c7a722f8208499d9ba573297a"><td class="memTemplParams" colspan="2">template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> n&gt; </td></tr>
<tr class="memitem:a71b9357c7a722f8208499d9ba573297a"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a71b9357c7a722f8208499d9ba573297a">math::gcd_of_n_numbers::check_all_zeros</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt; &amp;a)</td></tr>
<tr class="memdesc:a71b9357c7a722f8208499d9ba573297a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to check if all elements in the array are 0. <br /></td></tr>
<tr class="separator:a71b9357c7a722f8208499d9ba573297a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1161713c662a14c2d5e33504f4324532" id="r_a1161713c662a14c2d5e33504f4324532"><td class="memTemplParams" colspan="2">template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> n&gt; </td></tr>
<tr class="memitem:a1161713c662a14c2d5e33504f4324532"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt; &amp;a)</td></tr>
<tr class="memdesc:a1161713c662a14c2d5e33504f4324532"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main program to compute GCD using the Euclidean algorithm. <br /></td></tr>
<tr class="separator:a1161713c662a14c2d5e33504f4324532"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementation. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>This program aims at calculating the GCD of n numbers by division method. </p>
<div class="textblock"><p>This program aims at calculating the GCD of n numbers. </p>
<p>The GCD of n numbers can be calculated by repeatedly calculating the GCDs of pairs of numbers i.e. \(\gcd(a, b, c)\) = \(\gcd(\gcd(a, b), c)\) Euclidean algorithm helps calculate the GCD of each pair of numbers efficiently</p>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html" title="Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm">gcd_iterative_euclidean.cpp</a>, <a class="el" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html" title="Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm">gcd_recursive_euclidean.cpp</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a25034543c20f271da04fb24ad2b2747a" name="a25034543c20f271da04fb24ad2b2747a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a25034543c20f271da04fb24ad2b2747a">&#9670;&#160;</a></span>gcd()</h2>
<a id="a71b9357c7a722f8208499d9ba573297a" name="a71b9357c7a722f8208499d9ba573297a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a71b9357c7a722f8208499d9ba573297a">&#9670;&#160;</a></span>check_all_zeros()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> n&gt; </div>
<table class="memname">
<tr>
<td class="memname">bool math::gcd_of_n_numbers::check_all_zeros </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>a</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Function to check if all elements in the array are 0. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">a</td><td>Array of numbers </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>'True' if all elements are 0 </dd>
<dd>
'False' if not all elements are 0 </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 53</span> {</div>
<div class="line"><span class="lineno"> 54</span> <span class="comment">// Use std::all_of to simplify zero-checking</span></div>
<div class="line"><span class="lineno"> 55</span> <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html">std::all_of</a>(a.begin(), a.end(), [](<span class="keywordtype">int</span> x) { return x == 0; });</div>
<div class="line"><span class="lineno"> 56</span>}</div>
<div class="ttc" id="aall_any_none_of_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html">std::all_of</a></div><div class="ttdeci">T all_of(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.svg" width="306" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="a1161713c662a14c2d5e33504f4324532" name="a1161713c662a14c2d5e33504f4324532"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1161713c662a14c2d5e33504f4324532">&#9670;&#160;</a></span>gcd()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> n&gt; </div>
<table class="memname">
<tr>
<td class="memname">int math::gcd_of_n_numbers::gcd </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>a</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main program to compute GCD using the Euclidean algorithm. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">a</td><td>Array of integers to compute GCD for </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>GCD of the numbers in the array or std::nullopt if undefined </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 64</span> {</div>
<div class="line"><span class="lineno"> 65</span> <span class="comment">// GCD is undefined if all elements in the array are 0</span></div>
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a71b9357c7a722f8208499d9ba573297a">check_all_zeros</a>(a)) {</div>
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">return</span> -1; <span class="comment">// Use std::optional to represent undefined GCD</span></div>
<div class="line"><span class="lineno"> 68</span> }</div>
<div class="line"><span class="lineno"> 69</span> </div>
<div class="line"><span class="lineno"> 70</span> <span class="comment">// divisors can be negative, we only want the positive value</span></div>
<div class="line"><span class="lineno"> 71</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = std::abs(a[0]);</div>
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> i = 1; i &lt; n; ++i) {</div>
<div class="line"><span class="lineno"> 73</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="#a509a35e11ed1e17a9e00dd56320a4181">gcd_two</a>(result, std::abs(a[i]));</div>
<div class="line"><span class="lineno"> 74</span> <span class="keywordflow">if</span> (result == 1) {</div>
<div class="line"><span class="lineno"> 75</span> <span class="keywordflow">break</span>; <span class="comment">// Further computations still result in gcd of 1</span></div>
<div class="line"><span class="lineno"> 76</span> }</div>
<div class="line"><span class="lineno"> 77</span> }</div>
<div class="line"><span class="lineno"> 78</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 79</span>}</div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:76</div></div>
<div class="ttc" id="agcd__of__n__numbers_8cpp_html_a509a35e11ed1e17a9e00dd56320a4181"><div class="ttname"><a href="#a509a35e11ed1e17a9e00dd56320a4181">math::gcd_of_n_numbers::gcd_two</a></div><div class="ttdeci">int gcd_two(int x, int y)</div><div class="ttdoc">Function to compute GCD of 2 numbers x and y.</div><div class="ttdef"><b>Definition</b> gcd_of_n_numbers.cpp:35</div></div>
<div class="ttc" id="agcd__of__n__numbers_8cpp_html_a71b9357c7a722f8208499d9ba573297a"><div class="ttname"><a href="#a71b9357c7a722f8208499d9ba573297a">math::gcd_of_n_numbers::check_all_zeros</a></div><div class="ttdeci">bool check_all_zeros(const std::array&lt; int, n &gt; &amp;a)</div><div class="ttdoc">Function to check if all elements in the array are 0.</div><div class="ttdef"><b>Definition</b> gcd_of_n_numbers.cpp:53</div></div>
<div class="ttc" id="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.svg" width="551" height="215"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="a509a35e11ed1e17a9e00dd56320a4181" name="a509a35e11ed1e17a9e00dd56320a4181"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a509a35e11ed1e17a9e00dd56320a4181">&#9670;&#160;</a></span>gcd_two()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int gcd </td>
<td class="memname">int math::gcd_of_n_numbers::gcd_two </td>
<td>(</td>
<td class="paramtype">int *</td> <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>x</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>n</em></span>&#160;)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>y</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Compute GCD using division algorithm</p>
<p>Function to compute GCD of 2 numbers x and y. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">a</td><td>array of integers to compute GCD for </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">n</td><td>number of integers in array <code>a</code> </td></tr>
<tr><td class="paramname">x</td><td>First number </td></tr>
<tr><td class="paramname">y</td><td>Second number </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 15</span> {</div>
<div class="line"><span class="lineno"> 16</span> <span class="keywordtype">int</span> j = 1; <span class="comment">// to access all elements of the array starting from 1</span></div>
<div class="line"><span class="lineno"> 17</span> <span class="keywordtype">int</span> <a class="code hl_function" href="#a25034543c20f271da04fb24ad2b2747a">gcd</a> = a[0];</div>
<div class="line"><span class="lineno"> 18</span> <span class="keywordflow">while</span> (j &lt; n) {</div>
<div class="line"><span class="lineno"> 19</span> <span class="keywordflow">if</span> (a[j] % <a class="code hl_function" href="#a25034543c20f271da04fb24ad2b2747a">gcd</a> == 0) <span class="comment">// value of gcd is as needed so far</span></div>
<div class="line"><span class="lineno"> 20</span> j++; <span class="comment">// so we check for next element</span></div>
<div class="line"><span class="lineno"> 21</span> <span class="keywordflow">else</span></div>
<div class="line"><span class="lineno"> 22</span> <a class="code hl_function" href="#a25034543c20f271da04fb24ad2b2747a">gcd</a> = a[j] % <a class="code hl_function" href="#a25034543c20f271da04fb24ad2b2747a">gcd</a>; <span class="comment">// calculating GCD by division method</span></div>
<div class="line"><span class="lineno"> 23</span> }</div>
<div class="line"><span class="lineno"> 24</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a25034543c20f271da04fb24ad2b2747a">gcd</a>;</div>
<div class="line"><span class="lineno"> 25</span>}</div>
<div class="ttc" id="agcd__of__n__numbers_8cpp_html_a25034543c20f271da04fb24ad2b2747a"><div class="ttname"><a href="#a25034543c20f271da04fb24ad2b2747a">gcd</a></div><div class="ttdeci">int gcd(int *a, int n)</div><div class="ttdef"><b>Definition</b> gcd_of_n_numbers.cpp:15</div></div>
<dl class="section return"><dt>Returns</dt><dd>GCD of x and y via recursion </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 35</span> {</div>
<div class="line"><span class="lineno"> 36</span> <span class="comment">// base cases</span></div>
<div class="line"><span class="lineno"> 37</span> <span class="keywordflow">if</span> (y == 0) {</div>
<div class="line"><span class="lineno"> 38</span> <span class="keywordflow">return</span> x;</div>
<div class="line"><span class="lineno"> 39</span> }</div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">if</span> (x == 0) {</div>
<div class="line"><span class="lineno"> 41</span> <span class="keywordflow">return</span> y;</div>
<div class="line"><span class="lineno"> 42</span> }</div>
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a509a35e11ed1e17a9e00dd56320a4181">gcd_two</a>(y, x % y); <span class="comment">// Euclidean method</span></div>
<div class="line"><span class="lineno"> 44</span>}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d11/gcd__of__n__numbers_8cpp_a25034543c20f271da04fb24ad2b2747a_cgraph.svg" width="54" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.svg" width="179" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -190,30 +310,68 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p>Main function </p>
<div class="fragment"><div class="line"><span class="lineno"> 28</span> {</div>
<div class="line"><span class="lineno"> 29</span> <span class="keywordtype">int</span> n;</div>
<div class="line"><span class="lineno"> 30</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter value of n:&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 31</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
<div class="line"><span class="lineno"> 32</span> <span class="keywordtype">int</span> *a = <span class="keyword">new</span> <span class="keywordtype">int</span>[n];</div>
<div class="line"><span class="lineno"> 33</span> <span class="keywordtype">int</span> i;</div>
<div class="line"><span class="lineno"> 34</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the n numbers:&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 35</span> <span class="keywordflow">for</span> (i = 0; i &lt; n; i++) std::cin &gt;&gt; a[i];</div>
<div class="line"><span class="lineno"> 36</span> </div>
<div class="line"><span class="lineno"> 37</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;GCD of entered n numbers:&quot;</span> &lt;&lt; <a class="code hl_function" href="#a25034543c20f271da04fb24ad2b2747a">gcd</a>(a, n) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 38</span> </div>
<div class="line"><span class="lineno"> 39</span> <span class="keyword">delete</span>[] a;</div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 41</span>}</div>
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 111</span> {</div>
<div class="line"><span class="lineno"> 112</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementation</span></div>
<div class="line"><span class="lineno"> 113</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 114</span>}</div>
<div class="ttc" id="agcd__of__n__numbers_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> gcd_of_n_numbers.cpp:87</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="180" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&#160;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Self-test implementation. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 87</span> {</div>
<div class="line"><span class="lineno"> 88</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 1&gt;</a> array_1 = {0};</div>
<div class="line"><span class="lineno"> 89</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 1&gt;</a> array_2 = {1};</div>
<div class="line"><span class="lineno"> 90</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 2&gt;</a> array_3 = {0, 2};</div>
<div class="line"><span class="lineno"> 91</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 3&gt;</a> array_4 = {-60, 24, 18};</div>
<div class="line"><span class="lineno"> 92</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 4&gt;</a> array_5 = {100, -100, -100, 200};</div>
<div class="line"><span class="lineno"> 93</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 5&gt;</a> array_6 = {0, 0, 0, 0, 0};</div>
<div class="line"><span class="lineno"> 94</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 7&gt;</a> array_7 = {10350, -24150, 0, 17250, 37950, -127650, 51750};</div>
<div class="line"><span class="lineno"> 95</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 7&gt;</a> array_8 = {9500000, -12121200, 0, 4444, 0, 0, 123456789};</div>
<div class="line"><span class="lineno"> 96</span> </div>
<div class="line"><span class="lineno"> 97</span> assert(math::gcd_of_n_numbers::gcd(array_1) == -1);</div>
<div class="line"><span class="lineno"> 98</span> assert(math::gcd_of_n_numbers::gcd(array_2) == 1);</div>
<div class="line"><span class="lineno"> 99</span> assert(math::gcd_of_n_numbers::gcd(array_3) == 2);</div>
<div class="line"><span class="lineno"> 100</span> assert(math::gcd_of_n_numbers::gcd(array_4) == 6);</div>
<div class="line"><span class="lineno"> 101</span> assert(math::gcd_of_n_numbers::gcd(array_5) == 100);</div>
<div class="line"><span class="lineno"> 102</span> assert(math::gcd_of_n_numbers::gcd(array_6) == -1);</div>
<div class="line"><span class="lineno"> 103</span> assert(math::gcd_of_n_numbers::gcd(array_7) == 3450);</div>
<div class="line"><span class="lineno"> 104</span> assert(math::gcd_of_n_numbers::gcd(array_8) == 1);</div>
<div class="line"><span class="lineno"> 105</span>}</div>
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->

7
d1/d11/gcd__of__n__numbers_8cpp.js
View File

@@ -1,5 +1,8 @@
var gcd__of__n__numbers_8cpp =
[
[ "gcd", "d1/d11/gcd__of__n__numbers_8cpp.html#a25034543c20f271da04fb24ad2b2747a", null ],
[ "main", "d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ]
[ "check_all_zeros", "d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a", null ],
[ "gcd", "d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532", null ],
[ "gcd_two", "d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181", null ],
[ "main", "d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "test", "d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
];

13
d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.map Normal file
View File

@@ -0,0 +1,13 @@
<map id="math::gcd_of_n_numbers::gcd" name="math::gcd_of_n_numbers::gcd">
<area shape="rect" id="Node000001" title="Main program to compute GCD using the Euclidean algorithm." alt="" coords="5,94,203,120"/>
<area shape="rect" id="Node000002" href="$d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a" title="Function to check if all elements in the array are 0." alt="" coords="251,29,419,70"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,91,235,72,237,77,159,96"/>
<area shape="rect" id="Node000004" href="$d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" title=" " alt="" coords="314,94,356,120"/>
<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="203,104,298,104,298,110,203,110"/>
<area shape="rect" id="Node000005" href="$d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181" title="Function to compute GCD of 2 numbers x and y." alt="" coords="251,168,419,209"/>
<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="144,118,262,160,260,165,142,123"/>
<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="302,29,300,19,306,11,317,5,335,3,354,5,365,11,362,16,352,10,335,8,319,10,309,14,306,20,307,28"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/all_any_none_of.html#" title=" " alt="" coords="467,37,545,62"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="420,47,451,47,451,52,420,52"/>
<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="302,168,300,158,306,149,317,143,335,141,354,144,365,150,362,155,352,149,335,147,319,149,309,153,306,159,307,167"/>
</map>

1
d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
e454534349e06eb6e0e4fdb784b4affd

139
d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.svg Normal file
View File

@@ -0,0 +1,139 @@
<?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 12.1.1 (20240910.0053)
-->
<!-- Title: math::gcd_of_n_numbers::gcd Pages: 1 -->
<svg width="413pt" height="161pt"
viewBox="0.00 0.00 413.00 160.50" 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 156.5)">
<title>math::gcd_of_n_numbers::gcd</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main program to compute GCD using the Euclidean algorithm.">
<polygon fill="#999999" stroke="#666666" points="148,-85.88 0,-85.88 0,-66.62 148,-66.62 148,-85.88"/>
<text text-anchor="middle" x="74" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers::gcd</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a" target="_top" xlink:title="Function to check if all elements in the array are 0.">
<polygon fill="white" stroke="#666666" points="310.25,-134.5 184,-134.5 184,-104 310.25,-104 310.25,-134.5"/>
<text text-anchor="start" x="192" y="-121" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers</text>
<text text-anchor="middle" x="247.12" y="-109.75" font-family="Helvetica,sans-Serif" font-size="10.00">::check_all_zeros</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="M115.12,-86.33C132.38,-90.67 153.1,-95.88 172.92,-100.86"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="171.8,-104.18 182.35,-103.22 173.5,-97.39 171.8,-104.18"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="263,-85.88 231.25,-85.88 231.25,-66.62 263,-66.62 263,-85.88"/>
<text text-anchor="middle" x="247.12" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge4_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M148.07,-76.25C173.41,-76.25 200.24,-76.25 219.41,-76.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="219.31,-79.75 229.31,-76.25 219.31,-72.75 219.31,-79.75"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181" target="_top" xlink:title="Function to compute GCD of 2 numbers x and y.">
<polygon fill="white" stroke="#666666" points="310.25,-30.5 184,-30.5 184,0 310.25,0 310.25,-30.5"/>
<text text-anchor="start" x="192" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers</text>
<text text-anchor="middle" x="247.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::gcd_two</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge5_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M103.26,-66.18C127.18,-57.65 162.18,-45.17 191.54,-34.71"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="192.4,-38.12 200.65,-31.46 190.05,-31.52 192.4,-38.12"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge3_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M224.35,-134.99C219.71,-144.06 227.3,-152.5 247.12,-152.5 257.97,-152.5 265.15,-149.97 268.67,-146.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="272.13,-146.81 269.73,-136.49 265.17,-146.05 272.13,-146.81"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="405,-128.88 346.25,-128.88 346.25,-109.62 405,-109.62 405,-128.88"/>
<text text-anchor="middle" x="375.62" y="-115.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M310.63,-119.25C318.72,-119.25 326.83,-119.25 334.42,-119.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="334.33,-122.75 344.33,-119.25 334.33,-115.75 334.33,-122.75"/>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node5 -->
<g id="edge6_Node000005_Node000005" class="edge">
<title>Node5&#45;&gt;Node5</title>
<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M224.35,-30.99C219.71,-40.06 227.3,-48.5 247.12,-48.5 257.97,-48.5 265.15,-45.97 268.67,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="272.13,-42.81 269.73,-32.49 265.17,-42.05 272.13,-42.81"/>
</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

After

Width:  |  Height:  |  Size: 6.2 KiB

113
d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph_org.svg Normal file
View File

@@ -0,0 +1,113 @@
<?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 12.1.1 (20240910.0053)
-->
<!-- Title: math::gcd_of_n_numbers::gcd Pages: 1 -->
<svg width="413pt" height="161pt"
viewBox="0.00 0.00 413.00 160.50" 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 156.5)">
<title>math::gcd_of_n_numbers::gcd</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main program to compute GCD using the Euclidean algorithm.">
<polygon fill="#999999" stroke="#666666" points="148,-85.88 0,-85.88 0,-66.62 148,-66.62 148,-85.88"/>
<text text-anchor="middle" x="74" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers::gcd</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a" target="_top" xlink:title="Function to check if all elements in the array are 0.">
<polygon fill="white" stroke="#666666" points="310.25,-134.5 184,-134.5 184,-104 310.25,-104 310.25,-134.5"/>
<text text-anchor="start" x="192" y="-121" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers</text>
<text text-anchor="middle" x="247.12" y="-109.75" font-family="Helvetica,sans-Serif" font-size="10.00">::check_all_zeros</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="M115.12,-86.33C132.38,-90.67 153.1,-95.88 172.92,-100.86"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="171.8,-104.18 182.35,-103.22 173.5,-97.39 171.8,-104.18"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="263,-85.88 231.25,-85.88 231.25,-66.62 263,-66.62 263,-85.88"/>
<text text-anchor="middle" x="247.12" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge4_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M148.07,-76.25C173.41,-76.25 200.24,-76.25 219.41,-76.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="219.31,-79.75 229.31,-76.25 219.31,-72.75 219.31,-79.75"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181" target="_top" xlink:title="Function to compute GCD of 2 numbers x and y.">
<polygon fill="white" stroke="#666666" points="310.25,-30.5 184,-30.5 184,0 310.25,0 310.25,-30.5"/>
<text text-anchor="start" x="192" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers</text>
<text text-anchor="middle" x="247.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::gcd_two</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge5_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M103.26,-66.18C127.18,-57.65 162.18,-45.17 191.54,-34.71"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="192.4,-38.12 200.65,-31.46 190.05,-31.52 192.4,-38.12"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge3_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M224.35,-134.99C219.71,-144.06 227.3,-152.5 247.12,-152.5 257.97,-152.5 265.15,-149.97 268.67,-146.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="272.13,-146.81 269.73,-136.49 265.17,-146.05 272.13,-146.81"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="405,-128.88 346.25,-128.88 346.25,-109.62 405,-109.62 405,-128.88"/>
<text text-anchor="middle" x="375.62" y="-115.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M310.63,-119.25C318.72,-119.25 326.83,-119.25 334.42,-119.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="334.33,-122.75 344.33,-119.25 334.33,-115.75 334.33,-122.75"/>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node5 -->
<g id="edge6_Node000005_Node000005" class="edge">
<title>Node5&#45;&gt;Node5</title>
<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M224.35,-30.99C219.71,-40.06 227.3,-48.5 247.12,-48.5 257.97,-48.5 265.15,-45.97 268.67,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="272.13,-42.81 269.73,-32.49 265.17,-42.05 272.13,-42.81"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 5.5 KiB

4
d1/d11/gcd__of__n__numbers_8cpp_a25034543c20f271da04fb24ad2b2747a_cgraph.map
View File

@@ -1,4 +0,0 @@
<map id="gcd" name="gcd">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,48,55"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="17,29,17,12,20,5,27,3,33,6,36,13,31,15,29,10,26,8,24,9,22,13,23,29"/>
</map>

1
d1/d11/gcd__of__n__numbers_8cpp_a25034543c20f271da04fb24ad2b2747a_cgraph.md5
View File

@@ -1 +0,0 @@
b8b5505663d8370c4619b70f19abe443

30
d1/d11/gcd__of__n__numbers_8cpp_a25034543c20f271da04fb24ad2b2747a_cgraph_org.svg
View File

@@ -1,30 +0,0 @@
<?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 12.1.1 (20240910.0053)
-->
<!-- Title: gcd Pages: 1 -->
<svg width="40pt" height="45pt"
viewBox="0.00 0.00 39.75 45.25" 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 41.25)">
<title>gcd</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="31.75,-19.25 0,-19.25 0,0 31.75,0 31.75,-19.25"/>
<text text-anchor="middle" x="15.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M10.9,-19.54C8.64,-28.15 10.29,-37.25 15.88,-37.25 18.84,-37.25 20.7,-34.68 21.45,-30.98"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="24.95,-30.85 20.93,-21.05 17.96,-31.22 24.95,-30.85"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 1.2 KiB

4
d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="math::gcd_of_n_numbers::gcd_two" name="math::gcd_of_n_numbers::gcd_two">
<area shape="rect" id="Node000001" title="Function to compute GCD of 2 numbers x and y." alt="" coords="5,29,174,70"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="57,29,55,19,61,11,72,5,90,3,108,5,119,11,116,16,106,10,89,8,74,10,64,14,61,20,62,28"/>
</map>

1
d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
cba8ff70dc5185b7faf5895b4158a1de

21
d1/d11/gcd__of__n__numbers_8cpp_a25034543c20f271da04fb24ad2b2747a_cgraph.svg → d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.svg
View File

@@ -3,9 +3,9 @@
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- Title: gcd Pages: 1 -->
<svg width="40pt" height="45pt"
viewBox="0.00 0.00 39.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<!-- Title: math::gcd_of_n_numbers::gcd_two Pages: 1 -->
<svg width="134pt" height="57pt"
viewBox="0.00 0.00 134.25 56.50" 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">
@@ -17,14 +17,15 @@
]]></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 41.25)">
<title>gcd</title>
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>math::gcd_of_n_numbers::gcd_two</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="31.75,-19.25 0,-19.25 0,0 31.75,0 31.75,-19.25"/>
<text text-anchor="middle" x="15.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
<g id="a_Node000001"><a xlink:title="Function to compute GCD of 2 numbers x and y.">
<polygon fill="#999999" stroke="#666666" points="126.25,-30.5 0,-30.5 0,0 126.25,0 126.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers</text>
<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::gcd_two</text>
</a>
</g>
</g>
@@ -32,8 +33,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M10.9,-19.54C8.64,-28.15 10.29,-37.25 15.88,-37.25 18.84,-37.25 20.7,-34.68 21.45,-30.98"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="24.95,-30.85 20.93,-21.05 17.96,-31.22 24.95,-30.85"/>
<path fill="none" stroke="#63b8ff" d="M40.75,-30.99C36.19,-40.06 43.65,-48.5 63.12,-48.5 73.78,-48.5 80.84,-45.97 84.3,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.75,-42.81 85.34,-32.49 80.79,-42.06 87.75,-42.81"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.0 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

31
d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph_org.svg Normal file
View File

@@ -0,0 +1,31 @@
<?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 12.1.1 (20240910.0053)
-->
<!-- Title: math::gcd_of_n_numbers::gcd_two Pages: 1 -->
<svg width="134pt" height="57pt"
viewBox="0.00 0.00 134.25 56.50" 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 52.5)">
<title>math::gcd_of_n_numbers::gcd_two</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Function to compute GCD of 2 numbers x and y.">
<polygon fill="#999999" stroke="#666666" points="126.25,-30.5 0,-30.5 0,0 126.25,0 126.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers</text>
<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::gcd_two</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M40.75,-30.99C36.19,-40.06 43.65,-48.5 63.12,-48.5 73.78,-48.5 80.84,-45.97 84.3,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.75,-42.81 85.34,-32.49 80.79,-42.06 87.75,-42.81"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.5 KiB

6
d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.map Normal file
View File

@@ -0,0 +1,6 @@
<map id="math::gcd_of_n_numbers::check_all_zeros" name="math::gcd_of_n_numbers::check_all_zeros">
<area shape="rect" id="Node000001" title="Function to check if all elements in the array are 0." alt="" coords="5,29,174,70"/>
<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="57,29,55,19,60,11,72,5,90,3,108,5,120,11,117,16,107,10,89,8,73,10,64,14,60,20,62,28"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/all_any_none_of.html#" title=" " alt="" coords="222,37,300,62"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="174,47,206,47,206,52,174,52"/>
</map>

1
d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
390c2e580c1cd1e67189e4c5eb8d042a

75
d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.svg Normal file
View File

@@ -0,0 +1,75 @@
<?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 12.1.1 (20240910.0053)
-->
<!-- Title: math::gcd_of_n_numbers::check_all_zeros Pages: 1 -->
<svg width="229pt" height="57pt"
viewBox="0.00 0.00 229.00 56.50" 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 52.5)">
<title>math::gcd_of_n_numbers::check_all_zeros</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Function to check if all elements in the array are 0.">
<polygon fill="#999999" stroke="#666666" points="126.25,-30.5 0,-30.5 0,0 126.25,0 126.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers</text>
<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::check_all_zeros</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge2_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M40.35,-30.99C35.71,-40.06 43.3,-48.5 63.12,-48.5 73.97,-48.5 81.15,-45.97 84.67,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.13,-42.81 85.73,-32.49 81.17,-42.05 88.13,-42.81"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="221,-24.88 162.25,-24.88 162.25,-5.63 221,-5.63 221,-24.88"/>
<text text-anchor="middle" x="191.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</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="M126.63,-15.25C134.72,-15.25 142.83,-15.25 150.42,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="150.33,-18.75 160.33,-15.25 150.33,-11.75 150.33,-18.75"/>
</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

After

Width:  |  Height:  |  Size: 3.1 KiB

49
d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph_org.svg Normal file
View File

@@ -0,0 +1,49 @@
<?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 12.1.1 (20240910.0053)
-->
<!-- Title: math::gcd_of_n_numbers::check_all_zeros Pages: 1 -->
<svg width="229pt" height="57pt"
viewBox="0.00 0.00 229.00 56.50" 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 52.5)">
<title>math::gcd_of_n_numbers::check_all_zeros</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Function to check if all elements in the array are 0.">
<polygon fill="#999999" stroke="#666666" points="126.25,-30.5 0,-30.5 0,0 126.25,0 126.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers</text>
<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::check_all_zeros</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge2_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M40.35,-30.99C35.71,-40.06 43.3,-48.5 63.12,-48.5 73.97,-48.5 81.15,-45.97 84.67,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.13,-42.81 85.73,-32.49 81.17,-42.05 88.13,-42.81"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="221,-24.88 162.25,-24.88 162.25,-5.63 221,-5.63 221,-24.88"/>
<text text-anchor="middle" x="191.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</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="M126.63,-15.25C134.72,-15.25 142.83,-15.25 150.42,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="150.33,-18.75 160.33,-15.25 150.33,-11.75 150.33,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.3 KiB

9
d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -1,8 +1,5 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,43,55,68"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,45,87,33,89,38,56,50"/>
<area shape="rect" id="Node000003" href="$d1/d11/gcd__of__n__numbers_8cpp.html#a25034543c20f271da04fb24ad2b2747a" title=" " alt="" coords="117,79,160,104"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,61,103,77,101,82,54,66"/>
<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="119,79,115,70,118,61,125,54,138,52,152,55,159,62,156,65,150,59,138,57,128,59,122,64,121,70,124,77"/>
<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
<area shape="rect" id="Node000002" href="$d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementation." alt="" coords="103,5,146,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
</map>

2
d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +1 @@
23bd5a5f2fd026582d5795668b1d7a60
c6e7f6d13bdecb1abd6b393342788302

49
d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- Title: main Pages: 1 -->
<svg width="135pt" height="82pt"
viewBox="0.00 0.00 134.50 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="114pt" height="27pt"
viewBox="0.00 0.00 113.50 27.25" 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">
@@ -17,23 +17,23 @@
]]></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 78.25)">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="37,-46.25 0,-46.25 0,-27 37,-27 37,-46.25"/>
<text text-anchor="middle" x="18.5" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="126.5,-74.25 73,-74.25 73,-55 126.5,-55 126.5,-74.25"/>
<text text-anchor="middle" x="99.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<g id="a_Node000002"><a xlink:href="../../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementation.">
<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
@@ -41,35 +41,8 @@
<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="M37.48,-42.98C44.8,-45.57 53.55,-48.65 62.1,-51.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="60.7,-54.89 71.29,-54.92 63.03,-48.29 60.7,-54.89"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a25034543c20f271da04fb24ad2b2747a" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="115.62,-19.25 83.88,-19.25 83.88,0 115.62,0 115.62,-19.25"/>
<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</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="M37.48,-30.5C47.9,-26.95 61.18,-22.42 72.72,-18.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.74,-21.84 82.07,-15.31 71.48,-15.22 73.74,-21.84"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge3_Node000003_Node000003" class="edge">
<title>Node3&#45;&gt;Node3</title>
<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M87.03,-19.54C81.23,-28.15 85.47,-37.25 99.75,-37.25 107.56,-37.25 112.37,-34.53 114.17,-30.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="117.67,-30.39 112.7,-21.03 110.75,-31.45 117.67,-30.39"/>
<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.6 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

49
d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
View File

@@ -4,25 +4,25 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- Title: main Pages: 1 -->
<svg width="135pt" height="82pt"
viewBox="0.00 0.00 134.50 82.25" 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 78.25)">
<svg width="114pt" height="27pt"
viewBox="0.00 0.00 113.50 27.25" 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 23.25)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="37,-46.25 0,-46.25 0,-27 37,-27 37,-46.25"/>
<text text-anchor="middle" x="18.5" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="126.5,-74.25 73,-74.25 73,-55 126.5,-55 126.5,-74.25"/>
<text text-anchor="middle" x="99.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<g id="a_Node000002"><a xlink:href="../../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementation.">
<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
@@ -30,35 +30,8 @@
<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="M37.48,-42.98C44.8,-45.57 53.55,-48.65 62.1,-51.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="60.7,-54.89 71.29,-54.92 63.03,-48.29 60.7,-54.89"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a25034543c20f271da04fb24ad2b2747a" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="115.62,-19.25 83.88,-19.25 83.88,0 115.62,0 115.62,-19.25"/>
<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</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="M37.48,-30.5C47.9,-26.95 61.18,-22.42 72.72,-18.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.74,-21.84 82.07,-15.31 71.48,-15.22 73.74,-21.84"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge3_Node000003_Node000003" class="edge">
<title>Node3&#45;&gt;Node3</title>
<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M87.03,-19.54C81.23,-28.15 85.47,-37.25 99.75,-37.25 107.56,-37.25 112.37,-34.53 114.17,-30.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="117.67,-30.39 112.7,-21.03 110.75,-31.45 117.67,-30.39"/>
<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.8 KiB

After

Width:  |  Height:  |  Size: 1.6 KiB

12
d1/d7d/gcd__of__n__numbers_8cpp__incl.map
View File

@@ -1,5 +1,11 @@
<map id="math/gcd_of_n_numbers.cpp" name="math/gcd_of_n_numbers.cpp">
<area shape="rect" id="Node000001" title="This program aims at calculating the GCD of n numbers by division method." alt="" coords="5,5,195,31"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="64,79,136,105"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="103,31,103,63,97,63,97,31"/>
<area shape="rect" id="Node000001" title="This program aims at calculating the GCD of n numbers." alt="" coords="74,5,264,31"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,79,80,105"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="149,34,78,73,76,69,146,29"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="104,79,154,105"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="165,33,146,67,141,64,160,30"/>
<area shape="rect" id="Node000004" title=" " alt="" coords="178,79,243,105"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="178,30,198,64,194,67,174,33"/>
<area shape="rect" id="Node000005" title=" " alt="" coords="267,79,338,105"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="193,29,268,69,265,74,191,34"/>
</map>

2
d1/d7d/gcd__of__n__numbers_8cpp__incl.md5
View File

@@ -1 +1 @@
61550a80843a5c941a4633af278ace82
31e596acc14c7c7c7aa9eb1eed48b503

72
d1/d7d/gcd__of__n__numbers_8cpp__incl.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- Title: math/gcd_of_n_numbers.cpp Pages: 1 -->
<svg width="150pt" height="83pt"
viewBox="0.00 0.00 150.00 82.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="258pt" height="83pt"
viewBox="0.00 0.00 257.62 82.50" 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">
@@ -22,9 +22,9 @@
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="This program aims at calculating the GCD of n numbers by division method.">
<polygon fill="#999999" stroke="#666666" points="142,-74.5 0,-74.5 0,-55.25 142,-55.25 142,-74.5"/>
<text text-anchor="middle" x="71" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">math/gcd_of_n_numbers.cpp</text>
<g id="a_Node000001"><a xlink:title="This program aims at calculating the GCD of n numbers.">
<polygon fill="#999999" stroke="#666666" points="193.88,-74.5 51.88,-74.5 51.88,-55.25 193.88,-55.25 193.88,-74.5"/>
<text text-anchor="middle" x="122.88" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">math/gcd_of_n_numbers.cpp</text>
</a>
</g>
</g>
@@ -32,8 +32,8 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="97.75,-19.25 44.25,-19.25 44.25,0 97.75,0 97.75,-19.25"/>
<text text-anchor="middle" x="71" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
<polygon fill="#e0e0e0" stroke="#999999" points="55.75,-19.25 0,-19.25 0,0 55.75,0 55.75,-19.25"/>
<text text-anchor="middle" x="27.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text>
</a>
</g>
</g>
@@ -41,8 +41,62 @@
<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="M71,-55.08C71,-48.57 71,-39.42 71,-31.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="74.5,-31.12 71,-21.12 67.5,-31.12 74.5,-31.12"/>
<path fill="none" stroke="#63b8ff" d="M106.76,-54.84C92.29,-46.73 70.8,-34.68 53.89,-25.21"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="55.82,-22.28 45.39,-20.44 52.4,-28.39 55.82,-22.28"/>
</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="111.75,-19.25 74,-19.25 74,0 111.75,0 111.75,-19.25"/>
<text text-anchor="middle" x="92.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">array</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="M117.92,-55.08C113.99,-48.11 108.36,-38.12 103.44,-29.37"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="106.64,-27.92 98.68,-20.93 100.54,-31.36 106.64,-27.92"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="178,-19.25 129.75,-19.25 129.75,0 178,0 178,-19.25"/>
<text text-anchor="middle" x="153.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M127.99,-55.08C132.05,-48.11 137.87,-38.12 142.96,-29.37"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="145.88,-31.32 147.88,-20.92 139.83,-27.8 145.88,-31.32"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="249.62,-19.25 196.12,-19.25 196.12,0 249.62,0 249.62,-19.25"/>
<text text-anchor="middle" x="222.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M139.84,-54.84C155.14,-46.69 177.91,-34.57 195.74,-25.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="197.31,-28.2 204.49,-20.41 194.02,-22.02 197.31,-28.2"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 4.6 KiB

72
d1/d7d/gcd__of__n__numbers_8cpp__incl_org.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- Title: math/gcd_of_n_numbers.cpp Pages: 1 -->
<svg width="150pt" height="83pt"
viewBox="0.00 0.00 150.00 82.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="258pt" height="83pt"
viewBox="0.00 0.00 257.62 82.50" 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 78.5)">
<title>math/gcd_of_n_numbers.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="This program aims at calculating the GCD of n numbers by division method.">
<polygon fill="#999999" stroke="#666666" points="142,-74.5 0,-74.5 0,-55.25 142,-55.25 142,-74.5"/>
<text text-anchor="middle" x="71" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">math/gcd_of_n_numbers.cpp</text>
<g id="a_Node000001"><a xlink:title="This program aims at calculating the GCD of n numbers.">
<polygon fill="#999999" stroke="#666666" points="193.88,-74.5 51.88,-74.5 51.88,-55.25 193.88,-55.25 193.88,-74.5"/>
<text text-anchor="middle" x="122.88" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">math/gcd_of_n_numbers.cpp</text>
</a>
</g>
</g>
@@ -21,8 +21,8 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="97.75,-19.25 44.25,-19.25 44.25,0 97.75,0 97.75,-19.25"/>
<text text-anchor="middle" x="71" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
<polygon fill="#e0e0e0" stroke="#999999" points="55.75,-19.25 0,-19.25 0,0 55.75,0 55.75,-19.25"/>
<text text-anchor="middle" x="27.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text>
</a>
</g>
</g>
@@ -30,8 +30,62 @@
<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="M71,-55.08C71,-48.57 71,-39.42 71,-31.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="74.5,-31.12 71,-21.12 67.5,-31.12 74.5,-31.12"/>
<path fill="none" stroke="#63b8ff" d="M106.76,-54.84C92.29,-46.73 70.8,-34.68 53.89,-25.21"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="55.82,-22.28 45.39,-20.44 52.4,-28.39 55.82,-22.28"/>
</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="111.75,-19.25 74,-19.25 74,0 111.75,0 111.75,-19.25"/>
<text text-anchor="middle" x="92.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">array</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="M117.92,-55.08C113.99,-48.11 108.36,-38.12 103.44,-29.37"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="106.64,-27.92 98.68,-20.93 100.54,-31.36 106.64,-27.92"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="178,-19.25 129.75,-19.25 129.75,0 178,0 178,-19.25"/>
<text text-anchor="middle" x="153.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M127.99,-55.08C132.05,-48.11 137.87,-38.12 142.96,-29.37"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="145.88,-31.32 147.88,-20.92 139.83,-27.8 145.88,-31.32"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="249.62,-19.25 196.12,-19.25 196.12,0 249.62,0 249.62,-19.25"/>
<text text-anchor="middle" x="222.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M139.84,-54.84C155.14,-46.69 177.91,-34.57 195.74,-25.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="197.31,-28.2 204.49,-20.41 194.02,-22.02 197.31,-28.2"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.6 KiB

After

Width:  |  Height:  |  Size: 3.8 KiB