Add Disjoint Union Algorithm

[ZigRazor]

Implementation of Disjoint union algorithm to find connected components in graph efficently.

[hraj43]

hi @ZigRazor i would love to solve this problem...will you provide this to me?

[ZigRazor]

Yes, I assign it to you @harshraj438524 !

[ZigRazor]

@harshraj438524 are you working on it?

[ZigRazor]

Deassigned due to inactivity

[Happylinzy]

I would like to take this request. If I understand it correctly, the algorithm is to implement a union-find algorithm on the graph in Graph.cpp

[ZigRazor]

Yes, I will assign it to you

[Happylinzy]

What is the expected output of union find algorithm?

Here is what I think:
If we want to decide if two nodes are in the same connected components, we could maintain a union find data structure while construcing the graph. Then when the function for example isInSameConnectedComponent called, it directly checks the stored map to get the result.

Then the the modification to the union find map is enbedded into add edge, delete edge method.

[Happylinzy]

In addition, I found that functions used for union find have been implemented as setFind, setUnion in Graph.hpp :).

[ZigRazor]

Ok, so we can close this issue?

[Happylinzy]

Yes. I think we can close it.