backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-12 03:28:29 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 8b1eab204b

Browse Source
This commit is contained in:
realstealthninja
2024-11-04 12:43:05 +00:00
parent 4fb6e622e9
commit a7bccf7d01
6732 changed files with 153919 additions and 365711 deletions
Download Patch File Download Diff File Expand all files Collapse all files

98
d3/dae/dsu__path__compression_8cpp.html
View File

@@ -1,3 +1,4 @@
<!-- HTML header for doxygen 1.12.0-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
@@ -5,10 +6,15 @@
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures/dsu_path_compression.cpp File Reference</title>
<title>TheAlgorithms/C++: data_structures/dsu_path_compression.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
<script type="text/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
@@ -122,7 +139,9 @@ Include dependency graph for dsu_path_compression.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/de3/dsu__path__compression_8cpp__incl.svg" width="336" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><table class="memberdecls">
</div>
<p><a href="../../d3/dae/dsu__path__compression_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td></tr>
@@ -146,6 +165,8 @@ Functions</h2></td></tr>
<p>It is a very powerful data structure that keeps track of different clusters(sets) of elements, these sets are disjoint(doesnot have a common
element). Disjoint sets uses cases : for finding connected components in a graph, used in Kruskal's algorithm for finding <a class="el" href="../../d4/d12/namespace_minimum.html" title="Implementation of Minimum Edit Distance algorithm.">Minimum</a> Spanning tree. Operations that can be performed: 1) UnionSet(i,j): add(element i and j to the set) 2) findSet(i): returns the representative of the set to which i belogngs to. 3) get_max(i),get_min(i) : returns the maximum and minimum Below is the class-based approach which uses the heuristic of path compression. Using path compression in findSet(i),we are able to get to the representative of i in O(1) time. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AayushVyasKIIT" target="_blank">AayushVyasKIIT</a> </dd></dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../df/d28/dsu__union__rank_8cpp.html" title="DSU (Disjoint sets)">dsu_union_rank.cpp</a> </dd></dl>
<p class="definition">Definition in file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -166,24 +187,21 @@ element). Disjoint sets uses cases : for finding connected components in a graph
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<p>&lt; number of items</p>
<p>&lt; object of class disjoint sets</p>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00206">206</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 206</span> {</div>
<div class="line"><span class="lineno"> 207</span> uint64_t n = 10; <span class="comment">///&lt; number of items</span></div>
<div class="line"><span class="lineno"> 208</span> <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1); <span class="comment">///&lt; object of class disjoint sets</span></div>
<div class="line"><span class="lineno"> 207</span> uint64_t n = 10; </div>
<div class="line"><span class="lineno"> 208</span> <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1); </div>
<div class="line"><span class="lineno"> 209</span> </div>
<div class="line"><span class="lineno"> 210</span> <a class="code hl_function" href="#ae7880ce913f3058a35ff106d5be9e243">test1</a>(); <span class="comment">// run 1st test case</span></div>
<div class="line"><span class="lineno"> 211</span> <a class="code hl_function" href="#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(); <span class="comment">// run 2nd test case</span></div>
<div class="line"><span class="lineno"> 212</span> </div>
<div class="line"><span class="lineno"> 213</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 214</span>}</div>
<div class="ttc" id="aclassdsu_html"><div class="ttname"><a href="../../dd/d1f/classdsu.html">dsu</a></div><div class="ttdoc">Disjoint sets union data structure, class based representation.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:34</div></div>
<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:187</div></div>
<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:170</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="599" height="384"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
<div class="ttc" id="aclassdsu_html"><div class="ttname"><a href="../../dd/d1f/classdsu.html">dsu</a></div><div class="ttdoc">Disjoint sets union data structure, class based representation.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00034">dsu_path_compression.cpp:34</a></div></div>
<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00187">dsu_path_compression.cpp:187</a></div></div>
<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00170">dsu_path_compression.cpp:170</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="ae7880ce913f3058a35ff106d5be9e243" name="ae7880ce913f3058a35ff106d5be9e243"></a>
@@ -213,28 +231,23 @@ Here is the call graph for this function:</div>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p>&lt; number of items</p>
<p>&lt; object of class disjoint sets</p>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00170">170</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 170</span> {</div>
<div class="line"><span class="lineno"> 171</span> <span class="comment">// the minimum, maximum, and size of the set</span></div>
<div class="line"><span class="lineno"> 172</span> uint64_t n = 10; <span class="comment">///&lt; number of items</span></div>
<div class="line"><span class="lineno"> 173</span> <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1); <span class="comment">///&lt; object of class disjoint sets</span></div>
<div class="line"><span class="lineno"> 172</span> uint64_t n = 10; </div>
<div class="line"><span class="lineno"> 173</span> <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1); </div>
<div class="line"><span class="lineno"> 174</span> <span class="comment">// set 1</span></div>
<div class="line"><span class="lineno"> 175</span> d.UnionSet(1, 2); <span class="comment">// performs union operation on 1 and 2</span></div>
<div class="line"><span class="lineno"> 176</span> d.UnionSet(1, 4); <span class="comment">// performs union operation on 1 and 4</span></div>
<div class="line"><span class="lineno"> 177</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;uint64_t&gt;</a> ans = {1, 4, 3};</div>
<div class="line"><span class="lineno"> 177</span> vector&lt;uint64_t&gt; ans = {1, 4, 3};</div>
<div class="line"><span class="lineno"> 178</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; ans.size(); i++) {</div>
<div class="line"><span class="lineno"> 179</span> assert(d.get(4).at(i) == ans[i]); <span class="comment">// makes sure algorithm works fine</span></div>
<div class="line"><span class="lineno"> 180</span> }</div>
<div class="line"><span class="lineno"> 181</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;1st test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
<div class="line"><span class="lineno"> 181</span> cout &lt;&lt; <span class="stringliteral">&quot;1st test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
<div class="line"><span class="lineno"> 182</span>}</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:36</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg" width="502" height="384"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a45d94ead4cf4e1ff9f87c38bc99f59ae" name="a45d94ead4cf4e1ff9f87c38bc99f59ae"></a>
@@ -264,26 +277,23 @@ Here is the call graph for this function:</div>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p>&lt; number of items</p>
<p>&lt; object of class disjoint sets</p>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00187">187</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 187</span> {</div>
<div class="line"><span class="lineno"> 188</span> <span class="comment">// the minimum, maximum, and size of the set</span></div>
<div class="line"><span class="lineno"> 189</span> uint64_t n = 10; <span class="comment">///&lt; number of items</span></div>
<div class="line"><span class="lineno"> 190</span> <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1); <span class="comment">///&lt; object of class disjoint sets</span></div>
<div class="line"><span class="lineno"> 189</span> uint64_t n = 10; </div>
<div class="line"><span class="lineno"> 190</span> <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1); </div>
<div class="line"><span class="lineno"> 191</span> <span class="comment">// set 1</span></div>
<div class="line"><span class="lineno"> 192</span> d.UnionSet(3, 5);</div>
<div class="line"><span class="lineno"> 193</span> d.UnionSet(5, 6);</div>
<div class="line"><span class="lineno"> 194</span> d.UnionSet(5, 7);</div>
<div class="line"><span class="lineno"> 195</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;uint64_t&gt;</a> ans = {3, 7, 4};</div>
<div class="line"><span class="lineno"> 195</span> vector&lt;uint64_t&gt; ans = {3, 7, 4};</div>
<div class="line"><span class="lineno"> 196</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; ans.size(); i++) {</div>
<div class="line"><span class="lineno"> 197</span> assert(d.get(3).at(i) == ans[i]); <span class="comment">// makes sure algorithm works fine</span></div>
<div class="line"><span class="lineno"> 198</span> }</div>
<div class="line"><span class="lineno"> 199</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
<div class="line"><span class="lineno"> 199</span> cout &lt;&lt; <span class="stringliteral">&quot;2nd test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
<div class="line"><span class="lineno"> 200</span>}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg" width="502" height="384"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->

28
d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map
View File

@@ -1,28 +0,0 @@
<map id="test2" name="test2">
<area shape="rect" id="Node000001" title="Self&#45;implementations, 2nd test." alt="" coords="5,179,56,204"/>
<area shape="rect" id="Node000002" href="$dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="122,80,190,106"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="47,176,125,113,128,118,50,180"/>
<area shape="rect" id="Node000007" href="$dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="104,229,208,255"/>
<area shape="poly" id="edge9_Node000001_Node000007" title=" " alt="" coords="57,199,109,221,107,226,55,204"/>
<area shape="rect" id="Node000003" href="$dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="256,5,356,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="182,77,255,40,263,36,265,41,257,45,184,82"/>
<area shape="rect" id="Node000005" href="$dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="258,55,354,80"/>
<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="190,85,243,75,243,81,191,90"/>
<area shape="rect" id="Node000006" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="269,104,343,130"/>
<area shape="poly" id="edge7_Node000002_Node000006" title=" " alt="" coords="191,96,254,106,254,111,190,101"/>
<area shape="rect" id="Node000004" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="404,104,496,130"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="339,29,358,40,425,92,422,96,355,44,336,34"/>
<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="425,105,420,95,423,86,433,80,450,77,468,80,477,87,474,91,466,85,450,83,435,85,428,89,426,95,430,102"/>
<area shape="poly" id="edge6_Node000005_Node000004" title=" " alt="" coords="347,78,397,96,395,101,345,83"/>
<area shape="poly" id="edge8_Node000006_Node000004" title=" " alt="" coords="344,114,389,114,389,120,344,120"/>
<area shape="poly" id="edge10_Node000007_Node000004" title=" " alt="" coords="181,226,255,190,397,133,399,138,257,195,184,231"/>
<area shape="rect" id="Node000008" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="259,205,353,231"/>
<area shape="poly" id="edge11_Node000007_Node000008" title=" " alt="" coords="208,231,243,225,244,231,209,236"/>
<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="270,255,342,280"/>
<area shape="poly" id="edge13_Node000007_Node000009" title=" " alt="" coords="209,248,255,256,254,262,208,254"/>
<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="272,304,340,330"/>
<area shape="poly" id="edge14_Node000007_Node000010" title=" " alt="" coords="184,253,257,290,265,294,263,299,255,295,182,258"/>
<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="267,353,345,379"/>
<area shape="poly" id="edge15_Node000007_Node000011" title=" " alt="" coords="170,254,207,295,258,340,262,343,259,348,254,344,203,299,166,257"/>
<area shape="poly" id="edge12_Node000008_Node000004" title=" " alt="" coords="327,203,355,184,418,137,421,142,358,188,330,207"/>
</map>

1
d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5
View File

@@ -1 +0,0 @@
8cd3cfacef1c102f7424cb9f65c51fef

272
d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg
View File

@@ -1,272 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: test2 Pages: 1 -->
<svg width="376pt" height="288pt"
viewBox="0.00 0.00 375.75 288.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 284.25)">
<title>test2</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Self&#45;implementations, 2nd test.">
<polygon fill="#999999" stroke="#666666" points="37.75,-150.25 0,-150.25 0,-131 37.75,-131 37.75,-150.25"/>
<text text-anchor="middle" x="18.88" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
<polygon fill="white" stroke="#666666" points="138.5,-224.25 87.25,-224.25 87.25,-205 138.5,-205 138.5,-224.25"/>
<text text-anchor="middle" x="112.88" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.28,-150.6C47.23,-162.63 72.6,-183.03 90.68,-197.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.21,-200.08 98.19,-203.62 92.59,-194.62 88.21,-200.08"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
<polygon fill="white" stroke="#666666" points="152,-112.25 73.75,-112.25 73.75,-93 152,-93 152,-112.25"/>
<text text-anchor="middle" x="112.88" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge9_Node000001_Node000007" class="edge">
<title>Node1&#45;&gt;Node7</title>
<g id="a_edge9_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M38.05,-133.12C49.21,-128.51 63.86,-122.46 77.17,-116.96"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="78.16,-120.34 86.07,-113.29 75.49,-113.87 78.16,-120.34"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="263.25,-280.25 188,-280.25 188,-261 263.25,-261 263.25,-280.25"/>
<text text-anchor="middle" x="225.62" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M133.34,-224.72C148.26,-232.43 169.39,-243.28 188,-252.62 189.95,-253.6 191.95,-254.6 193.98,-255.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="192.19,-258.63 202.7,-259.92 195.29,-252.36 192.19,-258.63"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="261.75,-243.25 189.5,-243.25 189.5,-224 261.75,-224 261.75,-243.25"/>
<text text-anchor="middle" x="225.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge5_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M138.73,-218.89C150.39,-220.89 164.67,-223.34 178.22,-225.66"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="177.41,-229.08 187.86,-227.32 178.6,-222.18 177.41,-229.08"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="253.5,-206.25 197.75,-206.25 197.75,-187 253.5,-187 253.5,-206.25"/>
<text text-anchor="middle" x="225.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node6 -->
<g id="edge7_Node000002_Node000006" class="edge">
<title>Node2&#45;&gt;Node6</title>
<g id="a_edge7_Node000002_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M138.73,-210.59C152.79,-208.3 170.67,-205.39 186.47,-202.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="186.72,-206.33 196.03,-201.27 185.6,-199.42 186.72,-206.33"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="#666666" points="367.75,-206.25 299.25,-206.25 299.25,-187 367.75,-187 367.75,-206.25"/>
<text text-anchor="middle" x="333.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<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="M249.14,-260.55C253.91,-258.14 258.83,-255.45 263.25,-252.62 281.25,-241.13 299.98,-225.74 313.42,-214"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="315.52,-216.81 320.67,-207.55 310.87,-211.58 315.52,-216.81"/>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node4 -->
<g id="edge4_Node000004_Node000004" class="edge">
<title>Node4&#45;&gt;Node4</title>
<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M316.61,-206.54C308.91,-215.15 314.54,-224.25 333.5,-224.25 343.87,-224.25 350.25,-221.53 352.65,-217.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="356.11,-217.12 350.69,-208.02 349.25,-218.52 356.11,-217.12"/>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge6_Node000005_Node000004" class="edge">
<title>Node5&#45;&gt;Node4</title>
<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M255.56,-223.51C267.11,-219.48 280.6,-214.76 293.03,-210.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="293.89,-213.83 302.18,-207.22 291.58,-207.22 293.89,-213.83"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge8_Node000006_Node000004" class="edge">
<title>Node6&#45;&gt;Node4</title>
<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M253.89,-196.62C264.18,-196.62 276.19,-196.62 287.67,-196.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="287.38,-200.13 297.38,-196.63 287.38,-193.13 287.38,-200.13"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node4 -->
<g id="edge10_Node000007_Node000004" class="edge">
<title>Node7&#45;&gt;Node4</title>
<g id="a_edge10_Node000007_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M132.85,-112.67C147.7,-120.39 168.95,-131.13 188,-139.62 223.49,-155.45 264.81,-171.52 294.15,-182.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="292.76,-185.76 303.35,-185.98 295.21,-179.2 292.76,-185.76"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="white" stroke="#666666" points="261,-130.25 190.25,-130.25 190.25,-111 261,-111 261,-130.25"/>
<text text-anchor="middle" x="225.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge11_Node000007_Node000008" class="edge">
<title>Node7&#45;&gt;Node8</title>
<g id="a_edge11_Node000007_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M152.3,-108.87C160.81,-110.25 169.92,-111.73 178.7,-113.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="178.05,-116.6 188.48,-114.75 179.17,-109.69 178.05,-116.6"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="252.75,-93.25 198.5,-93.25 198.5,-74 252.75,-74 252.75,-93.25"/>
<text text-anchor="middle" x="225.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node9 -->
<g id="edge13_Node000007_Node000009" class="edge">
<title>Node7&#45;&gt;Node9</title>
<g id="a_edge13_Node000007_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M152.3,-96.03C163.52,-94.11 175.77,-92.01 186.94,-90.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="187.36,-93.57 196.62,-88.43 186.17,-86.67 187.36,-93.57"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="251.25,-56.25 200,-56.25 200,-37 251.25,-37 251.25,-56.25"/>
<text text-anchor="middle" x="225.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node10 -->
<g id="edge14_Node000007_Node000010" class="edge">
<title>Node7&#45;&gt;Node10</title>
<g id="a_edge14_Node000007_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M133.34,-92.53C148.26,-84.82 169.39,-73.97 188,-64.62 189.95,-63.65 191.95,-62.65 193.98,-61.64"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.29,-64.89 202.7,-57.33 192.19,-58.62 195.29,-64.89"/>
</a>
</g>
</g>
<!-- Node11 -->
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="255,-19.25 196.25,-19.25 196.25,0 255,0 255,-19.25"/>
<text text-anchor="middle" x="225.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node11 -->
<g id="edge15_Node000007_Node000011" class="edge">
<title>Node7&#45;&gt;Node11</title>
<g id="a_edge15_Node000007_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.89,-92.58C134.62,-77.11 160.81,-47.2 188,-27.62 189.13,-26.81 190.31,-26.01 191.51,-25.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="192.85,-28.5 199.78,-20.49 189.36,-22.43 192.85,-28.5"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node4 -->
<g id="edge12_Node000008_Node000004" class="edge">
<title>Node8&#45;&gt;Node4</title>
<g id="a_edge12_Node000008_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M242.46,-130.68C248.96,-134.9 256.53,-139.91 263.25,-144.62 279.39,-155.96 297.17,-169.33 310.67,-179.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="308.41,-182.34 318.46,-185.67 312.68,-176.8 308.41,-182.34"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 13 KiB

246
d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg
View File

