backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-24 02:23:10 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for fb27d4d304

Browse Source
This commit is contained in:
realstealthninja
2025-08-15 03:54:34 +00:00
parent e364889a34
commit 175d83c764
1053 changed files with 1604 additions and 1820 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
d9/d0e/brent__method__extrema_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: numerical_methods/brent_method_extrema.cpp Pages: 1 -->
<svg width="386pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.4 KiB

After

Width:  |  Height:  |  Size: 6.4 KiB

2
d9/d0e/brent__method__extrema_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: numerical_methods/brent_method_extrema.cpp Pages: 1 -->
<svg width="386pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.6 KiB

After

Width:  |  Height:  |  Size: 5.6 KiB

2
d9/d0f/n__queens__all__solution__optimised_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: backtracking/n_queens_all_solution_optimised.cpp Pages: 1 -->
<svg width="144pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

2
d9/d0f/n__queens__all__solution__optimised_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: backtracking/n_queens_all_solution_optimised.cpp Pages: 1 -->
<svg width="144pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.6 KiB

After

Width:  |  Height:  |  Size: 2.6 KiB

2
d9/d31/recursive__bubble__sort_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: sorting/recursive_bubble_sort.cpp Pages: 1 -->
<svg width="325pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.6 KiB

After

Width:  |  Height:  |  Size: 5.6 KiB

2
d9/d31/recursive__bubble__sort_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: sorting/recursive_bubble_sort.cpp Pages: 1 -->
<svg width="325pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.8 KiB

After

Width:  |  Height:  |  Size: 4.8 KiB

2
d9/d33/quick__sort__iterative_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: sorting/quick_sort_iterative.cpp Pages: 1 -->
<svg width="321pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.6 KiB

After

Width:  |  Height:  |  Size: 5.6 KiB

2
d9/d33/quick__sort__iterative_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: sorting/quick_sort_iterative.cpp Pages: 1 -->
<svg width="321pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.9 KiB

After

Width:  |  Height:  |  Size: 4.9 KiB

35
d9/d37/inverse__fast__fourier__transform_8cpp.html
View File

@@ -144,8 +144,8 @@ Functions</h2></td></tr>
<tr class="memdesc:aee56dc85997b8cd42bad71a5d6bd2d93"><td class="mdescLeft">&#160;</td><td class="mdescRight">InverseFastFourierTransform is a recursive function which returns list of complex numbers. <br /></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 implementations. <br /></td></tr>
<tr class="memitem:abf9e6b7e6f15df4b525a2e7705ba3089" id="r_abf9e6b7e6f15df4b525a2e7705ba3089"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abf9e6b7e6f15df4b525a2e7705ba3089">main</a> (int argc, char const *argv[])</td></tr>
<tr class="memdesc:abf9e6b7e6f15df4b525a2e7705ba3089"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></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 calls automated test function to test the working of fast fourier transform. <br /></td></tr>
</table>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a href="https://www.geeksforgeeks.org/python-inverse-fast-fourier-transformation/" target="_blank">An inverse fast Fourier transform (IFFT)</a> is an algorithm that computes the inverse fourier transform. </p>
@@ -153,8 +153,8 @@ Functions</h2></td></tr>
<p class="definition">Definition in file <a class="el" href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html">inverse_fast_fourier_transform.cpp</a>.</p>
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
<a id="abf9e6b7e6f15df4b525a2e7705ba3089" name="abf9e6b7e6f15df4b525a2e7705ba3089"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abf9e6b7e6f15df4b525a2e7705ba3089">&#9670;&#160;</a></span>main()</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
@@ -162,32 +162,21 @@ Functions</h2></td></tr>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>argc</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
<td class="paramtype">char const *</td> <td class="paramname"><span class="paramname"><em>argv</em></span>[]&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">argc</td><td>commandline argument count (ignored) </td></tr>
<tr><td class="paramname">argv</td><td>commandline array of arguments (ignored) calls automated test function to test the working of fast fourier transform. </td></tr>
</table>
</dd>
</dl>
<p>Main function calls automated test function to test the working of fast fourier transform. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html#l00157">157</a> of file <a class="el" href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html">inverse_fast_fourier_transform.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 157</span> {</div>
<div class="line"><span class="lineno"> 158</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 159</span> <span class="comment">// with 2 defined test cases</span></div>
<div class="line"><span class="lineno"> 160</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 161</span>}</div>
<p class="definition">Definition at line <a class="el" href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html#l00155">155</a> of file <a class="el" href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html">inverse_fast_fourier_transform.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 155</span> {</div>
<div class="line"><span class="lineno"> 156</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 157</span> <span class="comment">// with 2 defined test cases</span></div>
<div class="line"><span class="lineno"> 158</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 159</span>}</div>
<div class="ttc" id="ainverse__fast__fourier__transform_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html#l00101">inverse_fast_fourier_transform.cpp:101</a></div></div>
</div><!-- fragment -->
</div>

