backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-27 08:51:41 +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

20
d4/d6c/boruvkas__minimum__spanning__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++: greedy_algorithms/boruvkas_minimum_spanning_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');
@@ -118,28 +118,28 @@ Include dependency graph for boruvkas_minimum_spanning_tree.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:d2/d90/namespacegreedy__algorithms"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
<tr class="memitem:d2/d90/namespacegreedy__algorithms" id="r_d2/d90/namespacegreedy__algorithms"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
<tr class="memdesc:d2/d90/namespacegreedy__algorithms"><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:d8/d64/namespaceboruvkas__minimum__spanning__tree"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d64/namespaceboruvkas__minimum__spanning__tree.html">boruvkas_minimum_spanning_tree</a></td></tr>
<tr class="memitem:d8/d64/namespaceboruvkas__minimum__spanning__tree" id="r_d8/d64/namespaceboruvkas__minimum__spanning__tree"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d64/namespaceboruvkas__minimum__spanning__tree.html">boruvkas_minimum_spanning_tree</a></td></tr>
<tr class="memdesc:d8/d64/namespaceboruvkas__minimum__spanning__tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the [Borůvkas Algorithm](<a href="https://en.wikipedia.org/wiki/Borůvka's_algorithm">https://en.wikipedia.org/wiki/Borůvka's_algorithm</a>) implementation. <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:a95de0f5e70e83164dbd1b4c515565e84"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84">greedy_algorithms::boruvkas_minimum_spanning_tree::findParent</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; parent, const int v)</td></tr>
<tr class="memitem:a95de0f5e70e83164dbd1b4c515565e84" id="r_a95de0f5e70e83164dbd1b4c515565e84"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84">greedy_algorithms::boruvkas_minimum_spanning_tree::findParent</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; parent, const int v)</td></tr>
<tr class="memdesc:a95de0f5e70e83164dbd1b4c515565e84"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursively returns the vertex's parent at the root of the tree. <br /></td></tr>
<tr class="separator:a95de0f5e70e83164dbd1b4c515565e84"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a94c615fc66b72e0adbcbcb99aabb1a59"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; adj)</td></tr>
<tr class="memitem:a94c615fc66b72e0adbcbcb99aabb1a59" id="r_a94c615fc66b72e0adbcbcb99aabb1a59"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; adj)</td></tr>
<tr class="memdesc:a94c615fc66b72e0adbcbcb99aabb1a59"><td class="mdescLeft">&#160;</td><td class="mdescRight">the implementation of boruvka's algorithm <br /></td></tr>
<tr class="separator:a94c615fc66b72e0adbcbcb99aabb1a59"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2311b22324cf09926726e4ce1309af8b"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a2311b22324cf09926726e4ce1309af8b">greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; adj)</td></tr>
<tr class="memitem:a2311b22324cf09926726e4ce1309af8b" id="r_a2311b22324cf09926726e4ce1309af8b"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a2311b22324cf09926726e4ce1309af8b">greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; adj)</td></tr>
<tr class="memdesc:a2311b22324cf09926726e4ce1309af8b"><td class="mdescLeft">&#160;</td><td class="mdescRight">counts the sum of edges in the given tree <br /></td></tr>
<tr class="separator:a2311b22324cf09926726e4ce1309af8b"><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="../../d4/d6c/boruvkas__minimum__spanning__tree_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="../../d4/d6c/boruvkas__minimum__spanning__tree_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="../../d4/d6c/boruvkas__minimum__spanning__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/d6c/boruvkas__minimum__spanning__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>
@@ -495,7 +495,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_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html">boruvkas_minimum_spanning_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>

4
d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph.map
View File

@@ -1,6 +1,6 @@
<map id="greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum" name="greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum">
<area shape="rect" id="Node000001" title="counts the sum of edges in the given tree" alt="" coords="5,29,199,85"/>
<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="62,29,63,19,70,10,83,5,102,3,124,5,137,13,134,17,122,11,102,8,84,10,73,15,67,21,67,29"/>
<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="62,29,63,19,70,10,83,5,102,3,123,5,137,12,134,17,122,10,102,8,84,10,73,15,67,21,67,29"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="247,44,362,70"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="199,55,232,55,232,60,199,60"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="199,55,231,55,231,60,199,60"/>
</map>