@@ -1,246 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: test2 Pages: 1 -->
<svg width="376pt" height="288pt"
viewBox="0.00 0.00 375.75 288.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 284.25)">
<title>test2</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Self&#45;implementations, 2nd test.">
<polygon fill="#999999" stroke="#666666" points="37.75,-150.25 0,-150.25 0,-131 37.75,-131 37.75,-150.25"/>
<text text-anchor="middle" x="18.88" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
<polygon fill="white" stroke="#666666" points="138.5,-224.25 87.25,-224.25 87.25,-205 138.5,-205 138.5,-224.25"/>
<text text-anchor="middle" x="112.88" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.28,-150.6C47.23,-162.63 72.6,-183.03 90.68,-197.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.21,-200.08 98.19,-203.62 92.59,-194.62 88.21,-200.08"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
<polygon fill="white" stroke="#666666" points="152,-112.25 73.75,-112.25 73.75,-93 152,-93 152,-112.25"/>
<text text-anchor="middle" x="112.88" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge9_Node000001_Node000007" class="edge">
<title>Node1&#45;&gt;Node7</title>
<g id="a_edge9_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M38.05,-133.12C49.21,-128.51 63.86,-122.46 77.17,-116.96"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="78.16,-120.34 86.07,-113.29 75.49,-113.87 78.16,-120.34"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="263.25,-280.25 188,-280.25 188,-261 263.25,-261 263.25,-280.25"/>
<text text-anchor="middle" x="225.62" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M133.34,-224.72C148.26,-232.43 169.39,-243.28 188,-252.62 189.95,-253.6 191.95,-254.6 193.98,-255.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="192.19,-258.63 202.7,-259.92 195.29,-252.36 192.19,-258.63"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="261.75,-243.25 189.5,-243.25 189.5,-224 261.75,-224 261.75,-243.25"/>
<text text-anchor="middle" x="225.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge5_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M138.73,-218.89C150.39,-220.89 164.67,-223.34 178.22,-225.66"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="177.41,-229.08 187.86,-227.32 178.6,-222.18 177.41,-229.08"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="253.5,-206.25 197.75,-206.25 197.75,-187 253.5,-187 253.5,-206.25"/>
<text text-anchor="middle" x="225.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node6 -->
<g id="edge7_Node000002_Node000006" class="edge">
<title>Node2&#45;&gt;Node6</title>
<g id="a_edge7_Node000002_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M138.73,-210.59C152.79,-208.3 170.67,-205.39 186.47,-202.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="186.72,-206.33 196.03,-201.27 185.6,-199.42 186.72,-206.33"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="#666666" points="367.75,-206.25 299.25,-206.25 299.25,-187 367.75,-187 367.75,-206.25"/>
<text text-anchor="middle" x="333.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<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="M249.14,-260.55C253.91,-258.14 258.83,-255.45 263.25,-252.62 281.25,-241.13 299.98,-225.74 313.42,-214"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="315.52,-216.81 320.67,-207.55 310.87,-211.58 315.52,-216.81"/>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node4 -->
<g id="edge4_Node000004_Node000004" class="edge">
<title>Node4&#45;&gt;Node4</title>
<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M316.61,-206.54C308.91,-215.15 314.54,-224.25 333.5,-224.25 343.87,-224.25 350.25,-221.53 352.65,-217.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="356.11,-217.12 350.69,-208.02 349.25,-218.52 356.11,-217.12"/>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge6_Node000005_Node000004" class="edge">
<title>Node5&#45;&gt;Node4</title>
<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M255.56,-223.51C267.11,-219.48 280.6,-214.76 293.03,-210.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="293.89,-213.83 302.18,-207.22 291.58,-207.22 293.89,-213.83"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge8_Node000006_Node000004" class="edge">
<title>Node6&#45;&gt;Node4</title>
<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M253.89,-196.62C264.18,-196.62 276.19,-196.62 287.67,-196.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="287.38,-200.13 297.38,-196.63 287.38,-193.13 287.38,-200.13"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node4 -->
<g id="edge10_Node000007_Node000004" class="edge">
<title>Node7&#45;&gt;Node4</title>
<g id="a_edge10_Node000007_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M132.85,-112.67C147.7,-120.39 168.95,-131.13 188,-139.62 223.49,-155.45 264.81,-171.52 294.15,-182.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="292.76,-185.76 303.35,-185.98 295.21,-179.2 292.76,-185.76"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="white" stroke="#666666" points="261,-130.25 190.25,-130.25 190.25,-111 261,-111 261,-130.25"/>
<text text-anchor="middle" x="225.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge11_Node000007_Node000008" class="edge">
<title>Node7&#45;&gt;Node8</title>
<g id="a_edge11_Node000007_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M152.3,-108.87C160.81,-110.25 169.92,-111.73 178.7,-113.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="178.05,-116.6 188.48,-114.75 179.17,-109.69 178.05,-116.6"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="252.75,-93.25 198.5,-93.25 198.5,-74 252.75,-74 252.75,-93.25"/>
<text text-anchor="middle" x="225.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node9 -->
<g id="edge13_Node000007_Node000009" class="edge">
<title>Node7&#45;&gt;Node9</title>
<g id="a_edge13_Node000007_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M152.3,-96.03C163.52,-94.11 175.77,-92.01 186.94,-90.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="187.36,-93.57 196.62,-88.43 186.17,-86.67 187.36,-93.57"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="251.25,-56.25 200,-56.25 200,-37 251.25,-37 251.25,-56.25"/>
<text text-anchor="middle" x="225.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node10 -->
<g id="edge14_Node000007_Node000010" class="edge">
<title>Node7&#45;&gt;Node10</title>
<g id="a_edge14_Node000007_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M133.34,-92.53C148.26,-84.82 169.39,-73.97 188,-64.62 189.95,-63.65 191.95,-62.65 193.98,-61.64"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.29,-64.89 202.7,-57.33 192.19,-58.62 195.29,-64.89"/>
</a>
</g>
</g>
<!-- Node11 -->
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="255,-19.25 196.25,-19.25 196.25,0 255,0 255,-19.25"/>
<text text-anchor="middle" x="225.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node11 -->
<g id="edge15_Node000007_Node000011" class="edge">
<title>Node7&#45;&gt;Node11</title>
<g id="a_edge15_Node000007_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.89,-92.58C134.62,-77.11 160.81,-47.2 188,-27.62 189.13,-26.81 190.31,-26.01 191.51,-25.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="192.85,-28.5 199.78,-20.49 189.36,-22.43 192.85,-28.5"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node4 -->
<g id="edge12_Node000008_Node000004" class="edge">
<title>Node8&#45;&gt;Node4</title>
<g id="a_edge12_Node000008_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M242.46,-130.68C248.96,-134.9 256.53,-139.91 263.25,-144.62 279.39,-155.96 297.17,-169.33 310.67,-179.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="308.41,-182.34 318.46,-185.67 312.68,-176.8 308.41,-182.34"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 12 KiB

34
d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -1,34 +0,0 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,155,55,180"/>
<area shape="rect" id="Node000002" href="$d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" title="Self&#45;test implementations, 1st test." alt="" coords="103,129,153,155"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,159,87,150,89,155,56,164"/>
<area shape="rect" id="Node000013" href="$d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" title="Self&#45;implementations, 2nd test." alt="" coords="103,179,153,204"/>
<area shape="poly" id="edge17_Node000001_Node000013" title=" " alt="" coords="56,171,89,179,87,184,54,176"/>
<area shape="rect" id="Node000003" href="$dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="219,104,287,130"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,135,203,124,204,129,154,140"/>
<area shape="rect" id="Node000008" href="$dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="201,203,305,228"/>
<area shape="poly" id="edge10_Node000002_Node000008" title=" " alt="" coords="153,153,218,192,215,197,150,158"/>
<area shape="rect" id="Node000004" href="$dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="353,55,454,80"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="287,103,347,83,348,88,288,108"/>
<area shape="rect" id="Node000006" href="$dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="355,104,452,130"/>
<area shape="poly" id="edge6_Node000003_Node000006" title=" " alt="" coords="288,114,340,114,340,120,288,120"/>
<area shape="rect" id="Node000007" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="366,5,441,31"/>
<area shape="poly" id="edge8_Node000003_Node000007" title=" " alt="" coords="268,102,305,72,352,40,358,36,361,41,355,44,309,76,272,106"/>
<area shape="rect" id="Node000005" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="502,104,593,130"/>
<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="444,78,494,96,492,101,443,83"/>
<area shape="poly" id="edge5_Node000005_Node000005" title=" " alt="" coords="522,105,518,95,521,86,531,80,547,77,565,80,574,87,571,91,563,85,547,83,533,85,525,89,523,95,527,102"/>
<area shape="poly" id="edge7_Node000006_Node000005" title=" " alt="" coords="452,114,486,114,486,120,452,120"/>
<area shape="poly" id="edge9_Node000007_Node000005" title=" " alt="" coords="436,29,455,40,522,92,519,96,452,44,434,34"/>
<area shape="poly" id="edge11_Node000008_Node000005" title=" " alt="" coords="268,227,304,260,328,276,354,288,382,297,405,301,427,299,452,288,470,274,486,258,511,219,528,179,538,144,543,145,533,181,516,222,490,261,474,278,455,292,428,304,405,307,381,302,352,293,326,280,301,264,265,231"/>
<area shape="rect" id="Node000009" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="356,353,451,379"/>
<area shape="poly" id="edge12_Node000008_Node000009" title=" " alt="" coords="266,227,302,276,355,332,368,342,365,346,352,336,298,279,261,230"/>
<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="367,203,440,228"/>
<area shape="poly" id="edge14_Node000008_Node000010" title=" " alt="" coords="306,213,352,213,352,218,306,218"/>
<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="369,252,438,278"/>
<area shape="poly" id="edge15_Node000008_Node000011" title=" " alt="" coords="296,226,356,246,354,252,294,232"/>
<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="364,153,443,179"/>
<area shape="poly" id="edge16_Node000008_Node000012" title=" " alt="" coords="294,199,349,181,350,186,296,205"/>
<area shape="poly" id="edge13_Node000009_Node000005" title=" " alt="" coords="430,351,452,332,484,285,508,233,526,184,537,144,542,145,531,186,513,235,488,288,456,336,433,355"/>
<area shape="poly" id="edge18_Node000013_Node000003" title=" " alt="" coords="150,176,215,136,218,141,152,180"/>
<area shape="poly" id="edge19_Node000013_Node000008" title=" " alt="" coords="154,194,187,200,186,205,153,199"/>
</map>

