backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-25 22:32:24 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 95ed72a452

Browse Source
This commit is contained in:
github-actions
2021-10-15 16:44:16 +00:00
parent 567c4ff764
commit 7e9f4857e2
365 changed files with 6848 additions and 4620 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
d8/d99/connected__components__with__dsu_8cpp.html
View File

@@ -155,7 +155,7 @@ uint32_t&#160;</td><td class="memItemRight" valign="bottom"><b>graph::disjoint_u
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p ><a href="https://en.wikipedia.org/wiki/Disjoint_union" target="_blank">Disjoint union</a> </p>
<p >The Disjoint union is the technique to find connected component in graph efficiently.</p>
<h3><a class="anchor" id="autotoc_md67"></a>
<h3><a class="anchor" id="autotoc_md68"></a>
Algorithm</h3>
<p >In <a class="el" href="../../da/d9a/class_graph.html">Graph</a>, if you have to find out the number of connected components, there are 2 options</p><ol type="1">
<li>Depth first search</li>