OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

made find_set method efficient

Browse Source
This commit is contained in:
Sagar Pandya 2020-10-28 18:07:01 +05:30
parent 07d9190a95
commit f3e58c0f05
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
graph/connected_components_with_dsu.cpp
View File

@ -7,7 +7,7 @@
*
* ### Algorithm
* In Graph, if you have to find out the number of connected components, there are 2 options
* 1. Use Depth first search
* 1. Depth first search
* 2. Disjoint union
* 1st option is inefficient, Disjoint union is the most optimal way to find this.
*/
@ -34,10 +34,11 @@ void make_set() {
* @return parent of val
*/
int find_set(int val) {
if (val == parent[val]) {
return val;
while (parent[val] != val) {
parent[val] = parent[parent[val]];
val = parent[val];
}
return parent[val] = find_set(parent[val]);
return val;
}
/**
* @brief To join 2 components to belong to one