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

union find

PrashantUnity answered on November 24, 2022 Popularity 10/10 Helpfulness 2/10

answer union find

related union find code

union find

Comment

public class Solution 
{
    int[] array;
    int[] rank;
    public  bool ValidPath(int n, int[][] edges, int source, int destination)
    {
        array = new int[n];
        rank = new int[n];
        for (int i = 0; i < n; i++)
        {
            array[i] = i;
            rank[i] = i;
        }

        foreach (var item in edges)
        {
            Union(item[0], item[1]);
        }

        return Find(source) == Find(destination);

    }
    public int Find(int x)
    {
        if (array[x] == x) return x;
        return array[x] = Find(array[x]);
    }
    public void Union(int a, int b)
    {
        int x = Find(a);
        int y = Find(b);

        if (x == y) return;
        if (rank[x] < rank[y])
        {
            array[x] = y;
        }
        else if (rank[x] > rank[y])
        {
            array[y] = x;
        }
        else
        {
            array[y] = x;
            rank[x] += 1;
        }
    }
}

Popularity 10/10 Helpfulness 2/10 Language csharp

Source: leetcode.com

Tags: c# union-find

Link to this answer
Share Copy Link

Contributed on Nov 24 2022

PrashantUnity

0 Answers Avg Quality 2/10

Closely Related Answers

union find code

Comment

class UnionFind {
private:
    vector<int> parent, rank;

public:
    UnionFind(int size) {
        parent.resize(size);
        rank.resize(size, 0);
        for (int i = 0; i < size; i++) {
            parent[i] = i;
        }
    }
    int find(int x) {
        if (parent[x] != x) parent[x] = find(parent[x]);
        return parent[x];
    }
    void union_set(int x, int y) {
        int xset = find(x), yset = find(y);
        if (xset == yset) {
            return;
        } else if (rank[xset] < rank[yset]) {
            parent[xset] = yset;
        } else if (rank[xset] > rank[yset]) {
            parent[yset] = xset;
        } else {
            parent[yset] = xset;
            rank[xset]++;
        }
    }
};

Popularity 10/10 Helpfulness 2/10 Language cpp

Source: Grepper

Tags: union-find u

Link to this answer
Share Copy Link

Contributed on Feb 19 2023

Divyam Dubey

0 Answers Avg Quality 2/10

union find

Contents

More Related Answers

union find

Closely Related Answers

union find code

Grepper

Documentation

Social

Legal

Contact

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