(int node)
| 40 | |
| 41 | // Find root of component with path compression |
| 42 | int find(int node) { |
| 43 | if (parent[node] == node) { |
| 44 | return node; |
| 45 | } |
| 46 | parent[node] = find(parent[node]); |
| 47 | return parent[node]; |
| 48 | } |
| 49 | |
| 50 | void union(int node1, int node2) { |
| 51 | int rootParent1 = find(node1); |
no outgoing calls
no test coverage detected