backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-11 19:17:21 +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

16
d5/df6/check__amicable__pair_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++: math/check_amicable_pair.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');
@@ -116,22 +116,22 @@ Include dependency graph for check_amicable_pair.cpp:</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:dd/d47/namespacemath"><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="memitem:dd/d47/namespacemath" id="r_dd/d47/namespacemath"><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>
</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:af05567415a9ea36c254b54e3d5a2152a"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a">math::sum_of_divisor</a> (int num)</td></tr>
<tr class="memitem:af05567415a9ea36c254b54e3d5a2152a" id="r_af05567415a9ea36c254b54e3d5a2152a"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a">math::sum_of_divisor</a> (int num)</td></tr>
<tr class="memdesc:af05567415a9ea36c254b54e3d5a2152a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to calculate the sum of all the proper divisor of an integer. <br /></td></tr>
<tr class="separator:af05567415a9ea36c254b54e3d5a2152a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8e6eede206201db0d1dbb618fa969bec"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a> (int x, int y)</td></tr>
<tr class="memitem:a8e6eede206201db0d1dbb618fa969bec" id="r_a8e6eede206201db0d1dbb618fa969bec"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a> (int x, int y)</td></tr>
<tr class="memdesc:a8e6eede206201db0d1dbb618fa969bec"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to check whether the pair is amicable or not. <br /></td></tr>
<tr class="separator:a8e6eede206201db0d1dbb618fa969bec"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><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="../../d5/df6/check__amicable__pair_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="../../d5/df6/check__amicable__pair_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>
@@ -223,7 +223,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_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d5/df6/check__amicable__pair_8cpp.html">check_amicable_pair.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>

4
d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
View File

@@ -1,9 +1,9 @@
<map id="tests" name="tests">
<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,31,56,56"/>
<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec" title="Function to check whether the pair is amicable or not." alt="" coords="104,5,239,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,36,89,30,90,36,56,42"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,36,88,30,89,36,56,42"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="136,55,207,80"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,45,122,56,121,62,55,50"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,45,121,56,120,62,55,50"/>
<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" title="Function to calculate the sum of all the proper divisor of an integer." alt="" coords="287,5,433,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="239,16,272,16,272,21,239,21"/>
</map>

14
d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_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: tests Pages: 1 -->
<svg width="329pt" height="64pt"
@@ -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.93,-30.93C45.09,-32.25 53.79,-33.84 62.86,-35.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.14,-39.12 72.6,-37.48 63.4,-32.23 62.14,-39.12"/>
<path fill="none" stroke="#63b8ff" d="M37.93,-30.93C45.02,-32.23 53.6,-33.81 62.56,-35.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.65,-38.84 72.11,-37.2 62.91,-31.96 61.65,-38.84"/>
</a>
</g>
</g>
@@ -58,8 +58,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="M37.93,-24.49C51.43,-22.14 70.37,-18.85 86.99,-15.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.25,-19.3 96.5,-14.14 86.05,-12.4 87.25,-19.3"/>
<path fill="none" stroke="#63b8ff" d="M37.93,-24.49C51.31,-22.17 70.01,-18.92 86.52,-16.05"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="86.76,-19.56 96.01,-14.4 85.56,-12.66 86.76,-19.56"/>
</a>
</g>
</g>
@@ -76,8 +76,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="M175.51,-46.62C183.57,-46.62 192,-46.62 200.34,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="200.21,-50.13 210.21,-46.62 200.21,-43.13 200.21,-50.13"/>
<path fill="none" stroke="#63b8ff" d="M175.51,-46.62C183.38,-46.62 191.62,-46.62 199.78,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="199.69,-50.13 209.69,-46.63 199.69,-43.13 199.69,-50.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.2 KiB

After

Width:  |  Height:  |  Size: 4.2 KiB

14
d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_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: tests Pages: 1 -->
<svg width="329pt" height="64pt"
@@ -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.93,-30.93C45.09,-32.25 53.79,-33.84 62.86,-35.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.14,-39.12 72.6,-37.48 63.4,-32.23 62.14,-39.12"/>
<path fill="none" stroke="#63b8ff" d="M37.93,-30.93C45.02,-32.23 53.6,-33.81 62.56,-35.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.65,-38.84 72.11,-37.2 62.91,-31.96 61.65,-38.84"/>
</a>
</g>
</g>
@@ -48,8 +48,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="M37.93,-24.49C51.43,-22.14 70.37,-18.85 86.99,-15.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.25,-19.3 96.5,-14.14 86.05,-12.4 87.25,-19.3"/>
<path fill="none" stroke="#63b8ff" d="M37.93,-24.49C51.31,-22.17 70.01,-18.92 86.52,-16.05"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="86.76,-19.56 96.01,-14.4 85.56,-12.66 86.76,-19.56"/>
</a>
</g>
</g>
@@ -66,8 +66,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="M175.51,-46.62C183.57,-46.62 192,-46.62 200.34,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="200.21,-50.13 210.21,-46.62 200.21,-43.13 200.21,-50.13"/>
<path fill="none" stroke="#63b8ff" d="M175.51,-46.62C183.38,-46.62 191.62,-46.62 199.78,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="199.69,-50.13 209.69,-46.63 199.69,-43.13 199.69,-50.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.4 KiB

After

Width:  |  Height:  |  Size: 3.4 KiB

4
d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -5,7 +5,7 @@
<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec" title="Function to check whether the pair is amicable or not." alt="" coords="201,5,336,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,36,186,30,187,36,154,42"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="233,55,304,80"/>
<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="154,45,219,56,218,62,153,50"/>
<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="154,45,218,56,218,62,153,50"/>
<area shape="rect" id="Node000004" href="$dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" title="Function to calculate the sum of all the proper divisor of an integer." alt="" coords="384,5,531,31"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="337,16,370,16,370,21,337,21"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="337,16,369,16,369,21,337,21"/>
</map>

18
d5/df6/check__amicable__pair_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="402pt" height="64pt"
@@ -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.14,-27.62C44.64,-27.62 53.57,-27.62 61.98,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.94,-31.13 71.94,-27.62 61.94,-24.13 61.94,-31.13"/>
<path fill="none" stroke="#63b8ff" d="M37.14,-27.62C44.55,-27.62 53.37,-27.62 61.69,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-31.13 71.43,-27.63 61.43,-24.13 61.43,-31.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="M110.93,-30.93C118.09,-32.25 126.79,-33.84 135.86,-35.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="135.14,-39.12 145.6,-37.48 136.4,-32.23 135.14,-39.12"/>
<path fill="none" stroke="#63b8ff" d="M110.93,-30.93C118.02,-32.23 126.6,-33.81 135.56,-35.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.65,-38.84 145.11,-37.2 135.91,-31.96 134.65,-38.84"/>
</a>
</g>
</g>
@@ -76,8 +76,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="M110.93,-24.49C124.43,-22.14 143.37,-18.85 159.99,-15.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="160.25,-19.3 169.5,-14.14 159.05,-12.4 160.25,-19.3"/>
<path fill="none" stroke="#63b8ff" d="M110.93,-24.49C124.31,-22.17 143.01,-18.92 159.52,-16.05"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="159.76,-19.56 169.01,-14.4 158.56,-12.66 159.76,-19.56"/>
</a>
</g>
</g>
@@ -94,8 +94,8 @@
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M248.51,-46.62C256.57,-46.62 265,-46.62 273.34,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="273.21,-50.13 283.21,-46.62 273.21,-43.13 273.21,-50.13"/>
<path fill="none" stroke="#63b8ff" d="M248.51,-46.62C256.38,-46.62 264.62,-46.62 272.78,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="272.69,-50.13 282.69,-46.63 272.69,-43.13 272.69,-50.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.0 KiB

After

Width:  |  Height:  |  Size: 5.0 KiB

18
d5/df6/check__amicable__pair_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="402pt" height="64pt"
@@ -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.14,-27.62C44.64,-27.62 53.57,-27.62 61.98,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.94,-31.13 71.94,-27.62 61.94,-24.13 61.94,-31.13"/>
<path fill="none" stroke="#63b8ff" d="M37.14,-27.62C44.55,-27.62 53.37,-27.62 61.69,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-31.13 71.43,-27.63 61.43,-24.13 61.43,-31.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="M110.93,-30.93C118.09,-32.25 126.79,-33.84 135.86,-35.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="135.14,-39.12 145.6,-37.48 136.4,-32.23 135.14,-39.12"/>
<path fill="none" stroke="#63b8ff" d="M110.93,-30.93C118.02,-32.23 126.6,-33.81 135.56,-35.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.65,-38.84 145.11,-37.2 135.91,-31.96 134.65,-38.84"/>
</a>
</g>
</g>
@@ -66,8 +66,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="M110.93,-24.49C124.43,-22.14 143.37,-18.85 159.99,-15.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="160.25,-19.3 169.5,-14.14 159.05,-12.4 160.25,-19.3"/>
<path fill="none" stroke="#63b8ff" d="M110.93,-24.49C124.31,-22.17 143.01,-18.92 159.52,-16.05"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="159.76,-19.56 169.01,-14.4 158.56,-12.66 159.76,-19.56"/>
</a>
</g>
</g>
@@ -84,8 +84,8 @@
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M248.51,-46.62C256.57,-46.62 265,-46.62 273.34,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="273.21,-50.13 283.21,-46.62 273.21,-43.13 273.21,-50.13"/>
<path fill="none" stroke="#63b8ff" d="M248.51,-46.62C256.38,-46.62 264.62,-46.62 272.78,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="272.69,-50.13 282.69,-46.63 272.69,-43.13 272.69,-50.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.3 KiB

After

Width:  |  Height:  |  Size: 4.3 KiB