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

documentation changes

Browse Source
This commit is contained in:
Aayush Vyas
2021-09-04 08:40:29 +05:30
committed by GitHub
parent 2c60e72a6c
commit d21cd78d2b
1 changed files with 9 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
data_structures/dsu_path_compression.cpp
View File

@@ -94,21 +94,21 @@ class dsu {
uint64_t x = findSet(i);
uint64_t y = findSet(j);
// always keeping the min as x
// shallow tree
/// always keeping the min as x
/// shallow tree
if (depth[x] > depth[y]) {
std::swap(x, y);
}
// making the shallower root's parent the deeper root
/// making the shallower root's parent the deeper root
p[x] = y;
// if same depth then increase one's depth
/// if same depth, then increase one's depth
if (depth[x] == depth[y]) {
depth[y]++;
}
// total size of the resultant set.
/// total size of the resultant set
setSize[y] += setSize[x];
// changing the maximum elements
/// changing the maximum elements
maxElement[y] = std::max(maxElement[x], maxElement[y]);
minElement[y] = std::min(minElement[x], minElement[y]);
}
@@ -176,10 +176,10 @@ static void test1() {
for (uint64_t i = 0; i < ans.size(); i++) {
assert(d.get(4).at(i) == ans[i]); // makes sure algorithm works fine
}
cout << "Test case# 1: passed" << endl;
cout << "1st test passed!" << endl;
}
/**
* @brief Self-implementation Test case #2
* @brief Self-implementations, 2nd test
* @returns void
*/
static void test2() {
@@ -194,7 +194,7 @@ static void test2() {
for (uint64_t i = 0; i < ans.size(); i++) {
assert(d.get(3).at(i) == ans[i]); // makes sure algorithm works fine
}
cout << "Test case# 2: passed" << endl;
cout << "2nd test passed!" << endl;
}
/**