backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-04 06:30:54 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 0931d530ae

Browse Source
This commit is contained in:
github-actions
2023-01-22 19:44:10 +00:00
parent a448f64699
commit b48f6e8671
2457 changed files with 9513 additions and 8691 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
de/d23/disjoint__set_8cpp.html
View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.5"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures/disjoint_set.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.5 -->
<!-- Generated by Doxygen 1.9.6 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -138,7 +138,7 @@ Variables</h2></td></tr>
<tr class="separator:a9bbf7f3dcc785986a407cfb70f54e303"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 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>
<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>
</div><h2 class="groupheader">Function Documentation</h2>
@@ -157,7 +157,7 @@ Variables</h2></td></tr>
</tr>
</table>
</div><div class="memdoc">
<p >Function to create a set </p><dl class="params"><dt>Parameters</dt><dd>
<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>
@@ -189,7 +189,7 @@ Variables</h2></td></tr>
</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>
<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>
@@ -237,7 +237,7 @@ Here is the call graph for this function:</div>
</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>
<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>
@@ -269,7 +269,7 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p >Main function </p>
<p>Main function </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>
@@ -331,7 +331,7 @@ Here is the call graph for this function:</div>
</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>
<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>
@@ -366,7 +366,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" 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.9.5 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.6 </li>
</ul>
</div>
</body>