c++,algorithm,graph-algorithm,disjoint-sets,union-find

MAKE-SET(v) means that you're initializing a set consisting of only the vertex v. Initially, each vertex is in a set on its own. FIND-SET(u) is a function that tells you which set a vertex belongs to. It must return a pointer or an ID number that uniquely identifies the set....

c++,algorithm,data-structures,disjoint-sets,disjoint-union

Each union operaiton on two items a,b in Disjoint Set Data Structure has two possible scenarios: You tried to unite items from the same set. In this case, nothing is done, and number of disjoint sets remain the same. You united items from two different sets, so you basically converged...

python,class,methods,set,disjoint-sets

Here's a small sample code on how to use the provided UnionFind class. Initialization The only way to create a set using the provided class is to FIND it, because it creates a set for a point only when it doesn't find it. You might want to create an initialization...

c++,algorithm,data-structures,disjoint-sets,disjoint-union

In your Union function, check if both nodes are already in the same set. if(xNode && yNode && xNode != yNode) link(xNode,yNode); ...