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

Documentation for 6376bf46af

Browse Source
This commit is contained in:
github-actions
2023-09-27 18:42:32 +00:00
parent d28eba1fef
commit b5b4d78981
5708 changed files with 52275 additions and 51112 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
d4/db6/reverse__binary__tree_8cpp.html
View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: operations_on_datastructures/reverse_binary_tree.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.7 -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -128,31 +128,31 @@ Classes</h2></td></tr>
</table><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:da/d6d/namespaceoperations__on__datastructures"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></td></tr>
<tr class="memitem:da/d6d/namespaceoperations__on__datastructures" id="r_da/d6d/namespaceoperations__on__datastructures"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></td></tr>
<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:dc/dc5/namespacereverse__binary__tree"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/dc5/namespacereverse__binary__tree.html">reverse_binary_tree</a></td></tr>
<tr class="memitem:dc/dc5/namespacereverse__binary__tree" id="r_dc/dc5/namespacereverse__binary__tree"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/dc5/namespacereverse__binary__tree.html">reverse_binary_tree</a></td></tr>
<tr class="memdesc:dc/dc5/namespacereverse__binary__tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="https://www.geeksforgeeks.org/reverse-tree-path/" target="_blank">Reverse a Binary Tree</a> implementation. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d9/df4/namespacetests"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html">tests</a></td></tr>
<tr class="memitem:d9/df4/namespacetests" id="r_d9/df4/namespacetests"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html">tests</a></td></tr>
<tr class="memdesc:d9/df4/namespacetests"><td class="mdescLeft">&#160;</td><td class="mdescRight">Testcases to check Union of Two Arrays. <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:a167c24bd817469ae47358d12e034f2d5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a> ()</td></tr>
<tr class="memitem:a167c24bd817469ae47358d12e034f2d5" id="r_a167c24bd817469ae47358d12e034f2d5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a> ()</td></tr>
<tr class="memdesc:a167c24bd817469ae47358d12e034f2d5"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check an simple case. <br /></td></tr>
<tr class="separator:a167c24bd817469ae47358d12e034f2d5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abdd77344d4af8fd56d14a5cabbf2f669"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a> ()</td></tr>
<tr class="memitem:abdd77344d4af8fd56d14a5cabbf2f669" id="r_abdd77344d4af8fd56d14a5cabbf2f669"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a> ()</td></tr>
<tr class="memdesc:abdd77344d4af8fd56d14a5cabbf2f669"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check an empty vector. <br /></td></tr>
<tr class="separator:abdd77344d4af8fd56d14a5cabbf2f669"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa515639572647508b94986489aab6d76"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a> ()</td></tr>
<tr class="memitem:aa515639572647508b94986489aab6d76" id="r_aa515639572647508b94986489aab6d76"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a> ()</td></tr>
<tr class="memdesc:aa515639572647508b94986489aab6d76"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check an invalid shift value. <br /></td></tr>
<tr class="separator:aa515639572647508b94986489aab6d76"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</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="../../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to test the correctness of the Tree Reversal. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</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="../../d4/db6/reverse__binary__tree_8cpp.html#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>
@@ -240,7 +240,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><a class="el" href="../../d4/db6/reverse__binary__tree_8cpp.html">reverse_binary_tree.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
</ul>
</div>
</body>

6
d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
View File

@@ -1,9 +1,9 @@
<map id="test" name="test">
<area shape="rect" id="Node000001" title="Function to test the correctness of the Tree Reversal." alt="" coords="5,55,49,80"/>
<area shape="rect" id="Node000002" href="$d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" title="A Test to check an simple case." alt="" coords="97,5,184,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,56,95,35,97,40,50,61"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,56,94,35,96,40,50,61"/>
<area shape="rect" id="Node000003" href="$d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" title="A Test to check an empty vector." alt="" coords="97,55,184,80"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="49,65,82,65,82,70,49,70"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="49,65,81,65,81,70,49,70"/>
<area shape="rect" id="Node000004" href="$d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" title="A Test to check an invalid shift value." alt="" coords="97,104,184,130"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="50,74,97,95,95,100,48,79"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="50,74,96,95,94,100,48,79"/>
</map>