1
d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +0,0 @@
c77bb4e5ca7dce7480d4b794ee20bfef

326
d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,326 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: main Pages: 1 -->
<svg width="449pt" height="288pt"
viewBox="0.00 0.00 448.75 288.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 284.25)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-168.25 0,-168.25 0,-149 37,-149 37,-168.25"/>
<text text-anchor="middle" x="18.5" y="-154.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="Self&#45;test implementations, 1st test.">
<polygon fill="white" stroke="#666666" points="110.75,-187.25 73,-187.25 73,-168 110.75,-168 110.75,-187.25"/>
<text text-anchor="middle" x="91.88" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.14,-163.32C44.64,-165.32 53.57,-167.69 61.98,-169.93"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="60.91,-173.27 71.48,-172.46 62.71,-166.51 60.91,-173.27"/>
</a>
</g>
</g>
<!-- Node13 -->
<g id="Node000013" class="node">
<title>Node13</title>
<g id="a_Node000013"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
<polygon fill="white" stroke="#666666" points="110.75,-150.25 73,-150.25 73,-131 110.75,-131 110.75,-150.25"/>
<text text-anchor="middle" x="91.88" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node13 -->
<g id="edge17_Node000001_Node000013" class="edge">
<title>Node1&#45;&gt;Node13</title>
<g id="a_edge17_Node000001_Node000013"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.14,-154.18C44.64,-152.29 53.57,-150.03 61.98,-147.91"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.63,-151.36 71.47,-145.52 60.92,-144.57 62.63,-151.36"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
<polygon fill="white" stroke="#666666" points="211.5,-206.25 160.25,-206.25 160.25,-187 211.5,-187 211.5,-206.25"/>
<text text-anchor="middle" x="185.88" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.05,-181.38C121.82,-183.6 135.86,-186.5 148.8,-189.17"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="147.79,-192.54 158.29,-191.13 149.2,-185.68 147.79,-192.54"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
<polygon fill="white" stroke="#666666" points="225,-132.25 146.75,-132.25 146.75,-113 225,-113 225,-132.25"/>
<text text-anchor="middle" x="185.88" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node8 -->
<g id="edge10_Node000002_Node000008" class="edge">
<title>Node2&#45;&gt;Node8</title>
<g id="a_edge10_Node000002_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M109.75,-167.54C123.37,-159.4 142.77,-147.8 158.44,-138.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="160.02,-141.56 166.81,-133.43 156.43,-135.55 160.02,-141.56"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="336.25,-243.25 261,-243.25 261,-224 336.25,-224 336.25,-243.25"/>
<text text-anchor="middle" x="298.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<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="M211.73,-204.93C224.97,-209.35 241.6,-214.91 256.68,-219.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="255.3,-223.17 265.89,-223.02 257.52,-216.54 255.3,-223.17"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="334.75,-206.25 262.5,-206.25 262.5,-187 334.75,-187 334.75,-206.25"/>
<text text-anchor="middle" x="298.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge6_Node000003_Node000006" class="edge">
<title>Node3&#45;&gt;Node6</title>
<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M211.73,-196.62C223.39,-196.62 237.67,-196.62 251.22,-196.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="250.84,-200.13 260.84,-196.63 250.84,-193.13 250.84,-200.13"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="326.5,-280.25 270.75,-280.25 270.75,-261 326.5,-261 326.5,-280.25"/>
<text text-anchor="middle" x="298.62" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node7 -->
<g id="edge8_Node000003_Node000007" class="edge">
<title>Node3&#45;&gt;Node7</title>
<g id="a_edge8_Node000003_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M198.45,-206.47C212.63,-218.27 237.65,-238.25 261,-252.62 262.43,-253.51 263.92,-254.38 265.43,-255.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="263.76,-258.32 274.23,-259.92 267.04,-252.14 263.76,-258.32"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="#666666" points="440.75,-206.25 372.25,-206.25 372.25,-187 440.75,-187 440.75,-206.25"/>
<text text-anchor="middle" x="406.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M328.56,-223.51C340.11,-219.48 353.6,-214.76 366.03,-210.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="366.89,-213.83 375.18,-207.22 364.58,-207.22 366.89,-213.83"/>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node5 -->
<g id="edge5_Node000005_Node000005" class="edge">
<title>Node5&#45;&gt;Node5</title>
<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M389.61,-206.54C381.91,-215.15 387.54,-224.25 406.5,-224.25 416.87,-224.25 423.25,-221.53 425.65,-217.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="429.11,-217.12 423.69,-208.02 422.25,-218.52 429.11,-217.12"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node5 -->
<g id="edge7_Node000006_Node000005" class="edge">
<title>Node6&#45;&gt;Node5</title>
<g id="a_edge7_Node000006_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M335.17,-196.62C343.35,-196.62 352.15,-196.62 360.67,-196.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="360.5,-200.13 370.5,-196.63 360.5,-193.13 360.5,-200.13"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node5 -->
<g id="edge9_Node000007_Node000005" class="edge">
<title>Node7&#45;&gt;Node5</title>
<g id="a_edge9_Node000007_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M322.14,-260.55C326.91,-258.14 331.83,-255.45 336.25,-252.62 354.25,-241.13 372.98,-225.74 386.42,-214"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="388.52,-216.81 393.67,-207.55 383.87,-211.58 388.52,-216.81"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node5 -->
<g id="edge11_Node000008_Node000005" class="edge">
<title>Node8&#45;&gt;Node5</title>
<g id="a_edge11_Node000008_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M195.74,-112.74C208.58,-99.26 233.78,-75.75 261,-66.62 292.71,-55.99 307.58,-49.41 336.25,-66.62 375.95,-90.46 394.13,-145.6 401.38,-175.85"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="397.89,-176.29 403.45,-185.31 404.73,-174.79 397.89,-176.29"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="white" stroke="#666666" points="334,-19.25 263.25,-19.25 263.25,0 334,0 334,-19.25"/>
<text text-anchor="middle" x="298.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node9 -->
<g id="edge12_Node000008_Node000009" class="edge">
<title>Node8&#45;&gt;Node9</title>
<g id="a_edge12_Node000008_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M193.62,-112.72C205.75,-95.37 232.63,-58.92 261,-33.62 263.98,-30.96 267.29,-28.38 270.65,-25.96"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="272.48,-28.95 278.84,-20.47 268.58,-23.14 272.48,-28.95"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="325.75,-132.25 271.5,-132.25 271.5,-113 325.75,-113 325.75,-132.25"/>
<text text-anchor="middle" x="298.62" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node10 -->
<g id="edge14_Node000008_Node000010" class="edge">
<title>Node8&#45;&gt;Node10</title>
<g id="a_edge14_Node000008_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M225.3,-122.62C236.52,-122.62 248.77,-122.62 259.94,-122.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="259.6,-126.13 269.6,-122.63 259.6,-119.13 259.6,-126.13"/>
</a>
</g>
</g>
<!-- Node11 -->
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="324.25,-95.25 273,-95.25 273,-76 324.25,-76 324.25,-95.25"/>
<text text-anchor="middle" x="298.62" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node11 -->
<g id="edge15_Node000008_Node000011" class="edge">
<title>Node8&#45;&gt;Node11</title>
<g id="a_edge15_Node000008_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M217.14,-112.51C231.02,-107.88 247.57,-102.35 262.05,-97.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="262.82,-100.94 271.2,-94.45 260.6,-94.3 262.82,-100.94"/>
</a>
</g>
</g>
<!-- Node12 -->
<g id="Node000012" class="node">
<title>Node12</title>
<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="328,-169.25 269.25,-169.25 269.25,-150 328,-150 328,-169.25"/>
<text text-anchor="middle" x="298.62" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node12 -->
<g id="edge16_Node000008_Node000012" class="edge">
<title>Node8&#45;&gt;Node12</title>
<g id="a_edge16_Node000008_Node000012"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M217.14,-132.74C229.75,-136.95 244.56,-141.9 258.02,-146.39"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="256.89,-149.71 267.49,-149.56 259.11,-143.07 256.89,-149.71"/>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node5 -->
<g id="edge13_Node000009_Node000005" class="edge">
<title>Node9&#45;&gt;Node5</title>
<g id="a_edge13_Node000009_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M319.56,-19.71C325.51,-23.45 331.67,-28.14 336.25,-33.62 372.62,-77.14 392.53,-142.56 400.82,-175.73"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="397.37,-176.36 403.09,-185.29 404.18,-174.75 397.37,-176.36"/>
</a>
</g>
</g>
<!-- Node13&#45;&gt;Node3 -->
<g id="edge18_Node000013_Node000003" class="edge">
<title>Node13&#45;&gt;Node3</title>
<g id="a_edge18_Node000013_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M109.32,-150.64C122.97,-158.95 142.65,-170.92 158.5,-180.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.6,-183.51 166.97,-185.72 160.24,-177.54 156.6,-183.51"/>
</a>
</g>
</g>
<!-- Node13&#45;&gt;Node8 -->
<g id="edge19_Node000013_Node000008" class="edge">
<title>Node13&#45;&gt;Node8</title>
<g id="a_edge19_Node000013_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.05,-137.07C118.19,-135.67 126.77,-133.99 135.51,-132.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="135.95,-135.76 145.09,-130.41 134.6,-128.89 135.95,-135.76"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 15 KiB

300
d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
View File

