diff options
| author | kittobi92 <Tobias.Heuer@gmx.net> | 2015-12-04 15:32:23 +0100 |
|---|---|---|
| committer | kittobi92 <Tobias.Heuer@gmx.net> | 2015-12-04 15:32:23 +0100 |
| commit | 4b6ef9c2f29674e15b8528a408134b029fd64e06 (patch) | |
| tree | 44a7a08b63873156b9fd0e13630d0f3de15e27ec /datastructures/unionFind2.cpp | |
| parent | c57a6957af68785d8b2d884eeecb4197ff68d0ef (diff) | |
Add additional UnionFind-Datastructure
Diffstat (limited to 'datastructures/unionFind2.cpp')
| -rw-r--r-- | datastructures/unionFind2.cpp | 27 |
1 files changed, 27 insertions, 0 deletions
diff --git a/datastructures/unionFind2.cpp b/datastructures/unionFind2.cpp new file mode 100644 index 0000000..b26ec75 --- /dev/null +++ b/datastructures/unionFind2.cpp @@ -0,0 +1,27 @@ +vector<int> uf; + +init(int N) { + uf.assign(N,-1); //-1 indicates that every subset has size 1 +} + +int findSet(int i) { + if(uf[i] < 0) return i; //If uf[i] < 0 we have reach a root + uf[i] = findSet(uf[i]); //Path-Compression + return uf[i]; +} + +void linkSets(int i, int j) { + //Take |uf[i]|, where i must be a root, to get the size + //of the subset + if(abs(uf[i]) < abs(uf[j])) { //Union-by-size. + uf[j] += uf[i]; uf[i] = j; + } else { + uf[i] += uf[j]; uf[j] = i; + } +} + +void unionSets(int i, int j) { + if(findSet(i) != findSet(j)) linkSets(findSet(i),findSet(j)); +} + + |