14
d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: test Pages: 1 -->
<svg width="142pt" height="101pt"
@@ -40,8 +40,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="M32.86,-53.58C42.77,-58 55.95,-63.88 68.03,-69.26"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="66.26,-72.75 76.81,-73.62 69.11,-66.36 66.26,-72.75"/>
<path fill="none" stroke="#63b8ff" d="M32.86,-53.58C42.57,-57.91 55.42,-63.64 67.3,-68.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="65.87,-72.13 76.43,-73.01 68.72,-65.74 65.87,-72.13"/>
</a>
</g>
</g>
@@ -58,8 +58,8 @@
<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="M32.86,-46.62C39.86,-46.62 48.5,-46.62 57.22,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="57.21,-50.13 67.21,-46.62 57.21,-43.13 57.21,-50.13"/>
<path fill="none" stroke="#63b8ff" d="M32.86,-46.62C39.78,-46.62 48.31,-46.62 56.93,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.69,-50.13 66.69,-46.63 56.69,-43.13 56.69,-50.13"/>
</a>
</g>
</g>
@@ -76,8 +76,8 @@
<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="M32.86,-39.67C42.77,-35.25 55.95,-29.37 68.03,-23.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.11,-26.89 76.81,-19.63 66.26,-20.5 69.11,-26.89"/>
<path fill="none" stroke="#63b8ff" d="M32.86,-39.67C42.57,-35.34 55.42,-29.61 67.3,-24.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.72,-27.51 76.43,-20.24 65.87,-21.12 68.72,-27.51"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.2 KiB

After

Width:  |  Height:  |  Size: 4.2 KiB

14
d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: test Pages: 1 -->
<svg width="142pt" height="101pt"
@@ -30,8 +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="M32.86,-53.58C42.77,-58 55.95,-63.88 68.03,-69.26"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="66.26,-72.75 76.81,-73.62 69.11,-66.36 66.26,-72.75"/>
<path fill="none" stroke="#63b8ff" d="M32.86,-53.58C42.57,-57.91 55.42,-63.64 67.3,-68.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="65.87,-72.13 76.43,-73.01 68.72,-65.74 65.87,-72.13"/>
</a>
</g>
</g>
@@ -48,8 +48,8 @@
<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="M32.86,-46.62C39.86,-46.62 48.5,-46.62 57.22,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="57.21,-50.13 67.21,-46.62 57.21,-43.13 57.21,-50.13"/>
<path fill="none" stroke="#63b8ff" d="M32.86,-46.62C39.78,-46.62 48.31,-46.62 56.93,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.69,-50.13 66.69,-46.63 56.69,-43.13 56.69,-50.13"/>
</a>
</g>
</g>
@@ -66,8 +66,8 @@
<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="M32.86,-39.67C42.77,-35.25 55.95,-29.37 68.03,-23.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.11,-26.89 76.81,-19.63 66.26,-20.5 69.11,-26.89"/>
<path fill="none" stroke="#63b8ff" d="M32.86,-39.67C42.57,-35.34 55.42,-29.61 67.3,-24.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.72,-27.51 76.43,-20.24 65.87,-21.12 68.72,-27.51"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.4 KiB

After

Width:  |  Height:  |  Size: 3.4 KiB

6
d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -1,11 +1,11 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title="main function" alt="" coords="5,55,55,80"/>
<area shape="rect" id="Node000002" href="$d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test the correctness of the Tree Reversal." alt="" coords="103,55,146,80"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,65,88,65,88,70,55,70"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,65,87,65,87,70,55,70"/>
<area shape="rect" id="Node000003" href="$d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" title="A Test to check an simple case." alt="" coords="194,5,281,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="145,56,192,35,194,40,148,61"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="145,56,191,35,193,40,148,61"/>
<area shape="rect" id="Node000004" href="$d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" title="A Test to check an empty vector." alt="" coords="194,55,281,80"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="146,65,179,65,179,70,146,70"/>
<area shape="rect" id="Node000005" href="$d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" title="A Test to check an invalid shift value." alt="" coords="194,104,281,130"/>
<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="148,74,194,95,192,100,145,79"/>
<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="148,74,193,95,191,100,145,79"/>
</map>