@@ -1,300 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: main Pages: 1 -->
<svg width="449pt" height="288pt"
viewBox="0.00 0.00 448.75 288.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 284.25)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-168.25 0,-168.25 0,-149 37,-149 37,-168.25"/>
<text text-anchor="middle" x="18.5" y="-154.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="Self&#45;test implementations, 1st test.">
<polygon fill="white" stroke="#666666" points="110.75,-187.25 73,-187.25 73,-168 110.75,-168 110.75,-187.25"/>
<text text-anchor="middle" x="91.88" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.14,-163.32C44.64,-165.32 53.57,-167.69 61.98,-169.93"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="60.91,-173.27 71.48,-172.46 62.71,-166.51 60.91,-173.27"/>
</a>
</g>
</g>
<!-- Node13 -->
<g id="Node000013" class="node">
<title>Node13</title>
<g id="a_Node000013"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
<polygon fill="white" stroke="#666666" points="110.75,-150.25 73,-150.25 73,-131 110.75,-131 110.75,-150.25"/>
<text text-anchor="middle" x="91.88" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node13 -->
<g id="edge17_Node000001_Node000013" class="edge">
<title>Node1&#45;&gt;Node13</title>
<g id="a_edge17_Node000001_Node000013"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.14,-154.18C44.64,-152.29 53.57,-150.03 61.98,-147.91"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.63,-151.36 71.47,-145.52 60.92,-144.57 62.63,-151.36"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
<polygon fill="white" stroke="#666666" points="211.5,-206.25 160.25,-206.25 160.25,-187 211.5,-187 211.5,-206.25"/>
<text text-anchor="middle" x="185.88" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.05,-181.38C121.82,-183.6 135.86,-186.5 148.8,-189.17"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="147.79,-192.54 158.29,-191.13 149.2,-185.68 147.79,-192.54"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
<polygon fill="white" stroke="#666666" points="225,-132.25 146.75,-132.25 146.75,-113 225,-113 225,-132.25"/>
<text text-anchor="middle" x="185.88" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node8 -->
<g id="edge10_Node000002_Node000008" class="edge">
<title>Node2&#45;&gt;Node8</title>
<g id="a_edge10_Node000002_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M109.75,-167.54C123.37,-159.4 142.77,-147.8 158.44,-138.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="160.02,-141.56 166.81,-133.43 156.43,-135.55 160.02,-141.56"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="336.25,-243.25 261,-243.25 261,-224 336.25,-224 336.25,-243.25"/>
<text text-anchor="middle" x="298.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<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="M211.73,-204.93C224.97,-209.35 241.6,-214.91 256.68,-219.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="255.3,-223.17 265.89,-223.02 257.52,-216.54 255.3,-223.17"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="334.75,-206.25 262.5,-206.25 262.5,-187 334.75,-187 334.75,-206.25"/>
<text text-anchor="middle" x="298.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge6_Node000003_Node000006" class="edge">
<title>Node3&#45;&gt;Node6</title>
<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M211.73,-196.62C223.39,-196.62 237.67,-196.62 251.22,-196.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="250.84,-200.13 260.84,-196.63 250.84,-193.13 250.84,-200.13"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="326.5,-280.25 270.75,-280.25 270.75,-261 326.5,-261 326.5,-280.25"/>
<text text-anchor="middle" x="298.62" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node7 -->
<g id="edge8_Node000003_Node000007" class="edge">
<title>Node3&#45;&gt;Node7</title>
<g id="a_edge8_Node000003_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M198.45,-206.47C212.63,-218.27 237.65,-238.25 261,-252.62 262.43,-253.51 263.92,-254.38 265.43,-255.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="263.76,-258.32 274.23,-259.92 267.04,-252.14 263.76,-258.32"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="#666666" points="440.75,-206.25 372.25,-206.25 372.25,-187 440.75,-187 440.75,-206.25"/>
<text text-anchor="middle" x="406.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M328.56,-223.51C340.11,-219.48 353.6,-214.76 366.03,-210.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="366.89,-213.83 375.18,-207.22 364.58,-207.22 366.89,-213.83"/>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node5 -->
<g id="edge5_Node000005_Node000005" class="edge">
<title>Node5&#45;&gt;Node5</title>
<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M389.61,-206.54C381.91,-215.15 387.54,-224.25 406.5,-224.25 416.87,-224.25 423.25,-221.53 425.65,-217.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="429.11,-217.12 423.69,-208.02 422.25,-218.52 429.11,-217.12"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node5 -->
<g id="edge7_Node000006_Node000005" class="edge">
<title>Node6&#45;&gt;Node5</title>
<g id="a_edge7_Node000006_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M335.17,-196.62C343.35,-196.62 352.15,-196.62 360.67,-196.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="360.5,-200.13 370.5,-196.63 360.5,-193.13 360.5,-200.13"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node5 -->
<g id="edge9_Node000007_Node000005" class="edge">
<title>Node7&#45;&gt;Node5</title>
<g id="a_edge9_Node000007_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M322.14,-260.55C326.91,-258.14 331.83,-255.45 336.25,-252.62 354.25,-241.13 372.98,-225.74 386.42,-214"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="388.52,-216.81 393.67,-207.55 383.87,-211.58 388.52,-216.81"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node5 -->
<g id="edge11_Node000008_Node000005" class="edge">
<title>Node8&#45;&gt;Node5</title>
<g id="a_edge11_Node000008_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M195.74,-112.74C208.58,-99.26 233.78,-75.75 261,-66.62 292.71,-55.99 307.58,-49.41 336.25,-66.62 375.95,-90.46 394.13,-145.6 401.38,-175.85"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="397.89,-176.29 403.45,-185.31 404.73,-174.79 397.89,-176.29"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="white" stroke="#666666" points="334,-19.25 263.25,-19.25 263.25,0 334,0 334,-19.25"/>
<text text-anchor="middle" x="298.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node9 -->
<g id="edge12_Node000008_Node000009" class="edge">
<title>Node8&#45;&gt;Node9</title>
<g id="a_edge12_Node000008_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M193.62,-112.72C205.75,-95.37 232.63,-58.92 261,-33.62 263.98,-30.96 267.29,-28.38 270.65,-25.96"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="272.48,-28.95 278.84,-20.47 268.58,-23.14 272.48,-28.95"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="325.75,-132.25 271.5,-132.25 271.5,-113 325.75,-113 325.75,-132.25"/>
<text text-anchor="middle" x="298.62" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node10 -->
<g id="edge14_Node000008_Node000010" class="edge">
<title>Node8&#45;&gt;Node10</title>
<g id="a_edge14_Node000008_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M225.3,-122.62C236.52,-122.62 248.77,-122.62 259.94,-122.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="259.6,-126.13 269.6,-122.63 259.6,-119.13 259.6,-126.13"/>
</a>
</g>
</g>
<!-- Node11 -->
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="324.25,-95.25 273,-95.25 273,-76 324.25,-76 324.25,-95.25"/>
<text text-anchor="middle" x="298.62" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node11 -->
<g id="edge15_Node000008_Node000011" class="edge">
<title>Node8&#45;&gt;Node11</title>
<g id="a_edge15_Node000008_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M217.14,-112.51C231.02,-107.88 247.57,-102.35 262.05,-97.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="262.82,-100.94 271.2,-94.45 260.6,-94.3 262.82,-100.94"/>
</a>
</g>
</g>
<!-- Node12 -->
<g id="Node000012" class="node">
<title>Node12</title>
<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="328,-169.25 269.25,-169.25 269.25,-150 328,-150 328,-169.25"/>
<text text-anchor="middle" x="298.62" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node12 -->
<g id="edge16_Node000008_Node000012" class="edge">
<title>Node8&#45;&gt;Node12</title>
<g id="a_edge16_Node000008_Node000012"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M217.14,-132.74C229.75,-136.95 244.56,-141.9 258.02,-146.39"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="256.89,-149.71 267.49,-149.56 259.11,-143.07 256.89,-149.71"/>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node5 -->
<g id="edge13_Node000009_Node000005" class="edge">
<title>Node9&#45;&gt;Node5</title>
<g id="a_edge13_Node000009_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M319.56,-19.71C325.51,-23.45 331.67,-28.14 336.25,-33.62 372.62,-77.14 392.53,-142.56 400.82,-175.73"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="397.37,-176.36 403.09,-185.29 404.18,-174.75 397.37,-176.36"/>
</a>
</g>
</g>
<!-- Node13&#45;&gt;Node3 -->
<g id="edge18_Node000013_Node000003" class="edge">
<title>Node13&#45;&gt;Node3</title>
<g id="a_edge18_Node000013_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M109.32,-150.64C122.97,-158.95 142.65,-170.92 158.5,-180.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.6,-183.51 166.97,-185.72 160.24,-177.54 156.6,-183.51"/>
</a>
</g>
</g>
<!-- Node13&#45;&gt;Node8 -->
<g id="edge19_Node000013_Node000008" class="edge">
<title>Node13&#45;&gt;Node8</title>
<g id="a_edge19_Node000013_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.05,-137.07C118.19,-135.67 126.77,-133.99 135.51,-132.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="135.95,-135.76 145.09,-130.41 134.6,-128.89 135.95,-135.76"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 14 KiB

28
d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map
View File