10
d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_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: greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum Pages: 1 -->
<svg width="276pt" height="68pt"
@@ -33,8 +33,8 @@
<g id="edge2_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M44.49,-42.07C41.82,-51.55 51.16,-59.75 72.5,-59.75 85.17,-59.75 93.61,-56.86 97.82,-52.53"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="101.4,-53.63 100.51,-43.07 94.63,-51.88 101.4,-53.63"/>
<path fill="none" stroke="#63b8ff" d="M44.49,-42.07C41.82,-51.55 51.16,-59.75 72.5,-59.75 84.84,-59.75 93.16,-57.01 97.48,-52.86"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="100.76,-54.1 100.1,-43.53 94.02,-52.21 100.76,-54.1"/>
</a>
</g>
</g>
@@ -51,8 +51,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="M145.3,-20.88C153.57,-20.88 161.89,-20.88 169.85,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.82,-24.38 179.82,-20.88 169.82,-17.38 169.82,-24.38"/>
<path fill="none" stroke="#63b8ff" d="M145.3,-20.88C153.47,-20.88 161.69,-20.88 169.57,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.31,-24.38 179.31,-20.88 169.31,-17.38 169.31,-24.38"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

10
d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_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: greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum Pages: 1 -->
<svg width="276pt" height="68pt"
@@ -23,8 +23,8 @@
<g id="edge2_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M44.49,-42.07C41.82,-51.55 51.16,-59.75 72.5,-59.75 85.17,-59.75 93.61,-56.86 97.82,-52.53"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="101.4,-53.63 100.51,-43.07 94.63,-51.88 101.4,-53.63"/>
<path fill="none" stroke="#63b8ff" d="M44.49,-42.07C41.82,-51.55 51.16,-59.75 72.5,-59.75 84.84,-59.75 93.16,-57.01 97.48,-52.86"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="100.76,-54.1 100.1,-43.53 94.02,-52.21 100.76,-54.1"/>
</a>
</g>
</g>
@@ -41,8 +41,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M145.3,-20.88C153.57,-20.88 161.89,-20.88 169.85,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.82,-24.38 179.82,-20.88 169.82,-17.38 169.82,-24.38"/>
<path fill="none" stroke="#63b8ff" d="M145.3,-20.88C153.47,-20.88 161.69,-20.88 169.57,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.31,-24.38 179.31,-20.88 169.31,-17.38 169.31,-24.38"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.5 KiB

After

Width:  |  Height:  |  Size: 2.5 KiB

2
d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
View File

@@ -1,5 +1,5 @@
<map id="tests" name="tests">
<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,56,31"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="104,5,175,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,16,89,16,89,21,56,21"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,16,88,16,88,21,56,21"/>
</map>

6
d4/d6c/boruvkas__minimum__spanning__tree_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="135pt" height="27pt"
@@ -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.94,-9.62C45.22,-9.62 53.89,-9.62 62.39,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.35,-13.13 72.35,-9.62 62.35,-6.13 62.35,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

6
d4/d6c/boruvkas__minimum__spanning__tree_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="135pt" height="27pt"
@@ -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.94,-9.62C45.22,-9.62 53.89,-9.62 62.39,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.35,-13.13 72.35,-9.62 62.35,-6.13 62.35,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.6 KiB

After

Width:  |  Height:  |  Size: 1.6 KiB

8
d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph.map
View File

@@ -1,11 +1,11 @@
<map id="greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas" name="greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas">
<area shape="rect" id="Node000001" title="the implementation of boruvka&#39;s algorithm" alt="" coords="5,95,199,150"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="55,94,55,84,64,75,80,70,102,68,128,71,143,78,141,83,126,76,102,73,81,75,67,80,60,86,60,94"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="55,94,55,84,64,75,80,70,102,68,127,71,143,77,141,82,126,76,102,73,81,75,67,80,60,86,60,94"/>
<area shape="rect" id="Node000002" href="$d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84" title="Recursively returns the vertex&#39;s parent at the root of the tree." alt="" coords="247,29,440,85"/>
<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="198,94,232,85,233,90,200,99"/>
<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="198,94,231,85,232,90,200,99"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="290,110,397,135"/>
<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="199,120,275,120,275,125,199,125"/>
<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="199,120,274,120,274,125,199,125"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="286,159,401,185"/>
<area shape="poly" id="edge5_Node000001_Node000004" title=" " alt="" coords="200,140,271,154,270,160,198,145"/>
<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="296,29,297,19,305,10,321,5,343,3,369,5,385,13,382,17,368,11,343,8,322,10,308,15,302,21,301,29"/>
<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="296,29,297,19,305,10,321,5,343,3,369,5,384,12,382,17,367,10,343,8,322,10,308,15,302,21,301,29"/>
</map>