2
d9/d37/inverse__fast__fourier__transform_8cpp.js vendored
View File

@@ -1,6 +1,6 @@
var inverse__fast__fourier__transform_8cpp =
[
[ "numerical_methods::InverseFastFourierTransform", "d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93", null ],
[ "main", "d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089", null ],
[ "main", "d9/d37/inverse__fast__fourier__transform_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "test", "d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
];

16
d9/d37/inverse__fast__fourier__transform_8cpp_source.html
View File

@@ -236,16 +236,16 @@ $(function(){initNavTree('d9/d37/inverse__fast__fourier__transform_8cpp_source.h
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span>}</div>
</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span></div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> </div>
<div class="foldopen" id="foldopen00157" data-start="{" data-end="}">
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"><a class="line" href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089"> 157</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> <span class="keyword">const</span> *argv[]) {</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <a class="code hl_function" href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="comment">// with 2 defined test cases</span></div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span>}</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> </div>
<div class="foldopen" id="foldopen00155" data-start="{" data-end="}">
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"><a class="line" href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 155</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <a class="code hl_function" href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// with 2 defined test cases</span></div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span>}</div>
</div>
<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
<div class="ttc" id="ainverse__fast__fourier__transform_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="#l00101">inverse_fast_fourier_transform.cpp:101</a></div></div>
<div class="ttc" id="ainverse__fast__fourier__transform_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function calls automated test function to test the working of fast fourier transform.</div><div class="ttdef"><b>Definition</b> <a href="#l00155">inverse_fast_fourier_transform.cpp:155</a></div></div>
<div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for assert</div></div>
<div class="ttc" id="anamespacenumerical__methods_html_aee56dc85997b8cd42bad71a5d6bd2d93"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * InverseFastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">InverseFastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition</b> <a href="#l00034">inverse_fast_fourier_transform.cpp:34</a></div></div>
</div><!-- fragment --></div><!-- contents -->

2
d9/d43/hopcroft__karp_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: graph/hopcroft_karp.cpp Pages: 1 -->
<svg width="430pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.9 KiB

After

Width:  |  Height:  |  Size: 6.9 KiB

2
d9/d43/hopcroft__karp_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: graph/hopcroft_karp.cpp Pages: 1 -->
<svg width="430pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.1 KiB

After

Width:  |  Height:  |  Size: 6.1 KiB

2
d9/d43/set__kth__bit_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: bit_manipulation/set_kth_bit.cpp Pages: 1 -->
<svg width="191pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.1 KiB

After

Width:  |  Height:  |  Size: 4.1 KiB

2
d9/d43/set__kth__bit_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: bit_manipulation/set_kth_bit.cpp Pages: 1 -->
<svg width="191pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.4 KiB

After

Width:  |  Height:  |  Size: 3.4 KiB

2
d9/d47/digit__separation_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: greedy_algorithms/digit_separation.cpp Pages: 1 -->
<svg width="386pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.4 KiB

After

Width:  |  Height:  |  Size: 6.4 KiB

2
d9/d47/digit__separation_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: greedy_algorithms/digit_separation.cpp Pages: 1 -->
<svg width="386pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.6 KiB

After

Width:  |  Height:  |  Size: 5.6 KiB

14
d9/d49/kohonen__som__trace_8cpp.html
View File

@@ -154,7 +154,7 @@ Functions</h2></td></tr>
<tr class="memitem:a7154fe319e6033485a8a6cd6f0d8932d" id="r_a7154fe319e6033485a8a6cd6f0d8932d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7154fe319e6033485a8a6cd6f0d8932d">test_3d_classes</a> (std::vector&lt; std::valarray&lt; double &gt; &gt; *<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
<tr class="memitem:a6d0455dd5c30adda100e95f0423c786e" id="r_a6d0455dd5c30adda100e95f0423c786e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6d0455dd5c30adda100e95f0423c786e">test3</a> ()</td></tr>
<tr class="memitem:a2256c10b16edba377b64a44b6c656908" id="r_a2256c10b16edba377b64a44b6c656908"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a> (clock_t start_t, clock_t end_t)</td></tr>
<tr class="memitem:a3c04138a5bfe5d72780bb7e82a18e627" id="r_a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3c04138a5bfe5d72780bb7e82a18e627">main</a> (int argc, char **argv)</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="memitem:a042f435bca0839e721fc1574a61e8da3" id="r_a042f435bca0839e721fc1574a61e8da3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a042f435bca0839e721fc1574a61e8da3">kohonen_som_tracer</a> (const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X, std::vector&lt; std::valarray&lt; double &gt; &gt; *W, double alpha_min)</td></tr>
</table>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
@@ -267,8 +267,8 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with
</div><!-- fragment -->
</div>
</div>
<a id="a3c04138a5bfe5d72780bb7e82a18e627" name="a3c04138a5bfe5d72780bb7e82a18e627"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3c04138a5bfe5d72780bb7e82a18e627">&#9670;&#160;</a></span>main()</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
@@ -276,19 +276,15 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>argc</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
<td class="paramtype">char **</td> <td class="paramname"><span class="paramname"><em>argv</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function </p>
<p class="definition">Definition at line <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00457">457</a> of file <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html">kohonen_som_trace.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 457</span> {</div>
<div class="fragment"><div class="line"><span class="lineno"> 457</span> {</div>
<div class="line"><span class="lineno"> 458</span><span class="preprocessor">#ifdef _OPENMP</span></div>
<div class="line"><span class="lineno"> 459</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Using OpenMP based parallelization\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 460</span><span class="preprocessor">#else</span></div>

2
d9/d49/kohonen__som__trace_8cpp.js
View File

@@ -4,7 +4,7 @@ var kohonen__som__trace_8cpp =
[ "get_clock_diff", "d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908", null ],
[ "kohonen_som_tracer", "d9/d49/kohonen__som__trace_8cpp.html#a042f435bca0839e721fc1574a61e8da3", null ],
[ "machine_learning::kohonen_som_tracer", "d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3", null ],
[ "main", "d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627", null ],
[ "main", "d9/d49/kohonen__som__trace_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "save_nd_data", "d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67", null ],
[ "test1", "d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0", null ],
[ "test2", "d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0", null ],

4
d9/d49/kohonen__som__trace_8cpp_source.html
View File

@@ -429,7 +429,7 @@ $(function(){initNavTree('d9/d49/kohonen__som__trace_8cpp_source.html','../../',
</div>
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span></div>
<div class="foldopen" id="foldopen00457" data-start="{" data-end="}">
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"><a class="line" href="../../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627"> 457</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> **argv) {</div>
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"><a class="line" href="../../d9/d49/kohonen__som__trace_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 457</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span><span class="preprocessor">#ifdef _OPENMP</span></div>
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Using OpenMP based parallelization\n&quot;</span>;</div>
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span><span class="preprocessor">#else</span></div>
@@ -462,7 +462,6 @@ $(function(){initNavTree('d9/d49/kohonen__som__trace_8cpp_source.html','../../',
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span>}</div>
</div>
<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
<div class="ttc" id="agroup__machine__learning_html_gae0208548f8b393528e5db01717e88e67"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a></div><div class="ttdeci">int save_nd_data(const char *fname, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition</b> <a href="#l00058">kohonen_som_trace.cpp:58</a></div></div>
<div class="ttc" id="agroup__machine__learning_html_gaf5ce14f026d6d231bef29161bac2b485"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a></div><div class="ttdeci">double _random(double a, double b)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00053">kohonen_som_topology.cpp:53</a></div></div>
<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
@@ -474,6 +473,7 @@ $(function(){initNavTree('d9/d49/kohonen__som__trace_8cpp_source.html','../../',
<div class="ttc" id="akohonen__som__trace_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition</b> <a href="#l00414">kohonen_som_trace.cpp:414</a></div></div>
<div class="ttc" id="akohonen__som__trace_8cpp_html_a7154fe319e6033485a8a6cd6f0d8932d"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d">test_3d_classes</a></div><div class="ttdeci">void test_3d_classes(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> <a href="#l00359">kohonen_som_trace.cpp:359</a></div></div>
<div class="ttc" id="akohonen__som__trace_8cpp_html_ae571600aa42a81bc14a4a602ea5ff00d"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d">test_circle</a></div><div class="ttdeci">void test_circle(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> <a href="#l00196">kohonen_som_trace.cpp:196</a></div></div>
<div class="ttc" id="akohonen__som__trace_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00457">kohonen_som_trace.cpp:457</a></div></div>
<div class="ttc" id="anamespacemachine__learning_html"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></div><div class="ttdoc">A* search algorithm</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a042f435bca0839e721fc1574a61e8da3"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3">machine_learning::kohonen_som_tracer</a></div><div class="ttdeci">void kohonen_som_tracer(const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X, std::vector&lt; std::valarray&lt; double &gt; &gt; *W, double alpha_min)</div><div class="ttdef"><b>Definition</b> <a href="#l00149">kohonen_som_trace.cpp:149</a></div></div>
<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>

2
d9/d4e/gnome__sort_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: sorting/gnome_sort.cpp Pages: 1 -->
<svg width="258pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.7 KiB

After

Width:  |  Height:  |  Size: 4.7 KiB

2
d9/d4e/gnome__sort_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: sorting/gnome_sort.cpp Pages: 1 -->
<svg width="258pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 3.9 KiB

2
d9/d5f/dijkstra_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: graph/dijkstra.cpp Pages: 1 -->
<svg width="433pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.9 KiB

After

Width:  |  Height:  |  Size: 6.9 KiB

2
d9/d5f/dijkstra_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: graph/dijkstra.cpp Pages: 1 -->
<svg width="433pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.2 KiB

After

Width:  |  Height:  |  Size: 6.2 KiB

2
d9/d73/median__search2_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: search/median_search2.cpp Pages: 1 -->
<svg width="146pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

2
d9/d73/median__search2_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: search/median_search2.cpp Pages: 1 -->
<svg width="146pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

2
d9/d78/factorial_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/factorial.cpp Pages: 1 -->
<svg width="191pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 3.9 KiB

2
d9/d78/factorial_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/factorial.cpp Pages: 1 -->
<svg width="191pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.1 KiB

After

Width:  |  Height:  |  Size: 3.1 KiB

2
d9/d7d/primality__test_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: others/primality_test.cpp Pages: 1 -->
<svg width="131pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

2
d9/d7d/primality__test_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: others/primality_test.cpp Pages: 1 -->
<svg width="131pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

2
d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: std::is_unsigned&lt; uint128_t &gt; Pages: 1 -->
<svg width="153pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

2
d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: std::is_unsigned&lt; uint128_t &gt; Pages: 1 -->
<svg width="153pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

2
d9/d88/palindrome__partitioning_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: dynamic_programming/palindrome_partitioning.cpp Pages: 1 -->
<svg width="324pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.7 KiB

After

Width:  |  Height:  |  Size: 5.7 KiB

2
d9/d88/palindrome__partitioning_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: dynamic_programming/palindrome_partitioning.cpp Pages: 1 -->
<svg width="324pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.9 KiB

After

Width:  |  Height:  |  Size: 4.9 KiB

2
d9/d94/golden__search__extrema_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: numerical_methods/golden_search_extrema.cpp Pages: 1 -->
<svg width="386pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.4 KiB

After

Width:  |  Height:  |  Size: 6.4 KiB

2
d9/d94/golden__search__extrema_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: numerical_methods/golden_search_extrema.cpp Pages: 1 -->
<svg width="386pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.6 KiB

After

Width:  |  Height:  |  Size: 5.6 KiB

2
d9/dae/struct_queue__coll__graph.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: Queue Pages: 1 -->
<svg width="100pt" height="205pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.1 KiB

After

Width:  |  Height:  |  Size: 4.1 KiB

2
d9/dae/struct_queue__coll__graph_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: Queue Pages: 1 -->
<svg width="100pt" height="205pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.4 KiB

After

Width:  |  Height:  |  Size: 3.4 KiB

2
d9/db7/linked__list_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: data_structures/linked_list.cpp Pages: 1 -->
<svg width="189pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.1 KiB

After

Width:  |  Height:  |  Size: 4.1 KiB

2
d9/db7/linked__list_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: data_structures/linked_list.cpp Pages: 1 -->
<svg width="189pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

2
d9/dbf/brute__force__string__searching_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: strings/brute_force_string_searching.cpp Pages: 1 -->
<svg width="185pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.1 KiB

After

Width:  |  Height:  |  Size: 4.1 KiB

2
d9/dbf/brute__force__string__searching_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: strings/brute_force_string_searching.cpp Pages: 1 -->
<svg width="185pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

2
d9/dcc/miller__rabin_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/miller_rabin.cpp Pages: 1 -->
<svg width="256pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.6 KiB

After

Width:  |  Height:  |  Size: 4.6 KiB

2
d9/dcc/miller__rabin_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/miller_rabin.cpp Pages: 1 -->
<svg width="256pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 3.9 KiB

2
d9/dd9/bisection__method_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: numerical_methods/bisection_method.cpp Pages: 1 -->
<svg width="179pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.1 KiB

After

Width:  |  Height:  |  Size: 4.1 KiB

2
d9/dd9/bisection__method_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: numerical_methods/bisection_method.cpp Pages: 1 -->
<svg width="179pt" height="94pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

2
d9/ddb/tower__of__hanoi_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: others/tower_of_hanoi.cpp Pages: 1 -->
<svg width="139pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

2
d9/ddb/tower__of__hanoi_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: others/tower_of_hanoi.cpp Pages: 1 -->
<svg width="139pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

2
d9/deb/cycle__sort_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: sorting/cycle_sort.cpp Pages: 1 -->
<svg width="325pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.4 KiB

After

Width:  |  Height:  |  Size: 5.4 KiB

2
d9/deb/cycle__sort_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: sorting/cycle_sort.cpp Pages: 1 -->
<svg width="325pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.7 KiB

After

Width:  |  Height:  |  Size: 4.7 KiB

2
d9/deb/next__higher__number__with__same__number__of__set__bits_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: bit_manipulation/next_higher_number_with_same_number_of_set_bits.cpp Pages: 1 -->
<svg width="191pt" height="105pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.4 KiB

After

Width:  |  Height:  |  Size: 4.4 KiB

2
d9/deb/next__higher__number__with__same__number__of__set__bits_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: bit_manipulation/next_higher_number_with_same_number_of_set_bits.cpp Pages: 1 -->
<svg width="191pt" height="105pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.6 KiB

After

Width:  |  Height:  |  Size: 3.6 KiB

2
d9/dfa/fibonacci__search_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: search/fibonacci_search.cpp Pages: 1 -->
<svg width="325pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.4 KiB

After

Width:  |  Height:  |  Size: 5.4 KiB

2
d9/dfa/fibonacci__search_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: search/fibonacci_search.cpp Pages: 1 -->
<svg width="325pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.6 KiB

After

Width:  |  Height:  |  Size: 4.6 KiB

2
d9/dfd/primes__up__to__billion_8cpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/primes_up_to_billion.cpp Pages: 1 -->
<svg width="156pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

2
d9/dfd/primes__up__to__billion_8cpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: math/primes_up_to_billion.cpp Pages: 1 -->
<svg width="156pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

2
d9/dfd/uint128__t_8hpp__incl.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: ciphers/uint128_t.hpp Pages: 1 -->
<svg width="313pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.4 KiB

After

Width:  |  Height:  |  Size: 5.4 KiB

2
d9/dfd/uint128__t_8hpp__incl_org.svg
View File

@@ -1,7 +1,7 @@
<?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 13.1.1 (20250719.2154)
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
-->
<!-- Title: ciphers/uint128_t.hpp Pages: 1 -->
<svg width="313pt" height="83pt"
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.6 KiB

After

Width:  |  Height:  |  Size: 4.6 KiB