backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-11 19:17:21 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 554919d9f5

Browse Source
This commit is contained in:
github-actions
2021-06-18 19:59:15 +00:00
parent bc934f2570
commit d0120f0375
1878 changed files with 40247 additions and 10729 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
de/d23/disjoint__set_8cpp.html
View File

@@ -134,7 +134,7 @@ Variables</h2></td></tr>
<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">Disjoint Sets Data Structure (Disjoint Sets)</a> </p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/leoyang429">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 Minimum Spanning Tree etc. There are two operation which we perform on disjoint sets - 1) Union 2) Find </p>
<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>
<a id="a010965fc5f16cca5a62506afab24e4ec"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a010965fc5f16cca5a62506afab24e4ec">&#9670;&nbsp;</a></span>CreateSet()</h2>