Question

Using java Create a DisjointSetADT class with “Union” and “Find” operations. In the union operation consider the weight of the parents and make the heavier set as the parent set of the lighter set

Answer 1

class DisjointSetADT {

    int[] rank, parent;

    int n;

    // Constructor

    public DisjointUnionSets(int n)

    {

        rank = new int[n];

        parent = new int[n];

        this.n = n;

        makeSet();

    }

    void makeSet() {

        for (int i = 0; i < n; i++) {

            parent[i] = i;

        }

    }

    // Returns representative of x's set

    int find(int x) {

        // Finds the representative of the set

        // that x is an element of

        if (parent[x] != x) {

            parent[x] = find(parent[x]);

        }

        return parent[x];

    }

    // Unites the set that includes x and the set

    // that includes x

    void union(int x, int y) {

        // Find representatives of two sets

        int xRoot = find(x), yRoot = find(y);

        // Elements are in the same set, no need

        // to unite anything.

        if (xRoot == yRoot)

            return;

        if (rank[xRoot] < rank[yRoot])

            parent[xRoot] = yRoot;

        // Else if y's rank is less than x's rank

        else if (rank[yRoot] < rank[xRoot])

            parent[yRoot] = xRoot;

        else // if ranks are the same

        {

            parent[yRoot] = xRoot;

            rank[xRoot] = rank[xRoot] + 1;

        }

    }

}

This is only the class of disjoint set class, I have wriiten whatever Ih ave done. I hope it helps you. Thank you