backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 04:18:34 +08:00
Code Issues Projects Releases Wiki Activity
Files
67d95bf85f68276baa7e69e96d7d4222e2629500
C-Plus-Plus/de/d23/disjoint__set_8cpp.html
realstealthninja b41207008f Documentation for f1eddf4d65
2025-07-09 10:53:16 +00:00

389 lines
25 KiB
HTML
Raw Blame History

<!-- 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.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: data_structures/disjoint_set.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>
<script type="text/javascript" src="../../navtree.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.14.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
</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">
$(function(){initNavTree('de/d23/disjoint__set_8cpp.html','../../',''); });
</script>
<div id="container">
<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">disjoint_set.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a href="https://en.wikipedia.org/wiki/Disjoint-set_data_structure" target="_blank">Disjoint Sets Data Structure (Disjoint Sets)</a>
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for disjoint_set.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../d5/dee/disjoint__set_8cpp__incl.svg" width="168" 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>
<p><a href="../../de/d23/disjoint__set_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a010965fc5f16cca5a62506afab24e4ec" id="r_a010965fc5f16cca5a62506afab24e4ec"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a010965fc5f16cca5a62506afab24e4ec">CreateSet</a> (int n)</td></tr>
<tr class="memitem:a34b9ead0608e676d9ae5188672427cc8" id="r_a34b9ead0608e676d9ae5188672427cc8"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a34b9ead0608e676d9ae5188672427cc8">Find</a> (int x)</td></tr>
<tr class="memitem:a2fb0a7cd26a477e2d48ba7e0118bc985" id="r_a2fb0a7cd26a477e2d48ba7e0118bc985"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2fb0a7cd26a477e2d48ba7e0118bc985">InSameUnion</a> (int x, int y)</td></tr>
<tr class="memitem:a44481bb75386fbb0f958a388d4b9f757" id="r_a44481bb75386fbb0f958a388d4b9f757"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a44481bb75386fbb0f958a388d4b9f757">Union</a> (int x, int y)</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-var-members" class="groupheader"><a id="var-members" name="var-members"></a>
Variables</h2></td></tr>
<tr class="memitem:a31ade23371565792a3434bc6f2e3bdef" id="r_a31ade23371565792a3434bc6f2e3bdef"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a31ade23371565792a3434bc6f2e3bdef">root</a></td></tr>
<tr class="memitem:a9bbf7f3dcc785986a407cfb70f54e303" id="r_a9bbf7f3dcc785986a407cfb70f54e303"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9bbf7f3dcc785986a407cfb70f54e303">rank</a></td></tr>
</table>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Disjoint-set_data_structure" target="_blank">Disjoint Sets Data Structure (Disjoint Sets)</a> </p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/leoyang429" target="_blank">leoyang429</a></dd></dl>
<p>A disjoint set data structure (also called union find or merge find set) is a data structure that tracks a set of elements partitioned into a number of disjoint (non-overlapping) subsets. Some situations where disjoint sets can be used are- to find connected components of a graph, 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 etc. There are two operation which we perform on disjoint sets - 1) Union 2) Find </p>
<p class="definition">Definition in file <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html">disjoint_set.cpp</a>.</p>
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
<a id="a010965fc5f16cca5a62506afab24e4ec" name="a010965fc5f16cca5a62506afab24e4ec"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a010965fc5f16cca5a62506afab24e4ec">&#9670;&#160;</a></span>CreateSet()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void CreateSet </td>
<td>(</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Function to create a set </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">n</td><td>number of element </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html">disjoint_set.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 37</span> {</div>
<div class="line"><span class="lineno"> 38</span> root = vector&lt;int&gt;(n + 1);</div>
<div class="line"><span class="lineno"> 39</span> rank = vector&lt;int&gt;(n + 1, 1);</div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= n; ++i) {</div>
<div class="line"><span class="lineno"> 41</span> root[i] = i;</div>
<div class="line"><span class="lineno"> 42</span> }</div>
<div class="line"><span class="lineno"> 43</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a34b9ead0608e676d9ae5188672427cc8" name="a34b9ead0608e676d9ae5188672427cc8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a34b9ead0608e676d9ae5188672427cc8">&#9670;&#160;</a></span>Find()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int Find </td>
<td>(</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>x</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Find operation takes a number x and returns the set to which this number belongs to. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">x</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>set to which x belongs to </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html">disjoint_set.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 53</span> {</div>
<div class="line"><span class="lineno"> 54</span> <span class="keywordflow">if</span> (root[x] == x) {</div>
<div class="line"><span class="lineno"> 55</span> <span class="keywordflow">return</span> x;</div>
<div class="line"><span class="lineno"> 56</span> }</div>
<div class="line"><span class="lineno"> 57</span> <span class="keywordflow">return</span> root[x] = <a class="code hl_function" href="#a34b9ead0608e676d9ae5188672427cc8">Find</a>(root[x]);</div>
<div class="line"><span class="lineno"> 58</span>}</div>
<div class="ttc" id="adisjoint__set_8cpp_html_a34b9ead0608e676d9ae5188672427cc8"><div class="ttname"><a href="#a34b9ead0608e676d9ae5188672427cc8">Find</a></div><div class="ttdeci">int Find(int x)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d23/disjoint__set_8cpp_source.html#l00053">disjoint_set.cpp:53</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a2fb0a7cd26a477e2d48ba7e0118bc985" name="a2fb0a7cd26a477e2d48ba7e0118bc985"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2fb0a7cd26a477e2d48ba7e0118bc985">&#9670;&#160;</a></span>InSameUnion()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool InSameUnion </td>
<td>(</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>x</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>y</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>A utility function to check if x and y are from same set or not </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">x</td><td>element of some set </td></tr>
<tr><td class="paramname">y</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html">disjoint_set.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 67</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a34b9ead0608e676d9ae5188672427cc8">Find</a>(x) == <a class="code hl_function" href="#a34b9ead0608e676d9ae5188672427cc8">Find</a>(y); }</div>
</div><!-- fragment -->
</div>
</div>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function </p>
<p class="definition">Definition at line <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html#l00093">93</a> of file <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html">disjoint_set.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 93</span> {</div>
<div class="line"><span class="lineno"> 94</span> <span class="comment">// tests CreateSet &amp; Find</span></div>
<div class="line"><span class="lineno"> 95</span> <span class="keywordtype">int</span> n = 100;</div>
<div class="line"><span class="lineno"> 96</span> <a class="code hl_function" href="#a010965fc5f16cca5a62506afab24e4ec">CreateSet</a>(n);</div>
<div class="line"><span class="lineno"> 97</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= 100; ++i) {</div>
<div class="line"><span class="lineno"> 98</span> <span class="keywordflow">if</span> (root[i] != i) {</div>
<div class="line"><span class="lineno"> 99</span> cout &lt;&lt; <span class="stringliteral">&quot;Fail&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"> 100</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 101</span> }</div>
<div class="line"><span class="lineno"> 102</span> }</div>
<div class="line"><span class="lineno"> 103</span> <span class="comment">// tests InSameUnion &amp; Union</span></div>
<div class="line"><span class="lineno"> 104</span> cout &lt;&lt; <span class="stringliteral">&quot;1 and 2 are initially not in the same subset&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"> 105</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a2fb0a7cd26a477e2d48ba7e0118bc985">InSameUnion</a>(1, 2)) {</div>
<div class="line"><span class="lineno"> 106</span> cout &lt;&lt; <span class="stringliteral">&quot;Fail&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"> 107</span> }</div>
<div class="line"><span class="lineno"> 108</span> <a class="code hl_function" href="#a44481bb75386fbb0f958a388d4b9f757">Union</a>(1, 2);</div>
<div class="line"><span class="lineno"> 109</span> cout &lt;&lt; <span class="stringliteral">&quot;1 and 2 are now in the same subset&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"> 110</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="#a2fb0a7cd26a477e2d48ba7e0118bc985">InSameUnion</a>(1, 2)) {</div>
<div class="line"><span class="lineno"> 111</span> cout &lt;&lt; <span class="stringliteral">&quot;Fail&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"> 112</span> }</div>
<div class="line"><span class="lineno"> 113</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 114</span>}</div>
<div class="ttc" id="adisjoint__set_8cpp_html_a010965fc5f16cca5a62506afab24e4ec"><div class="ttname"><a href="#a010965fc5f16cca5a62506afab24e4ec">CreateSet</a></div><div class="ttdeci">void CreateSet(int n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d23/disjoint__set_8cpp_source.html#l00037">disjoint_set.cpp:37</a></div></div>
<div class="ttc" id="adisjoint__set_8cpp_html_a2fb0a7cd26a477e2d48ba7e0118bc985"><div class="ttname"><a href="#a2fb0a7cd26a477e2d48ba7e0118bc985">InSameUnion</a></div><div class="ttdeci">bool InSameUnion(int x, int y)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d23/disjoint__set_8cpp_source.html#l00067">disjoint_set.cpp:67</a></div></div>
<div class="ttc" id="adisjoint__set_8cpp_html_a44481bb75386fbb0f958a388d4b9f757"><div class="ttname"><a href="#a44481bb75386fbb0f958a388d4b9f757">Union</a></div><div class="ttdeci">void Union(int x, int y)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d23/disjoint__set_8cpp_source.html#l00078">disjoint_set.cpp:78</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>
</div>
<a id="a44481bb75386fbb0f958a388d4b9f757" name="a44481bb75386fbb0f958a388d4b9f757"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a44481bb75386fbb0f958a388d4b9f757">&#9670;&#160;</a></span>Union()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void Union </td>
<td>(</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>x</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>y</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Union operation combines two disjoint sets to make a single set in this union function we pass two elements and check if they are from different sets then combine those sets </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">x</td><td>element of some set </td></tr>
<tr><td class="paramname">y</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html">disjoint_set.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 78</span> {</div>
<div class="line"><span class="lineno"> 79</span> <span class="keywordtype">int</span> a = <a class="code hl_function" href="#a34b9ead0608e676d9ae5188672427cc8">Find</a>(x), b = <a class="code hl_function" href="#a34b9ead0608e676d9ae5188672427cc8">Find</a>(y);</div>
<div class="line"><span class="lineno"> 80</span> <span class="keywordflow">if</span> (a != b) {</div>
<div class="line"><span class="lineno"> 81</span> <span class="keywordflow">if</span> (rank[a] &lt; rank[b]) {</div>
<div class="line"><span class="lineno"> 82</span> root[a] = b;</div>
<div class="line"><span class="lineno"> 83</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rank[a] &gt; rank[b]) {</div>
<div class="line"><span class="lineno"> 84</span> root[b] = a;</div>
<div class="line"><span class="lineno"> 85</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 86</span> root[a] = b;</div>
<div class="line"><span class="lineno"> 87</span> ++rank[b];</div>
<div class="line"><span class="lineno"> 88</span> }</div>
<div class="line"><span class="lineno"> 89</span> }</div>
<div class="line"><span class="lineno"> 90</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a name="doc-var-members" id="doc-var-members"></a><h2 id="header-doc-var-members" class="groupheader">Variable Documentation</h2>
<a id="a9bbf7f3dcc785986a407cfb70f54e303" name="a9bbf7f3dcc785986a407cfb70f54e303"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9bbf7f3dcc785986a407cfb70f54e303">&#9670;&#160;</a></span>rank</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt;int&gt; rank</td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html">disjoint_set.cpp</a>.</p>
</div>
</div>
<a id="a31ade23371565792a3434bc6f2e3bdef" name="a31ade23371565792a3434bc6f2e3bdef"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a31ade23371565792a3434bc6f2e3bdef">&#9670;&#160;</a></span>root</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt;int&gt; root</td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html">disjoint_set.cpp</a>.</p>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div id="page-nav" class="page-nav-panel">
<div id="page-nav-resize-handle"></div>
<div id="page-nav-tree">
<div id="page-nav-contents">
</div><!-- page-nav-contents -->
</div><!-- page-nav-tree -->
</div><!-- page-nav -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a href="../../de/d23/disjoint__set_8cpp.html">disjoint_set.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.14.0 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink