Breaking News: Grepper is joining You.com. Read the official announcement!

disjoint set union

Sumit Rawal answered on October 18, 2022 Popularity 10/10 Helpfulness 1/10

answer disjoint set union

disjoint set union

Comment

//User function Template for Java


class Solution
{
    //Function to merge two nodes a and b.
    public void union_(int x, int y, int parent[], int rank[])
    {
        int x_parent = find(parent, x);
        int y_parent = find(parent, y);
        
        if(x_parent == y_parent)
            return;
            
        if(rank[x_parent]>rank[y_parent])
        {
            parent[y_parent] = x_parent;
            rank[x_parent]+=1;
        }
        else
        {
            parent[x_parent] = y_parent;
            y_parent+=1;
        }

    }

    //Function to check whether 2 nodes are connected or not.
    public Boolean isConnected(int a, int b, int par[], int rank[])
    {
        return find(par,a) == find(par,b);
    }
    
    int find(int[] parent, int x)
    {
        if(parent[x] == x)
            return x;
        return find(parent, parent[x]);
    }
    

}

Popularity 10/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: set-union whatever

Link to this answer
Share Copy Link

Contributed on Oct 18 2022

Sumit Rawal

0 Answers Avg Quality 2/10

disjoint set union

Contents

More Related Answers

disjoint set union

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.