Scribd Logo
Upload

Welcome to Scribd!

  • Disjointset Snippet

    Uploaded by

    Kriti Chawre
    6 views1 page
    This document defines a Disjointset class that represents disjoint sets using parent pointers and handles union operations. The class initializes each element as its own set, provides a findparent method to find the representative element of a set, and offers two union methods - UnionByRank that unions by rank to keep trees short, and UnionBySize that unions by size to balance load.

    Original Description:

    disjoint set

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document defines a Disjointset class that represents disjoint sets using parent pointers and handles union operations. The class initializes each element as its own set, provides a findparent method to find the representative element of a set, and offers two union methods - UnionByRank that unions by rank to keep trees short, and UnionBySize that unions by size to balance load.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views1 page

    Disjointset Snippet

    Uploaded by

    Kriti Chawre
    This document defines a Disjointset class that represents disjoint sets using parent pointers and handles union operations. The class initializes each element as its own set, provides a findparent method to find the representative element of a set, and offers two union methods - UnionByRank that unions by rank to keep trees short, and UnionBySize that unions by size to balance load.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    class Disjointset{

    public:
    vector<int>parent,rank,size;
    Disjointset(int n){
    rank.resize(n+1,0);
    size.resize(n+1,0);
    parent.resize(n+1,0);
    for(int i=0;i<=n;i++){
    parent[i]=i;
    size[i]=1;
    }
    }
    int findparent(int node){
    if(node==parent[node]){
    return node;
    }
    return parent[node]=findparent(parent[node]);
    }
    void UnionByRank(int node1,int node2){
    int u=findparent(node1);
    int v=findparent(node2);
    if(u == v) return;
    if(rank[u]<rank[v]){
    parent[u]=v;
    }
    else if(rank[u]>rank[v]){
    parent[v]=u;
    }
    else{
    parent[v]=u;
    rank[u]++;
    }
    }
    void UnionBySize(int node1,int node2){
    int u=findparent(node1);
    int v=findparent(node2);
    if(u == v) return;
    if(size[u]<size[v]){
    parent[u]=v;
    size[v]+=size[u];
    }
    else{
    parent[v]=u;
    size[u]+=size[v];
    }
    }
    };

    You might also like