@@ -1,28 +0,0 @@
<map id="test1" name="test1">
<area shape="rect" id="Node000001" title="Self&#45;test implementations, 1st test." alt="" coords="5,179,56,204"/>
<area shape="rect" id="Node000002" href="$dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="122,80,190,106"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="47,176,125,113,128,118,50,180"/>
<area shape="rect" id="Node000007" href="$dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="104,229,208,255"/>
<area shape="poly" id="edge9_Node000001_Node000007" title=" " alt="" coords="57,199,109,221,107,226,55,204"/>
<area shape="rect" id="Node000003" href="$dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="256,5,356,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="182,77,255,40,263,36,265,41,257,45,184,82"/>
<area shape="rect" id="Node000005" href="$dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="258,55,354,80"/>
<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="190,85,243,75,243,81,191,90"/>
<area shape="rect" id="Node000006" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="269,104,343,130"/>
<area shape="poly" id="edge7_Node000002_Node000006" title=" " alt="" coords="191,96,254,106,254,111,190,101"/>
<area shape="rect" id="Node000004" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="404,104,496,130"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="339,29,358,40,425,92,422,96,355,44,336,34"/>
<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="425,105,420,95,423,86,433,80,450,77,468,80,477,87,474,91,466,85,450,83,435,85,428,89,426,95,430,102"/>
<area shape="poly" id="edge6_Node000005_Node000004" title=" " alt="" coords="347,78,397,96,395,101,345,83"/>
<area shape="poly" id="edge8_Node000006_Node000004" title=" " alt="" coords="344,114,389,114,389,120,344,120"/>
<area shape="poly" id="edge10_Node000007_Node000004" title=" " alt="" coords="181,226,255,190,397,133,399,138,257,195,184,231"/>
<area shape="rect" id="Node000008" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="259,205,353,231"/>
<area shape="poly" id="edge11_Node000007_Node000008" title=" " alt="" coords="208,231,243,225,244,231,209,236"/>
<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="270,255,342,280"/>
<area shape="poly" id="edge13_Node000007_Node000009" title=" " alt="" coords="209,248,255,256,254,262,208,254"/>
<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="272,304,340,330"/>
<area shape="poly" id="edge14_Node000007_Node000010" title=" " alt="" coords="184,253,257,290,265,294,263,299,255,295,182,258"/>
<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="267,353,345,379"/>
<area shape="poly" id="edge15_Node000007_Node000011" title=" " alt="" coords="170,254,207,295,258,340,262,343,259,348,254,344,203,299,166,257"/>
<area shape="poly" id="edge12_Node000008_Node000004" title=" " alt="" coords="327,203,355,184,418,137,421,142,358,188,330,207"/>
</map>

1
d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5
View File

@@ -1 +0,0 @@
c234d8a5258bce82c70451816654c35f

272
d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg
View File

@@ -1,272 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: test1 Pages: 1 -->
<svg width="376pt" height="288pt"
viewBox="0.00 0.00 375.75 288.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 284.25)">
<title>test1</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Self&#45;test implementations, 1st test.">
<polygon fill="#999999" stroke="#666666" points="37.75,-150.25 0,-150.25 0,-131 37.75,-131 37.75,-150.25"/>
<text text-anchor="middle" x="18.88" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
<polygon fill="white" stroke="#666666" points="138.5,-224.25 87.25,-224.25 87.25,-205 138.5,-205 138.5,-224.25"/>
<text text-anchor="middle" x="112.88" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.28,-150.6C47.23,-162.63 72.6,-183.03 90.68,-197.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.21,-200.08 98.19,-203.62 92.59,-194.62 88.21,-200.08"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
<polygon fill="white" stroke="#666666" points="152,-112.25 73.75,-112.25 73.75,-93 152,-93 152,-112.25"/>
<text text-anchor="middle" x="112.88" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge9_Node000001_Node000007" class="edge">
<title>Node1&#45;&gt;Node7</title>
<g id="a_edge9_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M38.05,-133.12C49.21,-128.51 63.86,-122.46 77.17,-116.96"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="78.16,-120.34 86.07,-113.29 75.49,-113.87 78.16,-120.34"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="263.25,-280.25 188,-280.25 188,-261 263.25,-261 263.25,-280.25"/>
<text text-anchor="middle" x="225.62" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M133.34,-224.72C148.26,-232.43 169.39,-243.28 188,-252.62 189.95,-253.6 191.95,-254.6 193.98,-255.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="192.19,-258.63 202.7,-259.92 195.29,-252.36 192.19,-258.63"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="261.75,-243.25 189.5,-243.25 189.5,-224 261.75,-224 261.75,-243.25"/>
<text text-anchor="middle" x="225.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge5_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M138.73,-218.89C150.39,-220.89 164.67,-223.34 178.22,-225.66"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="177.41,-229.08 187.86,-227.32 178.6,-222.18 177.41,-229.08"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="253.5,-206.25 197.75,-206.25 197.75,-187 253.5,-187 253.5,-206.25"/>
<text text-anchor="middle" x="225.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node6 -->
<g id="edge7_Node000002_Node000006" class="edge">
<title>Node2&#45;&gt;Node6</title>
<g id="a_edge7_Node000002_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M138.73,-210.59C152.79,-208.3 170.67,-205.39 186.47,-202.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="186.72,-206.33 196.03,-201.27 185.6,-199.42 186.72,-206.33"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="#666666" points="367.75,-206.25 299.25,-206.25 299.25,-187 367.75,-187 367.75,-206.25"/>
<text text-anchor="middle" x="333.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<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="M249.14,-260.55C253.91,-258.14 258.83,-255.45 263.25,-252.62 281.25,-241.13 299.98,-225.74 313.42,-214"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="315.52,-216.81 320.67,-207.55 310.87,-211.58 315.52,-216.81"/>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node4 -->
<g id="edge4_Node000004_Node000004" class="edge">
<title>Node4&#45;&gt;Node4</title>
<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M316.61,-206.54C308.91,-215.15 314.54,-224.25 333.5,-224.25 343.87,-224.25 350.25,-221.53 352.65,-217.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="356.11,-217.12 350.69,-208.02 349.25,-218.52 356.11,-217.12"/>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge6_Node000005_Node000004" class="edge">
<title>Node5&#45;&gt;Node4</title>
<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M255.56,-223.51C267.11,-219.48 280.6,-214.76 293.03,-210.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="293.89,-213.83 302.18,-207.22 291.58,-207.22 293.89,-213.83"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge8_Node000006_Node000004" class="edge">
<title>Node6&#45;&gt;Node4</title>
<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M253.89,-196.62C264.18,-196.62 276.19,-196.62 287.67,-196.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="287.38,-200.13 297.38,-196.63 287.38,-193.13 287.38,-200.13"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node4 -->
<g id="edge10_Node000007_Node000004" class="edge">
<title>Node7&#45;&gt;Node4</title>
<g id="a_edge10_Node000007_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M132.85,-112.67C147.7,-120.39 168.95,-131.13 188,-139.62 223.49,-155.45 264.81,-171.52 294.15,-182.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="292.76,-185.76 303.35,-185.98 295.21,-179.2 292.76,-185.76"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="white" stroke="#666666" points="261,-130.25 190.25,-130.25 190.25,-111 261,-111 261,-130.25"/>
<text text-anchor="middle" x="225.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge11_Node000007_Node000008" class="edge">
<title>Node7&#45;&gt;Node8</title>
<g id="a_edge11_Node000007_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M152.3,-108.87C160.81,-110.25 169.92,-111.73 178.7,-113.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="178.05,-116.6 188.48,-114.75 179.17,-109.69 178.05,-116.6"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="252.75,-93.25 198.5,-93.25 198.5,-74 252.75,-74 252.75,-93.25"/>
<text text-anchor="middle" x="225.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node9 -->
<g id="edge13_Node000007_Node000009" class="edge">
<title>Node7&#45;&gt;Node9</title>
<g id="a_edge13_Node000007_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M152.3,-96.03C163.52,-94.11 175.77,-92.01 186.94,-90.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="187.36,-93.57 196.62,-88.43 186.17,-86.67 187.36,-93.57"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="251.25,-56.25 200,-56.25 200,-37 251.25,-37 251.25,-56.25"/>
<text text-anchor="middle" x="225.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node10 -->
<g id="edge14_Node000007_Node000010" class="edge">
<title>Node7&#45;&gt;Node10</title>
<g id="a_edge14_Node000007_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M133.34,-92.53C148.26,-84.82 169.39,-73.97 188,-64.62 189.95,-63.65 191.95,-62.65 193.98,-61.64"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.29,-64.89 202.7,-57.33 192.19,-58.62 195.29,-64.89"/>
</a>
</g>
</g>
<!-- Node11 -->
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="255,-19.25 196.25,-19.25 196.25,0 255,0 255,-19.25"/>
<text text-anchor="middle" x="225.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node11 -->
<g id="edge15_Node000007_Node000011" class="edge">
<title>Node7&#45;&gt;Node11</title>
<g id="a_edge15_Node000007_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.89,-92.58C134.62,-77.11 160.81,-47.2 188,-27.62 189.13,-26.81 190.31,-26.01 191.51,-25.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="192.85,-28.5 199.78,-20.49 189.36,-22.43 192.85,-28.5"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node4 -->
<g id="edge12_Node000008_Node000004" class="edge">
<title>Node8&#45;&gt;Node4</title>
<g id="a_edge12_Node000008_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M242.46,-130.68C248.96,-134.9 256.53,-139.91 263.25,-144.62 279.39,-155.96 297.17,-169.33 310.67,-179.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="308.41,-182.34 318.46,-185.67 312.68,-176.8 308.41,-182.34"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 13 KiB

