backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 20:31:43 +08:00
Code Issues Projects Releases Wiki Activity
Files
4d3723dfc367aee96ded3fb945efb01dc40e71f6
C-Plus-Plus/dd/d1f/classdsu.html
realstealthninja b41207008f Documentation for f1eddf4d65
2025-07-09 10:53:16 +00:00

958 lines
60 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++: dsu Class 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('dd/d1f/classdsu.html','../../','d0/dcb/classdsu-members'); });
</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">dsu Class Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Disjoint sets union data structure, class based representation.
<a href="#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-pub-methods" class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a126e3002a464e53cd54b07ba56482a72" id="r_a126e3002a464e53cd54b07ba56482a72"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a126e3002a464e53cd54b07ba56482a72">dsu</a> (uint64_t n)</td></tr>
<tr class="memdesc:a126e3002a464e53cd54b07ba56482a72"><td class="mdescLeft">&#160;</td><td class="mdescRight">contructor for initialising all data members. <br /></td></tr>
<tr class="memitem:a16851f78fe390fc1430905c83d6a2f1c" id="r_a16851f78fe390fc1430905c83d6a2f1c"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a> (uint64_t i)</td></tr>
<tr class="memdesc:a16851f78fe390fc1430905c83d6a2f1c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Method to find the representative of the set to which i belongs to, T(n) = O(1) <br /></td></tr>
<tr class="memitem:a6ac30c07abca2aaa3b291504c25c3559" id="r_a6ac30c07abca2aaa3b291504c25c3559"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6ac30c07abca2aaa3b291504c25c3559">UnionSet</a> (uint64_t i, uint64_t j)</td></tr>
<tr class="memdesc:a6ac30c07abca2aaa3b291504c25c3559"><td class="mdescLeft">&#160;</td><td class="mdescRight">Method that combines two disjoint sets to which i and j belongs to and make a single set having a common representative. <br /></td></tr>
<tr class="memitem:a64d25c5986742f7c234ed449b2ff7303" id="r_a64d25c5986742f7c234ed449b2ff7303"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a64d25c5986742f7c234ed449b2ff7303">isSame</a> (uint64_t i, uint64_t j)</td></tr>
<tr class="memdesc:a64d25c5986742f7c234ed449b2ff7303"><td class="mdescLeft">&#160;</td><td class="mdescRight">A utility function which check whether i and j belongs to same set or not. <br /></td></tr>
<tr class="memitem:a0ce2672c570f4235eafddb0c9a58115a" id="r_a0ce2672c570f4235eafddb0c9a58115a"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0ce2672c570f4235eafddb0c9a58115a">get</a> (uint64_t i)</td></tr>
<tr class="memdesc:a0ce2672c570f4235eafddb0c9a58115a"><td class="mdescLeft">&#160;</td><td class="mdescRight">prints the minimum, maximum and size of the set to which i belongs to <br /></td></tr>
<tr class="memitem:a1c24228b0f2f49220133fb8c3566a55c" id="r_a1c24228b0f2f49220133fb8c3566a55c"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1c24228b0f2f49220133fb8c3566a55c">size</a> (uint64_t i)</td></tr>
<tr class="memdesc:a1c24228b0f2f49220133fb8c3566a55c"><td class="mdescLeft">&#160;</td><td class="mdescRight">A utility function that returns the size of the set to which i belongs to. <br /></td></tr>
<tr class="memitem:a696141b8b092466767f4bfe1c5e46cde" id="r_a696141b8b092466767f4bfe1c5e46cde"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a696141b8b092466767f4bfe1c5e46cde">get_max</a> (uint64_t i)</td></tr>
<tr class="memdesc:a696141b8b092466767f4bfe1c5e46cde"><td class="mdescLeft">&#160;</td><td class="mdescRight">A utility function that returns the max element of the set to which i belongs to. <br /></td></tr>
<tr class="memitem:ac713a5b496d0405c82e2808a85e58415" id="r_ac713a5b496d0405c82e2808a85e58415"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac713a5b496d0405c82e2808a85e58415">get_min</a> (uint64_t i)</td></tr>
<tr class="memdesc:ac713a5b496d0405c82e2808a85e58415"><td class="mdescLeft">&#160;</td><td class="mdescRight">A utility function that returns the min element of the set to which i belongs to. <br /></td></tr>
<tr class="memitem:a126e3002a464e53cd54b07ba56482a72" id="r_a126e3002a464e53cd54b07ba56482a72"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a126e3002a464e53cd54b07ba56482a72">dsu</a> (uint64_t n)</td></tr>
<tr class="memdesc:a126e3002a464e53cd54b07ba56482a72"><td class="mdescLeft">&#160;</td><td class="mdescRight">constructor for initialising all data members <br /></td></tr>
<tr class="memitem:a16851f78fe390fc1430905c83d6a2f1c" id="r_a16851f78fe390fc1430905c83d6a2f1c"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a> (uint64_t i)</td></tr>
<tr class="memdesc:a16851f78fe390fc1430905c83d6a2f1c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Method to find the representative of the set to which i belongs to, T(n) = O(logN) <br /></td></tr>
<tr class="memitem:a81897528bdb53fd5e796d75d7dbc430f" id="r_a81897528bdb53fd5e796d75d7dbc430f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a> (uint64_t i, uint64_t j)</td></tr>
<tr class="memdesc:a81897528bdb53fd5e796d75d7dbc430f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Method that combines two disjoint sets to which i and j belongs to and make a single set having a common representative. <br /></td></tr>
<tr class="memitem:a64d25c5986742f7c234ed449b2ff7303" id="r_a64d25c5986742f7c234ed449b2ff7303"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a64d25c5986742f7c234ed449b2ff7303">isSame</a> (uint64_t i, uint64_t j)</td></tr>
<tr class="memdesc:a64d25c5986742f7c234ed449b2ff7303"><td class="mdescLeft">&#160;</td><td class="mdescRight">A utility function which check whether i and j belongs to same set or not. <br /></td></tr>
<tr class="memitem:ab8ee27083a3c2e2df80755165a2ec280" id="r_ab8ee27083a3c2e2df80755165a2ec280"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab8ee27083a3c2e2df80755165a2ec280">getParents</a> (uint64_t i)</td></tr>
<tr class="memdesc:ab8ee27083a3c2e2df80755165a2ec280"><td class="mdescLeft">&#160;</td><td class="mdescRight">Method to print all the parents of i, or the path from i to representative. <br /></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-pri-attribs" class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a1ef0b0462a0dda63514f641cbb7dd8cb" id="r_a1ef0b0462a0dda63514f641cbb7dd8cb"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a></td></tr>
<tr class="memdesc:a1ef0b0462a0dda63514f641cbb7dd8cb"><td class="mdescLeft">&#160;</td><td class="mdescRight">keeps track of the parent of ith element <br /></td></tr>
<tr class="memitem:a4bf54d33fba178998dbbe4c57f2e9429" id="r_a4bf54d33fba178998dbbe4c57f2e9429"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a></td></tr>
<tr class="memdesc:a4bf54d33fba178998dbbe4c57f2e9429"><td class="mdescLeft">&#160;</td><td class="mdescRight">tracks the <a class="el" href="#a4bf54d33fba178998dbbe4c57f2e9429" title="tracks the depth(rank) of i in the tree">depth(rank)</a> of i in the tree <br /></td></tr>
<tr class="memitem:ac0dc3e17e49fe19b159b4ea4096d7b55" id="r_ac0dc3e17e49fe19b159b4ea4096d7b55"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a></td></tr>
<tr class="memdesc:ac0dc3e17e49fe19b159b4ea4096d7b55"><td class="mdescLeft">&#160;</td><td class="mdescRight">size of each chunk(set) <br /></td></tr>
<tr class="memitem:a4ade6f16c418fc98b54452f7b0252a53" id="r_a4ade6f16c418fc98b54452f7b0252a53"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a></td></tr>
<tr class="memdesc:a4ade6f16c418fc98b54452f7b0252a53"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum of each set to which i belongs to <br /></td></tr>
<tr class="memitem:a1d77aad7fc39fe7140d834cd347e5c63" id="r_a1d77aad7fc39fe7140d834cd347e5c63"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a></td></tr>
<tr class="memdesc:a1d77aad7fc39fe7140d834cd347e5c63"><td class="mdescLeft">&#160;</td><td class="mdescRight">minimum of each set to which i belongs to <br /></td></tr>
</table>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Disjoint sets union data structure, class based representation. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">n</td><td>number of elements </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
</div><a name="doc-constructors" id="doc-constructors"></a><h2 id="header-doc-constructors" class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="a126e3002a464e53cd54b07ba56482a72" name="a126e3002a464e53cd54b07ba56482a72"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a126e3002a464e53cd54b07ba56482a72">&#9670;&#160;</a></span>dsu() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">dsu::dsu </td>
<td>(</td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel explicit">explicit</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>contructor for initialising all data members. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">n</td><td>number of elements </td></tr>
</table>
</dd>
</dl>
<p>initially, all of them are their own parents</p>
<p>initially all have depth are equals to zero</p>
<p>initially set size will be equals to one</p>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00046">46</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"> 46</span> {</div>
<div class="line"><span class="lineno"> 47</span> <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>.assign(n, 0);</div>
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
<div class="line"><span class="lineno"> 50</span> <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] = i;</div>
<div class="line"><span class="lineno"> 51</span> }</div>
<div class="line"><span class="lineno"> 53</span> <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>.assign(n, 0);</div>
<div class="line"><span class="lineno"> 54</span> <a class="code hl_variable" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>.assign(n, 0);</div>
<div class="line"><span class="lineno"> 55</span> <a class="code hl_variable" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>.assign(n, 0);</div>
<div class="line"><span class="lineno"> 56</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
<div class="line"><span class="lineno"> 57</span> <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[i] = 0;</div>
<div class="line"><span class="lineno"> 58</span> <a class="code hl_variable" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[i] = i;</div>
<div class="line"><span class="lineno"> 59</span> <a class="code hl_variable" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[i] = i;</div>
<div class="line"><span class="lineno"> 60</span> }</div>
<div class="line"><span class="lineno"> 61</span> <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>.assign(n, 0);</div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
<div class="line"><span class="lineno"> 64</span> <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[i] = 1;</div>
<div class="line"><span class="lineno"> 65</span> }</div>
<div class="line"><span class="lineno"> 66</span> }</div>
<div class="ttc" id="aclassdsu_html_a1d77aad7fc39fe7140d834cd347e5c63"><div class="ttname"><a href="#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="../../d3/dae/dsu__path__compression_8cpp_source.html#l00040">dsu_path_compression.cpp:40</a></div></div>
<div class="ttc" id="aclassdsu_html_a1ef0b0462a0dda63514f641cbb7dd8cb"><div class="ttname"><a href="#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="../../d3/dae/dsu__path__compression_8cpp_source.html#l00036">dsu_path_compression.cpp:36</a></div></div>
<div class="ttc" id="aclassdsu_html_a4ade6f16c418fc98b54452f7b0252a53"><div class="ttname"><a href="#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="../../d3/dae/dsu__path__compression_8cpp_source.html#l00039">dsu_path_compression.cpp:39</a></div></div>
<div class="ttc" id="aclassdsu_html_a4bf54d33fba178998dbbe4c57f2e9429"><div class="ttname"><a href="#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="../../d3/dae/dsu__path__compression_8cpp_source.html#l00037">dsu_path_compression.cpp:37</a></div></div>
<div class="ttc" id="aclassdsu_html_ac0dc3e17e49fe19b159b4ea4096d7b55"><div class="ttname"><a href="#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="../../d3/dae/dsu__path__compression_8cpp_source.html#l00038">dsu_path_compression.cpp:38</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a126e3002a464e53cd54b07ba56482a72" name="a126e3002a464e53cd54b07ba56482a72"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a126e3002a464e53cd54b07ba56482a72">&#9670;&#160;</a></span>dsu() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">dsu::dsu </td>
<td>(</td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel explicit">explicit</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>constructor for initialising all data members </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">n</td><td>number of elements </td></tr>
</table>
</dd>
</dl>
<p>initially all of them are their own parents</p>
<p class="definition">Definition at line <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html">dsu_union_rank.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 45</span> {</div>
<div class="line"><span class="lineno"> 46</span> <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>.assign(n, 0);</div>
<div class="line"><span class="lineno"> 48</span> <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>.assign(n, 0);</div>
<div class="line"><span class="lineno"> 49</span> <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>.assign(n, 0);</div>
<div class="line"><span class="lineno"> 50</span> <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
<div class="line"><span class="lineno"> 51</span> <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] = i;</div>
<div class="line"><span class="lineno"> 52</span> <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[i] = 0;</div>
<div class="line"><span class="lineno"> 53</span> <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[i] = 1;</div>
<div class="line"><span class="lineno"> 54</span> }</div>
<div class="line"><span class="lineno"> 55</span> }</div>
</div><!-- fragment -->
</div>
</div>
<a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Member Function Documentation</h2>
<a id="a16851f78fe390fc1430905c83d6a2f1c" name="a16851f78fe390fc1430905c83d6a2f1c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a16851f78fe390fc1430905c83d6a2f1c">&#9670;&#160;</a></span>findSet() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">uint64_t dsu::findSet </td>
<td>(</td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>i</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Method to find the representative of the set to which i belongs to, T(n) = O(1) </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>representative of the set to which i belongs to. </dd></dl>
<p>using path compression</p>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00074">74</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"> 74</span> {</div>
<div class="line"><span class="lineno"> 76</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] == i) {</div>
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">return</span> i;</div>
<div class="line"><span class="lineno"> 78</span> }</div>
<div class="line"><span class="lineno"> 79</span> <span class="keywordflow">return</span> (<a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] = <a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(<a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i]));</div>
<div class="line"><span class="lineno"> 80</span> }</div>
<div class="ttc" id="aclassdsu_html_a16851f78fe390fc1430905c83d6a2f1c"><div class="ttname"><a href="#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="../../d3/dae/dsu__path__compression_8cpp_source.html#l00074">dsu_path_compression.cpp:74</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a16851f78fe390fc1430905c83d6a2f1c" name="a16851f78fe390fc1430905c83d6a2f1c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a16851f78fe390fc1430905c83d6a2f1c">&#9670;&#160;</a></span>findSet() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">uint64_t dsu::findSet </td>
<td>(</td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>i</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Method to find the representative of the set to which i belongs to, T(n) = O(logN) </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>representative of the set to which i belongs to </dd></dl>
<p>using union-rank</p>
<p class="definition">Definition at line <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html">dsu_union_rank.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 62</span> {</div>
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">while</span> (i != <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i]) {</div>
<div class="line"><span class="lineno"> 65</span> i = <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i];</div>
<div class="line"><span class="lineno"> 66</span> }</div>
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">return</span> i;</div>
<div class="line"><span class="lineno"> 68</span> }</div>
</div><!-- fragment -->
</div>
</div>
<a id="a0ce2672c570f4235eafddb0c9a58115a" name="a0ce2672c570f4235eafddb0c9a58115a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0ce2672c570f4235eafddb0c9a58115a">&#9670;&#160;</a></span>get()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; uint64_t &gt; dsu::get </td>
<td>(</td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>i</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>prints the minimum, maximum and size of the set to which i belongs to </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00136">136</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"> 136</span> {</div>
<div class="line"><span class="lineno"> 137</span> vector&lt;uint64_t&gt; ans;</div>
<div class="line"><span class="lineno"> 138</span> ans.push_back(<a class="code hl_function" href="#ac713a5b496d0405c82e2808a85e58415">get_min</a>(i));</div>
<div class="line"><span class="lineno"> 139</span> ans.push_back(<a class="code hl_function" href="#a696141b8b092466767f4bfe1c5e46cde">get_max</a>(i));</div>
<div class="line"><span class="lineno"> 140</span> ans.push_back(<a class="code hl_function" href="#a1c24228b0f2f49220133fb8c3566a55c">size</a>(i));</div>
<div class="line"><span class="lineno"> 141</span> <span class="keywordflow">return</span> ans;</div>
<div class="line"><span class="lineno"> 142</span> }</div>
<div class="ttc" id="aclassdsu_html_a1c24228b0f2f49220133fb8c3566a55c"><div class="ttname"><a href="#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="../../d3/dae/dsu__path__compression_8cpp_source.html#l00149">dsu_path_compression.cpp:149</a></div></div>
<div class="ttc" id="aclassdsu_html_a696141b8b092466767f4bfe1c5e46cde"><div class="ttname"><a href="#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="../../d3/dae/dsu__path__compression_8cpp_source.html#l00156">dsu_path_compression.cpp:156</a></div></div>
<div class="ttc" id="aclassdsu_html_ac713a5b496d0405c82e2808a85e58415"><div class="ttname"><a href="#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="../../d3/dae/dsu__path__compression_8cpp_source.html#l00163">dsu_path_compression.cpp:163</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a696141b8b092466767f4bfe1c5e46cde" name="a696141b8b092466767f4bfe1c5e46cde"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a696141b8b092466767f4bfe1c5e46cde">&#9670;&#160;</a></span>get_max()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">uint64_t dsu::get_max </td>
<td>(</td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>i</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A utility function that returns the max element of the set to which i belongs to. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>maximum of the set to which i belongs to </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00156">156</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"> 156</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[<a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</div>
</div><!-- fragment -->
</div>
</div>
<a id="ac713a5b496d0405c82e2808a85e58415" name="ac713a5b496d0405c82e2808a85e58415"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac713a5b496d0405c82e2808a85e58415">&#9670;&#160;</a></span>get_min()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">uint64_t dsu::get_min </td>
<td>(</td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>i</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A utility function that returns the min element of the set to which i belongs to. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>minimum of the set to which i belongs to </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00163">163</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"> 163</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[<a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</div>
</div><!-- fragment -->
</div>
</div>
<a id="ab8ee27083a3c2e2df80755165a2ec280" name="ab8ee27083a3c2e2df80755165a2ec280"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab8ee27083a3c2e2df80755165a2ec280">&#9670;&#160;</a></span>getParents()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; uint64_t &gt; dsu::getParents </td>
<td>(</td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>i</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Method to print all the parents of i, or the path from i to representative. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html#l00120">120</a> of file <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html">dsu_union_rank.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 120</span> {</div>
<div class="line"><span class="lineno"> 121</span> vector&lt;uint64_t&gt; ans;</div>
<div class="line"><span class="lineno"> 122</span> <span class="keywordflow">while</span> (<a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] != i) {</div>
<div class="line"><span class="lineno"> 123</span> ans.push_back(i);</div>
<div class="line"><span class="lineno"> 124</span> i = <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i];</div>
<div class="line"><span class="lineno"> 125</span> }</div>
<div class="line"><span class="lineno"> 126</span> ans.push_back(i);</div>
<div class="line"><span class="lineno"> 127</span> <span class="keywordflow">return</span> ans;</div>
<div class="line"><span class="lineno"> 128</span> }</div>
</div><!-- fragment -->
</div>
</div>
<a id="a64d25c5986742f7c234ed449b2ff7303" name="a64d25c5986742f7c234ed449b2ff7303"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a64d25c5986742f7c234ed449b2ff7303">&#9670;&#160;</a></span>isSame() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool dsu::isSame </td>
<td>(</td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>i</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>j</em></span>&#160;)</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A utility function which check whether i and j belongs to same set or not. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
<tr><td class="paramname">j</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><span class="tt">true</span> if element <span class="tt">i</span> and <span class="tt">j</span> ARE in the same set </dd>
<dd>
<span class="tt">false</span> if element <span class="tt">i</span> and <span class="tt">j</span> are NOT in same set </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00124">124</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"> 124</span> {</div>
<div class="line"><span class="lineno"> 125</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i) == <a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j)) {</div>
<div class="line"><span class="lineno"> 126</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 127</span> }</div>
<div class="line"><span class="lineno"> 128</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 129</span> }</div>
</div><!-- fragment -->
</div>
</div>
<a id="a64d25c5986742f7c234ed449b2ff7303" name="a64d25c5986742f7c234ed449b2ff7303"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a64d25c5986742f7c234ed449b2ff7303">&#9670;&#160;</a></span>isSame() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool dsu::isSame </td>
<td>(</td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>i</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>j</em></span>&#160;)</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A utility function which check whether i and j belongs to same set or not. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
<tr><td class="paramname">j</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><span class="tt">true</span> if element i and j are in same set </dd>
<dd>
<span class="tt">false</span> if element i and j are not in same set </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html#l00108">108</a> of file <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html">dsu_union_rank.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 108</span> {</div>
<div class="line"><span class="lineno"> 109</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i) == <a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j)) {</div>
<div class="line"><span class="lineno"> 110</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 111</span> }</div>
<div class="line"><span class="lineno"> 112</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 113</span> }</div>
</div><!-- fragment -->
</div>
</div>
<a id="a1c24228b0f2f49220133fb8c3566a55c" name="a1c24228b0f2f49220133fb8c3566a55c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1c24228b0f2f49220133fb8c3566a55c">&#9670;&#160;</a></span>size()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">uint64_t dsu::size </td>
<td>(</td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>i</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A utility function that returns the size of the set to which i belongs to. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>size of the set to which i belongs to </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00149">149</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"> 149</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[<a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</div>
</div><!-- fragment -->
</div>
</div>
<a id="a6ac30c07abca2aaa3b291504c25c3559" name="a6ac30c07abca2aaa3b291504c25c3559"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6ac30c07abca2aaa3b291504c25c3559">&#9670;&#160;</a></span>UnionSet()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void dsu::UnionSet </td>
<td>(</td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>i</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>j</em></span>&#160;)</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Method that combines two disjoint sets to which i and j belongs to and make a single set having a common representative. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
<tr><td class="paramname">j</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p>check if both belongs to the same set or not</p>
<p>always keeping the min as x shallow tree</p>
<p>making the shallower root's parent the deeper root</p>
<p>if same depth, then increase one's depth</p>
<p>total size of the resultant set</p>
<p>changing the maximum elements</p>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00088">88</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"> 88</span> {</div>
<div class="line"><span class="lineno"> 90</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a64d25c5986742f7c234ed449b2ff7303">isSame</a>(i, j)) {</div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 92</span> }</div>
<div class="line"><span class="lineno"> 93</span> </div>
<div class="line"><span class="lineno"> 94</span> <span class="comment">// we find the representative of the i and j</span></div>
<div class="line"><span class="lineno"> 95</span> uint64_t x = <a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i);</div>
<div class="line"><span class="lineno"> 96</span> uint64_t y = <a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j);</div>
<div class="line"><span class="lineno"> 97</span></div>
<div class="line"><span class="lineno"> 100</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] &gt; <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
<div class="line"><span class="lineno"> 101</span> std::swap(x, y);</div>
<div class="line"><span class="lineno"> 102</span> }</div>
<div class="line"><span class="lineno"> 104</span> <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[x] = y;</div>
<div class="line"><span class="lineno"> 105</span></div>
<div class="line"><span class="lineno"> 107</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] == <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
<div class="line"><span class="lineno"> 108</span> <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]++;</div>
<div class="line"><span class="lineno"> 109</span> }</div>
<div class="line"><span class="lineno"> 111</span> <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[y] += <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[x];</div>
<div class="line"><span class="lineno"> 113</span> <a class="code hl_variable" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[y] = std::max(<a class="code hl_variable" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[x], <a class="code hl_variable" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[y]);</div>
<div class="line"><span class="lineno"> 114</span> <a class="code hl_variable" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[y] = std::min(<a class="code hl_variable" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[x], <a class="code hl_variable" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[y]);</div>
<div class="line"><span class="lineno"> 115</span> }</div>
<div class="ttc" id="aclassdsu_html_a64d25c5986742f7c234ed449b2ff7303"><div class="ttname"><a href="#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="../../d3/dae/dsu__path__compression_8cpp_source.html#l00124">dsu_path_compression.cpp:124</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a81897528bdb53fd5e796d75d7dbc430f" name="a81897528bdb53fd5e796d75d7dbc430f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a81897528bdb53fd5e796d75d7dbc430f">&#9670;&#160;</a></span>unionSet()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void dsu::unionSet </td>
<td>(</td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>i</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>j</em></span>&#160;)</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Method that combines two disjoint sets to which i and j belongs to and make a single set having a common representative. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">i</td><td>element of some set </td></tr>
<tr><td class="paramname">j</td><td>element of some set </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p>checks if both belongs to same set or not</p>
<p>we find representative of the i and j</p>
<p>always keeping the min as x in order to create a shallow tree</p>
<p>making the shallower tree, root parent of the deeper root</p>
<p>if same depth, then increase one's depth</p>
<p>total size of the resultant set</p>
<p class="definition">Definition at line <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html#l00076">76</a> of file <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html">dsu_union_rank.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 76</span> {</div>
<div class="line"><span class="lineno"> 78</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a64d25c5986742f7c234ed449b2ff7303">isSame</a>(i, j)) {</div>
<div class="line"><span class="lineno"> 79</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 80</span> }</div>
<div class="line"><span class="lineno"> 82</span> uint64_t x = <a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i);</div>
<div class="line"><span class="lineno"> 83</span> uint64_t y = <a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j);</div>
<div class="line"><span class="lineno"> 84</span></div>
<div class="line"><span class="lineno"> 87</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] &gt; <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
<div class="line"><span class="lineno"> 88</span> std::swap(x, y);</div>
<div class="line"><span class="lineno"> 89</span> }</div>
<div class="line"><span class="lineno"> 91</span> <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[x] = y;</div>
<div class="line"><span class="lineno"> 92</span></div>
<div class="line"><span class="lineno"> 94</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] == <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
<div class="line"><span class="lineno"> 95</span> <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]++;</div>
<div class="line"><span class="lineno"> 96</span> }</div>
<div class="line"><span class="lineno"> 98</span> <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[y] += <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[x];</div>
<div class="line"><span class="lineno"> 99</span> }</div>
</div><!-- fragment -->
</div>
</div>
<a name="doc-variable-members" id="doc-variable-members"></a><h2 id="header-doc-variable-members" class="groupheader">Member Data Documentation</h2>
<a id="a4bf54d33fba178998dbbe4c57f2e9429" name="a4bf54d33fba178998dbbe4c57f2e9429"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4bf54d33fba178998dbbe4c57f2e9429">&#9670;&#160;</a></span>depth</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; uint64_t &gt; dsu::depth</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel private">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>tracks the <a class="el" href="#a4bf54d33fba178998dbbe4c57f2e9429" title="tracks the depth(rank) of i in the tree">depth(rank)</a> of i in the tree </p>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
</div>
</div>
<a id="a4ade6f16c418fc98b54452f7b0252a53" name="a4ade6f16c418fc98b54452f7b0252a53"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4ade6f16c418fc98b54452f7b0252a53">&#9670;&#160;</a></span>maxElement</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt;uint64_t&gt; dsu::maxElement</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel private">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>maximum of each set to which i belongs to </p>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
</div>
</div>
<a id="a1d77aad7fc39fe7140d834cd347e5c63" name="a1d77aad7fc39fe7140d834cd347e5c63"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1d77aad7fc39fe7140d834cd347e5c63">&#9670;&#160;</a></span>minElement</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt;uint64_t&gt; dsu::minElement</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel private">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>minimum of each set to which i belongs to </p>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
</div>
</div>
<a id="a1ef0b0462a0dda63514f641cbb7dd8cb" name="a1ef0b0462a0dda63514f641cbb7dd8cb"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1ef0b0462a0dda63514f641cbb7dd8cb">&#9670;&#160;</a></span>p</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; uint64_t &gt; dsu::p</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel private">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>keeps track of the parent of ith element </p>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
</div>
</div>
<a id="ac0dc3e17e49fe19b159b4ea4096d7b55" name="ac0dc3e17e49fe19b159b4ea4096d7b55"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac0dc3e17e49fe19b159b4ea4096d7b55">&#9670;&#160;</a></span>setSize</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d7/dfc/classvector.html">vector</a>&lt; uint64_t &gt; dsu::setSize</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel private">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>size of each chunk(set) </p>
<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
</div>
</div>
<hr/>The documentation for this class was generated from the following files:<ul>
<li>data_structures/<a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a></li>
<li>data_structures/<a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html">dsu_union_rank.cpp</a></li>
</ul>
</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="../../dd/d1f/classdsu.html">dsu</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