22
d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_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: greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas Pages: 1 -->
<svg width="334pt" height="143pt"
@@ -33,8 +33,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M39.09,-67.82C35.91,-77.3 47.05,-85.5 72.5,-85.5 87.61,-85.5 97.68,-82.61 102.7,-78.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="106.32,-79.41 105.91,-68.82 99.63,-77.35 106.32,-79.41"/>
<path fill="none" stroke="#63b8ff" d="M39.09,-67.82C35.91,-77.3 47.05,-85.5 72.5,-85.5 87.22,-85.5 97.14,-82.76 102.29,-78.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="105.57,-79.85 105.43,-69.25 98.93,-77.62 105.57,-79.85"/>
</a>
</g>
</g>
@@ -53,8 +53,8 @@
<g id="edge2_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M145.27,-66.27C153.48,-68.52 161.9,-70.82 170.22,-73.1"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.14,-76.71 179.71,-75.97 170.99,-69.96 169.14,-76.71"/>
<path fill="none" stroke="#63b8ff" d="M145.27,-66.27C153.3,-68.47 161.52,-70.72 169.67,-72.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="168.68,-76.31 179.25,-75.57 170.53,-69.56 168.68,-76.31"/>
</a>
</g>
</g>
@@ -71,8 +71,8 @@
<g id="edge4_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M145.27,-46.62C164.27,-46.62 184.38,-46.62 201.99,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="201.88,-50.13 211.88,-46.62 201.88,-43.13 201.88,-50.13"/>
<path fill="none" stroke="#63b8ff" d="M145.27,-46.62C164.09,-46.62 184,-46.62 201.49,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="201.37,-50.13 211.37,-46.63 201.37,-43.13 201.37,-50.13"/>
</a>
</g>
</g>
@@ -89,8 +89,8 @@
<g id="edge5_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M145.27,-31.79C163.23,-28.08 182.17,-24.16 199.06,-20.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="199.74,-23.9 208.83,-18.45 198.32,-17.04 199.74,-23.9"/>
<path fill="none" stroke="#63b8ff" d="M145.27,-31.79C163.06,-28.11 181.81,-24.24 198.57,-20.77"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="199.26,-24.2 208.34,-18.75 197.84,-17.35 199.26,-24.2"/>
</a>
</g>
</g>
@@ -98,8 +98,8 @@
<g id="edge3_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M220.09,-116.82C216.91,-126.3 228.05,-134.5 253.5,-134.5 268.61,-134.5 278.68,-131.61 283.7,-127.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="287.32,-128.41 286.91,-117.82 280.63,-126.35 287.32,-128.41"/>
<path fill="none" stroke="#63b8ff" d="M220.09,-116.82C216.91,-126.3 228.05,-134.5 253.5,-134.5 268.22,-134.5 278.14,-131.76 283.29,-127.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="286.57,-128.85 286.43,-118.25 279.93,-126.62 286.57,-128.85"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.6 KiB

After

Width:  |  Height:  |  Size: 5.6 KiB

22
d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_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: greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas Pages: 1 -->
<svg width="334pt" height="143pt"
@@ -23,8 +23,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M39.09,-67.82C35.91,-77.3 47.05,-85.5 72.5,-85.5 87.61,-85.5 97.68,-82.61 102.7,-78.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="106.32,-79.41 105.91,-68.82 99.63,-77.35 106.32,-79.41"/>
<path fill="none" stroke="#63b8ff" d="M39.09,-67.82C35.91,-77.3 47.05,-85.5 72.5,-85.5 87.22,-85.5 97.14,-82.76 102.29,-78.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="105.57,-79.85 105.43,-69.25 98.93,-77.62 105.57,-79.85"/>
</a>
</g>
</g>
@@ -43,8 +43,8 @@
<g id="edge2_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M145.27,-66.27C153.48,-68.52 161.9,-70.82 170.22,-73.1"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.14,-76.71 179.71,-75.97 170.99,-69.96 169.14,-76.71"/>
<path fill="none" stroke="#63b8ff" d="M145.27,-66.27C153.3,-68.47 161.52,-70.72 169.67,-72.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="168.68,-76.31 179.25,-75.57 170.53,-69.56 168.68,-76.31"/>
</a>
</g>
</g>
@@ -61,8 +61,8 @@
<g id="edge4_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M145.27,-46.62C164.27,-46.62 184.38,-46.62 201.99,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="201.88,-50.13 211.88,-46.62 201.88,-43.13 201.88,-50.13"/>
<path fill="none" stroke="#63b8ff" d="M145.27,-46.62C164.09,-46.62 184,-46.62 201.49,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="201.37,-50.13 211.37,-46.63 201.37,-43.13 201.37,-50.13"/>
</a>
</g>
</g>
@@ -79,8 +79,8 @@
<g id="edge5_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M145.27,-31.79C163.23,-28.08 182.17,-24.16 199.06,-20.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="199.74,-23.9 208.83,-18.45 198.32,-17.04 199.74,-23.9"/>
<path fill="none" stroke="#63b8ff" d="M145.27,-31.79C163.06,-28.11 181.81,-24.24 198.57,-20.77"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="199.26,-24.2 208.34,-18.75 197.84,-17.35 199.26,-24.2"/>
</a>
</g>
</g>
@@ -88,8 +88,8 @@
<g id="edge3_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M220.09,-116.82C216.91,-126.3 228.05,-134.5 253.5,-134.5 268.61,-134.5 278.68,-131.61 283.7,-127.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="287.32,-128.41 286.91,-117.82 280.63,-126.35 287.32,-128.41"/>
<path fill="none" stroke="#63b8ff" d="M220.09,-116.82C216.91,-126.3 228.05,-134.5 253.5,-134.5 268.22,-134.5 278.14,-131.76 283.29,-127.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="286.57,-128.85 286.43,-118.25 279.93,-126.62 286.57,-128.85"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.9 KiB