246
d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg
View File

@@ -1,246 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: test1 Pages: 1 -->
<svg width="376pt" height="288pt"
viewBox="0.00 0.00 375.75 288.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 284.25)">
<title>test1</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Self&#45;test implementations, 1st test.">
<polygon fill="#999999" stroke="#666666" points="37.75,-150.25 0,-150.25 0,-131 37.75,-131 37.75,-150.25"/>
<text text-anchor="middle" x="18.88" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
<polygon fill="white" stroke="#666666" points="138.5,-224.25 87.25,-224.25 87.25,-205 138.5,-205 138.5,-224.25"/>
<text text-anchor="middle" x="112.88" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.28,-150.6C47.23,-162.63 72.6,-183.03 90.68,-197.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.21,-200.08 98.19,-203.62 92.59,-194.62 88.21,-200.08"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
<polygon fill="white" stroke="#666666" points="152,-112.25 73.75,-112.25 73.75,-93 152,-93 152,-112.25"/>
<text text-anchor="middle" x="112.88" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge9_Node000001_Node000007" class="edge">
<title>Node1&#45;&gt;Node7</title>
<g id="a_edge9_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M38.05,-133.12C49.21,-128.51 63.86,-122.46 77.17,-116.96"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="78.16,-120.34 86.07,-113.29 75.49,-113.87 78.16,-120.34"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="263.25,-280.25 188,-280.25 188,-261 263.25,-261 263.25,-280.25"/>
<text text-anchor="middle" x="225.62" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M133.34,-224.72C148.26,-232.43 169.39,-243.28 188,-252.62 189.95,-253.6 191.95,-254.6 193.98,-255.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="192.19,-258.63 202.7,-259.92 195.29,-252.36 192.19,-258.63"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="261.75,-243.25 189.5,-243.25 189.5,-224 261.75,-224 261.75,-243.25"/>
<text text-anchor="middle" x="225.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge5_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M138.73,-218.89C150.39,-220.89 164.67,-223.34 178.22,-225.66"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="177.41,-229.08 187.86,-227.32 178.6,-222.18 177.41,-229.08"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="253.5,-206.25 197.75,-206.25 197.75,-187 253.5,-187 253.5,-206.25"/>
<text text-anchor="middle" x="225.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node6 -->
<g id="edge7_Node000002_Node000006" class="edge">
<title>Node2&#45;&gt;Node6</title>
<g id="a_edge7_Node000002_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M138.73,-210.59C152.79,-208.3 170.67,-205.39 186.47,-202.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="186.72,-206.33 196.03,-201.27 185.6,-199.42 186.72,-206.33"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="#666666" points="367.75,-206.25 299.25,-206.25 299.25,-187 367.75,-187 367.75,-206.25"/>
<text text-anchor="middle" x="333.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<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="M249.14,-260.55C253.91,-258.14 258.83,-255.45 263.25,-252.62 281.25,-241.13 299.98,-225.74 313.42,-214"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="315.52,-216.81 320.67,-207.55 310.87,-211.58 315.52,-216.81"/>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node4 -->
<g id="edge4_Node000004_Node000004" class="edge">
<title>Node4&#45;&gt;Node4</title>
<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M316.61,-206.54C308.91,-215.15 314.54,-224.25 333.5,-224.25 343.87,-224.25 350.25,-221.53 352.65,-217.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="356.11,-217.12 350.69,-208.02 349.25,-218.52 356.11,-217.12"/>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge6_Node000005_Node000004" class="edge">
<title>Node5&#45;&gt;Node4</title>
<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M255.56,-223.51C267.11,-219.48 280.6,-214.76 293.03,-210.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="293.89,-213.83 302.18,-207.22 291.58,-207.22 293.89,-213.83"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge8_Node000006_Node000004" class="edge">
<title>Node6&#45;&gt;Node4</title>
<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M253.89,-196.62C264.18,-196.62 276.19,-196.62 287.67,-196.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="287.38,-200.13 297.38,-196.63 287.38,-193.13 287.38,-200.13"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node4 -->
<g id="edge10_Node000007_Node000004" class="edge">
<title>Node7&#45;&gt;Node4</title>
<g id="a_edge10_Node000007_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M132.85,-112.67C147.7,-120.39 168.95,-131.13 188,-139.62 223.49,-155.45 264.81,-171.52 294.15,-182.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="292.76,-185.76 303.35,-185.98 295.21,-179.2 292.76,-185.76"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="white" stroke="#666666" points="261,-130.25 190.25,-130.25 190.25,-111 261,-111 261,-130.25"/>
<text text-anchor="middle" x="225.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge11_Node000007_Node000008" class="edge">
<title>Node7&#45;&gt;Node8</title>
<g id="a_edge11_Node000007_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M152.3,-108.87C160.81,-110.25 169.92,-111.73 178.7,-113.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="178.05,-116.6 188.48,-114.75 179.17,-109.69 178.05,-116.6"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="252.75,-93.25 198.5,-93.25 198.5,-74 252.75,-74 252.75,-93.25"/>
<text text-anchor="middle" x="225.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node9 -->
<g id="edge13_Node000007_Node000009" class="edge">
<title>Node7&#45;&gt;Node9</title>
<g id="a_edge13_Node000007_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M152.3,-96.03C163.52,-94.11 175.77,-92.01 186.94,-90.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="187.36,-93.57 196.62,-88.43 186.17,-86.67 187.36,-93.57"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="251.25,-56.25 200,-56.25 200,-37 251.25,-37 251.25,-56.25"/>
<text text-anchor="middle" x="225.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node10 -->
<g id="edge14_Node000007_Node000010" class="edge">
<title>Node7&#45;&gt;Node10</title>
<g id="a_edge14_Node000007_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M133.34,-92.53C148.26,-84.82 169.39,-73.97 188,-64.62 189.95,-63.65 191.95,-62.65 193.98,-61.64"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.29,-64.89 202.7,-57.33 192.19,-58.62 195.29,-64.89"/>
</a>
</g>
</g>
<!-- Node11 -->
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="255,-19.25 196.25,-19.25 196.25,0 255,0 255,-19.25"/>
<text text-anchor="middle" x="225.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node11 -->
<g id="edge15_Node000007_Node000011" class="edge">
<title>Node7&#45;&gt;Node11</title>
<g id="a_edge15_Node000007_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.89,-92.58C134.62,-77.11 160.81,-47.2 188,-27.62 189.13,-26.81 190.31,-26.01 191.51,-25.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="192.85,-28.5 199.78,-20.49 189.36,-22.43 192.85,-28.5"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node4 -->
<g id="edge12_Node000008_Node000004" class="edge">
<title>Node8&#45;&gt;Node4</title>
<g id="a_edge12_Node000008_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M242.46,-130.68C248.96,-134.9 256.53,-139.91 263.25,-144.62 279.39,-155.96 297.17,-169.33 310.67,-179.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="308.41,-182.34 318.46,-185.67 312.68,-176.8 308.41,-182.34"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 12 KiB

292
d3/dae/dsu__path__compression_8cpp_source.html Normal file
View File