18
d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: main Pages: 1 -->
<svg width="215pt" height="101pt"
@@ -40,8 +40,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.2,-46.62C44.67,-46.62 53.52,-46.62 61.73,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.71,-50.13 71.71,-46.62 61.71,-43.13 61.71,-50.13"/>
<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
</a>
</g>
</g>
@@ -58,8 +58,8 @@
<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="M105.86,-53.58C115.77,-58 128.95,-63.88 141.03,-69.26"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="139.26,-72.75 149.81,-73.62 142.11,-66.36 139.26,-72.75"/>
<path fill="none" stroke="#63b8ff" d="M105.86,-53.58C115.57,-57.91 128.42,-63.64 140.3,-68.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="138.87,-72.13 149.43,-73.01 141.72,-65.74 138.87,-72.13"/>
</a>
</g>
</g>
@@ -76,8 +76,8 @@
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.86,-46.62C112.86,-46.62 121.5,-46.62 130.22,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.21,-50.13 140.21,-46.62 130.21,-43.13 130.21,-50.13"/>
<path fill="none" stroke="#63b8ff" d="M105.86,-46.62C112.78,-46.62 121.31,-46.62 129.93,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="129.69,-50.13 139.69,-46.63 129.69,-43.13 129.69,-50.13"/>
</a>
</g>
</g>
@@ -94,8 +94,8 @@
<g id="edge4_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.86,-39.67C115.77,-35.25 128.95,-29.37 141.03,-23.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="142.11,-26.89 149.81,-19.63 139.26,-20.5 142.11,-26.89"/>
<path fill="none" stroke="#63b8ff" d="M105.86,-39.67C115.57,-35.34 128.42,-29.61 140.3,-24.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="141.72,-27.51 149.43,-20.24 138.87,-21.12 141.72,-27.51"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.0 KiB

After

Width:  |  Height:  |  Size: 5.0 KiB

18
d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: main Pages: 1 -->
<svg width="215pt" height="101pt"
@@ -30,8 +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.2,-46.62C44.67,-46.62 53.52,-46.62 61.73,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.71,-50.13 71.71,-46.62 61.71,-43.13 61.71,-50.13"/>
<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
</a>
</g>
</g>
@@ -48,8 +48,8 @@
<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="M105.86,-53.58C115.77,-58 128.95,-63.88 141.03,-69.26"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="139.26,-72.75 149.81,-73.62 142.11,-66.36 139.26,-72.75"/>
<path fill="none" stroke="#63b8ff" d="M105.86,-53.58C115.57,-57.91 128.42,-63.64 140.3,-68.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="138.87,-72.13 149.43,-73.01 141.72,-65.74 138.87,-72.13"/>
</a>
</g>
</g>
@@ -66,8 +66,8 @@
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.86,-46.62C112.86,-46.62 121.5,-46.62 130.22,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.21,-50.13 140.21,-46.62 130.21,-43.13 130.21,-50.13"/>
<path fill="none" stroke="#63b8ff" d="M105.86,-46.62C112.78,-46.62 121.31,-46.62 129.93,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="129.69,-50.13 139.69,-46.63 129.69,-43.13 129.69,-50.13"/>
</a>
</g>
</g>
@@ -84,8 +84,8 @@
<g id="edge4_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.86,-39.67C115.77,-35.25 128.95,-29.37 141.03,-23.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="142.11,-26.89 149.81,-19.63 139.26,-20.5 142.11,-26.89"/>
<path fill="none" stroke="#63b8ff" d="M105.86,-39.67C115.57,-35.34 128.42,-29.61 140.3,-24.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="141.72,-27.51 149.43,-20.24 138.87,-21.12 141.72,-27.51"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.2 KiB

After

Width:  |  Height:  |  Size: 4.2 KiB

6
d4/db6/struct_min_heap_node-members.html
View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.7 -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -113,7 +113,7 @@ $(document).ready(function(){initNavTree('d5/d29/struct_min_heap_node.html','../
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
</ul>
</div>
</body>