(int node1, int node2)
| 48 | } |
| 49 | |
| 50 | void union(int node1, int node2) { |
| 51 | int rootParent1 = find(node1); |
| 52 | int rootParent2 = find(node2); |
| 53 | |
| 54 | if (rootParent1 == rootParent2) { |
| 55 | return; |
| 56 | } |
| 57 | if (size[rootParent1] > size[rootParent2]) { |
| 58 | parent[rootParent2] = rootParent1; |
| 59 | size[rootParent1] += size[rootParent2]; |
| 60 | } else { |
| 61 | parent[rootParent1] = rootParent2; |
| 62 | size[rootParent2] += size[rootParent1]; |
| 63 | } |
| 64 | } |
| 65 | } |
| 66 | } |
no test coverage detected