@@ -0,0 +1,292 @@
<!-- HTML header for doxygen 1.12.0-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<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.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: data_structures/dsu_path_compression.cpp Source File</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('d3/dae/dsu__path__compression_8cpp_source.html','../../'); initResizable(true); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">dsu_path_compression.cpp</div></div>
</div><!--header-->
<div class="contents">
<a href="../../d3/dae/dsu__path__compression_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span> </div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include &lt;cassert&gt;</span> </div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include &lt;iostream&gt;</span> </div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include &lt;vector&gt;</span> </div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span> </div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="keyword">using </span>std::cout;</div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="keyword">using </span>std::endl;</div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="keyword">using </span>std::vector;</div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> </div>
<div class="foldopen" id="foldopen00034" data-start="{" data-end="};">
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html"> 34</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> {</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <span class="keyword">private</span>:</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb"> 36</a></span> vector&lt;uint64_t&gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>; </div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429"> 37</a></span> vector&lt;uint64_t&gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>; </div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55"> 38</a></span> vector&lt;uint64_t&gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>; </div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53"> 39</a></span> vector&lt;uint64_t&gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>; </div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63"> 40</a></span> vector&lt;uint64_t&gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>; </div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="keyword">public</span>:</div>
<div class="foldopen" id="foldopen00046" data-start="{" data-end="}">
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72"> 46</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="../../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72">dsu</a>(uint64_t n) {</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>.assign(n, 0);</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] = i;</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> }</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>.assign(n, 0);</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>.assign(n, 0);</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>.assign(n, 0);</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[i] = 0;</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[i] = i;</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[i] = i;</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> }</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>.assign(n, 0);</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[i] = 1;</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> }</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> }</div>
</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> </div>
<div class="foldopen" id="foldopen00074" data-start="{" data-end="}">
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c"> 74</a></span> uint64_t <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(uint64_t i) {</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] == i) {</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="keywordflow">return</span> i;</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> }</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keywordflow">return</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] = <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i]));</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> }</div>
</div>
<div class="foldopen" id="foldopen00088" data-start="{" data-end="}">
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559"> 88</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">UnionSet</a>(uint64_t i, uint64_t j) {</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">isSame</a>(i, j)) {</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> }</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> </div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="comment">// we find the representative of the i and j</span></div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> uint64_t x = <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i);</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> uint64_t y = <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j);</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> </div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] &gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> std::swap(x, y);</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> }</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[x] = y;</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> </div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] == <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]++;</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> }</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[y] += <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[x];</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[y] = std::max(<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[x], <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[y]);</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[y] = std::min(<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[x], <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[y]);</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> }</div>
</div>
<div class="foldopen" id="foldopen00124" data-start="{" data-end="}">
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303"> 124</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">isSame</a>(uint64_t i, uint64_t j) {</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i) == <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j)) {</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> }</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> }</div>
</div>
<div class="foldopen" id="foldopen00136" data-start="{" data-end="}">
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a"> 136</a></span> vector&lt;uint64_t&gt; <a class="code hl_function" href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">get</a>(uint64_t i) {</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> vector&lt;uint64_t&gt; ans;</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> ans.push_back(<a class="code hl_function" href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415">get_min</a>(i));</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> ans.push_back(<a class="code hl_function" href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde">get_max</a>(i));</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> ans.push_back(<a class="code hl_function" href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">size</a>(i));</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="keywordflow">return</span> ans;</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> }</div>
</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c"> 149</a></span> uint64_t <a class="code hl_function" href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">size</a>(uint64_t i) { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[<a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde"> 156</a></span> uint64_t <a class="code hl_function" href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde">get_max</a>(uint64_t i) { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[<a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415"> 163</a></span> uint64_t <a class="code hl_function" href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415">get_min</a>(uint64_t i) { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[<a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span>};</div>
</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> </div>
<div class="foldopen" id="foldopen00170" data-start="{" data-end="}">
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"><a class="line" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243"> 170</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>() {</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="comment">// the minimum, maximum, and size of the set</span></div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> uint64_t n = 10; </div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1); </div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="comment">// set 1</span></div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">UnionSet</a>(1, 2); <span class="comment">// performs union operation on 1 and 2</span></div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">UnionSet</a>(1, 4); <span class="comment">// performs union operation on 1 and 4</span></div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> vector&lt;uint64_t&gt; ans = {1, 4, 3};</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; ans.size(); i++) {</div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> assert(d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">get</a>(4).at(i) == ans[i]); <span class="comment">// makes sure algorithm works fine</span></div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> }</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> cout &lt;&lt; <span class="stringliteral">&quot;1st test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span>}</div>
</div>
<div class="foldopen" id="foldopen00187" data-start="{" data-end="}">
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"><a class="line" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae"> 187</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>() {</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="comment">// the minimum, maximum, and size of the set</span></div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> uint64_t n = 10; </div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1); </div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="comment">// set 1</span></div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">UnionSet</a>(3, 5);</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">UnionSet</a>(5, 6);</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">UnionSet</a>(5, 7);</div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> vector&lt;uint64_t&gt; ans = {3, 7, 4};</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; ans.size(); i++) {</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> assert(d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">get</a>(3).at(i) == ans[i]); <span class="comment">// makes sure algorithm works fine</span></div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> }</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> cout &lt;&lt; <span class="stringliteral">&quot;2nd test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span>}</div>
</div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> </div>
<div class="foldopen" id="foldopen00206" data-start="{" data-end="}">
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"><a class="line" href="../../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 206</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> uint64_t n = 10; </div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1); </div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> </div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>(); <span class="comment">// run 1st test case</span></div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(); <span class="comment">// run 2nd test case</span></div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> </div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span>}</div>
</div>
<div class="ttc" id="aclassdsu_html"><div class="ttname"><a href="../../dd/d1f/classdsu.html">dsu</a></div><div class="ttdoc">Disjoint sets union data structure, class based representation.</div><div class="ttdef"><b>Definition</b> <a href="#l00034">dsu_path_compression.cpp:34</a></div></div>
<div class="ttc" id="aclassdsu_html_a0ce2672c570f4235eafddb0c9a58115a"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">dsu::get</a></div><div class="ttdeci">vector&lt; uint64_t &gt; get(uint64_t i)</div><div class="ttdoc">prints the minimum, maximum and size of the set to which i belongs to</div><div class="ttdef"><b>Definition</b> <a href="#l00136">dsu_path_compression.cpp:136</a></div></div>
<div class="ttc" id="aclassdsu_html_a126e3002a464e53cd54b07ba56482a72"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72">dsu::dsu</a></div><div class="ttdeci">dsu(uint64_t n)</div><div class="ttdoc">contructor for initialising all data members.</div><div class="ttdef"><b>Definition</b> <a href="#l00046">dsu_path_compression.cpp:46</a></div></div>
<div class="ttc" id="aclassdsu_html_a16851f78fe390fc1430905c83d6a2f1c"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">dsu::findSet</a></div><div class="ttdeci">uint64_t findSet(uint64_t i)</div><div class="ttdoc">Method to find the representative of the set to which i belongs to, T(n) = O(1)</div><div class="ttdef"><b>Definition</b> <a href="#l00074">dsu_path_compression.cpp:74</a></div></div>
<div class="ttc" id="aclassdsu_html_a1c24228b0f2f49220133fb8c3566a55c"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">dsu::size</a></div><div class="ttdeci">uint64_t size(uint64_t i)</div><div class="ttdoc">A utility function that returns the size of the set to which i belongs to.</div><div class="ttdef"><b>Definition</b> <a href="#l00149">dsu_path_compression.cpp:149</a></div></div>
<div class="ttc" id="aclassdsu_html_a1d77aad7fc39fe7140d834cd347e5c63"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">dsu::minElement</a></div><div class="ttdeci">vector&lt; uint64_t &gt; minElement</div><div class="ttdoc">minimum of each set to which i belongs to</div><div class="ttdef"><b>Definition</b> <a href="#l00040">dsu_path_compression.cpp:40</a></div></div>
<div class="ttc" id="aclassdsu_html_a1ef0b0462a0dda63514f641cbb7dd8cb"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">dsu::p</a></div><div class="ttdeci">vector&lt; uint64_t &gt; p</div><div class="ttdoc">keeps track of the parent of ith element</div><div class="ttdef"><b>Definition</b> <a href="#l00036">dsu_path_compression.cpp:36</a></div></div>
<div class="ttc" id="aclassdsu_html_a4ade6f16c418fc98b54452f7b0252a53"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">dsu::maxElement</a></div><div class="ttdeci">vector&lt; uint64_t &gt; maxElement</div><div class="ttdoc">maximum of each set to which i belongs to</div><div class="ttdef"><b>Definition</b> <a href="#l00039">dsu_path_compression.cpp:39</a></div></div>
<div class="ttc" id="aclassdsu_html_a4bf54d33fba178998dbbe4c57f2e9429"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">dsu::depth</a></div><div class="ttdeci">vector&lt; uint64_t &gt; depth</div><div class="ttdoc">tracks the depth(rank) of i in the tree</div><div class="ttdef"><b>Definition</b> <a href="#l00037">dsu_path_compression.cpp:37</a></div></div>
<div class="ttc" id="aclassdsu_html_a64d25c5986742f7c234ed449b2ff7303"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">dsu::isSame</a></div><div class="ttdeci">bool isSame(uint64_t i, uint64_t j)</div><div class="ttdoc">A utility function which check whether i and j belongs to same set or not.</div><div class="ttdef"><b>Definition</b> <a href="#l00124">dsu_path_compression.cpp:124</a></div></div>
<div class="ttc" id="aclassdsu_html_a696141b8b092466767f4bfe1c5e46cde"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde">dsu::get_max</a></div><div class="ttdeci">uint64_t get_max(uint64_t i)</div><div class="ttdoc">A utility function that returns the max element of the set to which i belongs to.</div><div class="ttdef"><b>Definition</b> <a href="#l00156">dsu_path_compression.cpp:156</a></div></div>
<div class="ttc" id="aclassdsu_html_a6ac30c07abca2aaa3b291504c25c3559"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">dsu::UnionSet</a></div><div class="ttdeci">void UnionSet(uint64_t i, uint64_t j)</div><div class="ttdoc">Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...</div><div class="ttdef"><b>Definition</b> <a href="#l00088">dsu_path_compression.cpp:88</a></div></div>
<div class="ttc" id="aclassdsu_html_ac0dc3e17e49fe19b159b4ea4096d7b55"><div class="ttname"><a href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">dsu::setSize</a></div><div class="ttdeci">vector&lt; uint64_t &gt; setSize</div><div class="ttdoc">size of each chunk(set)</div><div class="ttdef"><b>Definition</b> <a href="#l00038">dsu_path_compression.cpp:38</a></div></div>
<div class="ttc" id="aclassdsu_html_ac713a5b496d0405c82e2808a85e58415"><div class="ttname"><a href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415">dsu::get_min</a></div><div class="ttdeci">uint64_t get_min(uint64_t i)</div><div class="ttdoc">A utility function that returns the min element of the set to which i belongs to.</div><div class="ttdef"><b>Definition</b> <a href="#l00163">dsu_path_compression.cpp:163</a></div></div>
<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> <a href="#l00187">dsu_path_compression.cpp:187</a></div></div>
<div class="ttc" id="adsu__path__compression_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00206">dsu_path_compression.cpp:206</a></div></div>
<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> <a href="#l00170">dsu_path_compression.cpp:170</a></div></div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d3/dae/dsu__path__compression_8cpp.html">dsu_path_compression.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.12.0 </li>
</ul>
</div>
</body>
</html>