After

Width:  |  Height:  |  Size: 4.9 KiB

2
d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph.map
View File

@@ -1,4 +1,4 @@
<map id="greedy_algorithms::boruvkas_minimum_spanning_tree::findParent" name="greedy_algorithms::boruvkas_minimum_spanning_tree::findParent">
<area shape="rect" id="Node000001" title="Recursively returns the vertex&#39;s parent at the root of the tree." alt="" coords="5,29,199,85"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="64,29,64,19,71,10,84,5,102,3,123,5,136,13,133,17,121,11,102,8,85,10,74,15,69,21,69,29"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="64,29,64,19,71,10,84,5,102,3,123,5,135,12,133,17,121,10,102,8,85,10,74,15,69,21,69,29"/>
</map>

6
d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_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: greedy_algorithms::boruvkas_minimum_spanning_tree::findParent Pages: 1 -->
<svg width="153pt" height="68pt"
@@ -33,8 +33,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M45.74,-42.07C43.19,-51.55 52.11,-59.75 72.5,-59.75 84.61,-59.75 92.67,-56.86 96.69,-52.53"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="100.27,-53.61 99.26,-43.07 93.48,-51.94 100.27,-53.61"/>
<path fill="none" stroke="#63b8ff" d="M45.74,-42.07C43.19,-51.55 52.11,-59.75 72.5,-59.75 84.29,-59.75 92.24,-57.01 96.36,-52.86"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="99.66,-54.1 98.87,-43.53 92.9,-52.28 99.66,-54.1"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

6
d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_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: greedy_algorithms::boruvkas_minimum_spanning_tree::findParent Pages: 1 -->
<svg width="153pt" height="68pt"
@@ -23,8 +23,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M45.74,-42.07C43.19,-51.55 52.11,-59.75 72.5,-59.75 84.61,-59.75 92.67,-56.86 96.69,-52.53"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="100.27,-53.61 99.26,-43.07 93.48,-51.94 100.27,-53.61"/>
<path fill="none" stroke="#63b8ff" d="M45.74,-42.07C43.19,-51.55 52.11,-59.75 72.5,-59.75 84.29,-59.75 92.24,-57.01 96.36,-52.86"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="99.66,-54.1 98.87,-43.53 92.9,-52.28 99.66,-54.1"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

2
d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -3,5 +3,5 @@
<area shape="rect" id="Node000002" href="$d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,5,153,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,88,16,88,21,55,21"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="201,5,272,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,16,186,16,186,21,153,21"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,16,185,16,185,21,153,21"/>
</map>

10
d4/d6c/boruvkas__minimum__spanning__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="208pt" height="27pt"
@@ -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,-9.62C44.64,-9.62 53.57,-9.62 61.98,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.94,-13.13 71.94,-9.62 61.94,-6.13 61.94,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M37.14,-9.62C44.55,-9.62 53.37,-9.62 61.69,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-13.13 71.43,-9.63 61.43,-6.13 61.43,-13.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.94,-9.62C118.22,-9.62 126.89,-9.62 135.39,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="135.35,-13.13 145.35,-9.62 135.35,-6.13 135.35,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M110.94,-9.62C118.14,-9.62 126.69,-9.62 135.11,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.84,-13.13 144.83,-9.63 134.83,-6.13 134.84,-13.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

10
d4/d6c/boruvkas__minimum__spanning__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="208pt" height="27pt"
@@ -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,-9.62C44.64,-9.62 53.57,-9.62 61.98,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.94,-13.13 71.94,-9.62 61.94,-6.13 61.94,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M37.14,-9.62C44.55,-9.62 53.37,-9.62 61.69,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-13.13 71.43,-9.63 61.43,-6.13 61.43,-13.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.94,-9.62C118.22,-9.62 126.89,-9.62 135.39,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="135.35,-13.13 145.35,-9.62 135.35,-6.13 135.35,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M110.94,-9.62C118.14,-9.62 126.69,-9.62 135.11,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.84,-13.13 144.83,-9.63 134.83,-6.13 134.84,-13.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.5 KiB

After

Width:  |  Height:  |  Size: 2.5 KiB