Disjoint Set Data Structure | Introduction

A disjoint-set data structure is a data structure that keeps track of a set of elements
partitioned into a number of disjoint (non-overlapping) subsets.

For Example:

Consider that there are 5 students in a classroom namely, A, B, C, D, E.

They will be denoted as 5 different subsets: {A}, {B}, {C}, {D}, {E}.

After some point of time, A became friends with B and C became friend with D. So,
A and B will now belong to same set and C and D will now belong to same set.

The disjoint data structure will now be: {A, B}, {C, D}, {E}.

If at any point in time, we want to check that if any two students are friends or not
then we can simply check if they belong to the same set or not.

As explained above, there are generally two types of operations performed on a

Disjoint-Set data structure:

• Union(A, B): This operation tells to merge the sets containing elements A and
B respectively by performing a Union operation on the sets.
• Find(A): This operation tells to find the subset to which the element A
belongs.

Implementation: The disjoint set data structure can be implemented using a Parent
array representation. If we are dealing with n items, i’th element of the array
represents the i’th item. More precisely, the i’th element of the array is the parent of
the i’th item.

• Implementing Find Operation: Can be implemented by recursively

traversing the parent array until we hit a node who is the parent of itself.

// Finds the representative of the set

// that i is an element of
int find(int i)
{
// If i is the parent of itself
if (parent[i] == i)
{
// Then i is the representative of
// this set
return i;
}
else
 {
// Else if i is not the parent of
// itself, then i is not the
// representative of his set. So we
// recursively call Find on its parent
return find(parent[i]);
}
}

• Implementing Union Operation: It takes, as input, two elements. And finds

the representatives of their sets using the find operation, and finally puts
either one of the trees (representing the set) under the root node of the other
tree, effectively merging the trees and the sets.

// Unites the set that includes i

// and the set that includes j
void union(int i, int j)
{
// Find the representatives
// (or the root nodes) for the set
// that includes i
int irep = find(i),

// And do the same for the set

// that includes j
int jrep = find(j);

// Make the parent of i’s representative

// be j’s representative effectively
// moving all of i’s set into j’s set)
Parent[irep] = jrep;
}

Application: There are a lot of applications of Disjoint-Set data structure. Consider

the problem of detecting a cycle in a Graph. It can be easily solved using the
Disjoint Set and Union-Find algorithm. This method assumes that the graph does not
contain any self-loop.

Let us consider the following graph:

For each edge, make subsets using both the vertices of the edge. If both the vertices
are in the same subset, a cycle is found.

Initially, all slots of parent array are initialized to -1 (means there is only one item in
every subset).

0 1 2
-1 -1 -1

Now process all edges one by one.

• Edge 0-1: Find the subsets to which vertices 0 and 1 belongs to. Since they
are in different subsets, we take the union of them. For taking the union, either
make node 0 as the parent of node 1 or vice-versa.

0 1 2 <----- 1 is made parent of 0

(1 is now representative of subset {0, 1})
1 -1 -1

• Edge 1-2: 1 is in subset 1 and 2 is in subset 2. So, take union.

0 1 2 <----- 2 is made parent of 1

(2 is now representative of subset {0, 1, 2})
1 2 -1

• Edge 0-2: 0 is in subset 2 and 2 is also in subset 2. Hence, including this

edge forms a cycle.

Below is the implementation of the solution to detect cycle using Disjoint-Set:

C++

// A union-find algorithm to detect cycle in a graph

#include <bits/stdc++.h>
using namespace std;

// a structure to represent an edge in graph

class Edge
{
public:
int src, dest;
};

// a structure to represent a graph

class Graph
{
public:
// V-> Number of vertices, E-> Number of edges
int V, E;
// graph is represented as an array of edges
Edge* edge;
};

// Creates a graph with V vertices and E edges

Graph* createGraph(int V, int E)
{
Graph* graph = new Graph();
graph->V = V;
graph->E = E;

graph->edge = new Edge[graph->E * sizeof(Edge)];

return graph;
}

// A utility function to find the subset of an element i

int find(int parent[], int i)
{
if (parent[i] == -1)
return i;
return find(parent, parent[i]);
}

// A utility function to do union of two subsets

void Union(int parent[], int x, int y)
{
int xset = find(parent, x);
int yset = find(parent, y);
if(xset != yset)
{
parent[xset] = yset;
}
}

// The main function to check whether a given graph contains

// cycle or not
int isCycle( Graph* graph )
{
// Allocate memory for creating V subsets
int *parent = new int[graph->V * sizeof(int)];

// Initialize all subsets as single element sets

memset(parent, -1, sizeof(int) * graph->V);

// Iterate through all edges of graph, find subset of both

// vertices of every edge, if both subsets are same, then
// there is cycle in graph.
for(int i = 0; i < graph->E; ++i)
{
int x = find(parent, graph->edge[i].src);
int y = find(parent, graph->edge[i].dest);

if (x == y)
return 1;

Union(parent, x, y);
}
return 0;
}

// Driver code
int main()
{
/* Let us create the following graph
0
|
|
1-----2 */
int V = 3, E = 3;
Graph* graph = createGraph(V, E);

// add edge 0-1

graph->edge[0].src = 0;
graph->edge[0].dest = 1;

// add edge 1-2

graph->edge[1].src = 1;
graph->edge[1].dest = 2;

// add edge 0-2

graph->edge[2].src = 0;
graph->edge[2].dest = 2;

if (isCycle(graph))
cout<<"graph contains cycle";
else
cout<<"graph doesn't contain cycle";

return 0;
}
Run
 Java

// Java Program for union-find algorithm to detect cycle in a graph

import java.util.*;
import java.lang.*;
import java.io.*;

class Graph
{
int V, E; // V-> no. of vertices & E->no.of edges
Edge edge[]; // /collection of all edges

class Edge
{
int src, dest;
};

// Creates a graph with V vertices and E edges

Graph(int v,int e)
{
V = v;
E = e;
edge = new Edge[E];
for (int i=0; i<e; ++i)
edge[i] = new Edge();
}

// A utility function to find the subset of an element i

int find(int parent[], int i)
{
if (parent[i] == -1)
return i;
return find(parent, parent[i]);
}

// A utility function to do union of two subsets

void Union(int parent[], int x, int y)
{
int xset = find(parent, x);
int yset = find(parent, y);
parent[xset] = yset;
}

// The main function to check whether a given graph

// contains cycle or not
int isCycle( Graph graph)
{
// Allocate memory for creating V subsets
int parent[] = new int[graph.V];

// Initialize all subsets as single element sets

for (int i=0; i<graph.V; ++i)
parent[i]=-1;

// Iterate through all edges of graph, find subset of both

// vertices of every edge, if both subsets are same, then
// there is cycle in graph.
for (int i = 0; i < graph.E; ++i)
{
int x = graph.find(parent, graph.edge[i].src);
int y = graph.find(parent, graph.edge[i].dest);

if (x == y)
return 1;

graph.Union(parent, x, y);
}
return 0;
}

// Driver Method
public static void main (String[] args)
{
/* Let us create following graph
0
|
|
1-----2 */
int V = 3, E = 3;
Graph graph = new Graph(V, E);

// add edge 0-1

graph.edge[0].src = 0;
graph.edge[0].dest = 1;

// add edge 1-2

graph.edge[1].src = 1;
graph.edge[1].dest = 2;

// add edge 0-2

graph.edge[2].src = 0;
graph.edge[2].dest = 2;

if (graph.isCycle(graph)==1)
System.out.println( "graph contains cycle" );
else
System.out.println( "graph doesn't contain cycle" );
}
}
Run

Output:
graph contains cycle

Note that the implementation of union() and find() is naive and takes O(n) time in
worst case. These methods can be improved to O(Logn) using Union by Rank or
Height.
Union by Rank and Path Compression
In the previous post, we have introduced union find algorithm and used it to detect
cycle in a graph. We used following union() and find() operations for subsets.

// Naive implementation of find

int find(int parent[], int i)
{
if (parent[i] == -1)
return i;
return find(parent, parent[i]);
}

// Naive implementation of union()

void Union(int parent[], int x, int y)
{
int xset = find(parent, x);
int yset = find(parent, y);
parent[xset] = yset;
}
Run

The above union() and find() are naive and the worst case time complexity is linear.
The trees created to represent subsets can be skewed and can become like a linked
list. Following is an example of the worst case scenario.

Let there be 4 elements 0, 1, 2, 3

Initially, all elements are single element subsets.

0 1 2 3

Do Union(0, 1)
1 2 3
/
 0

Do Union(1, 2)
2 3
/
1
/
0

Do Union(2, 3)
3
/
2
/
1
/
0

The above operations can be optimized to O(Log n) time complexity in worst case.
The idea is to always attach smaller depth tree under the root of the deeper tree.
This technique is called union by rank. The term rank is preferred instead of height
because if path compression technique (we have discussed it below) is used,
then rank is not always equal to height. Also, size (in place of height) of trees can
also be used as rank. Using size as rank also yields worst case time complexity as
O(Logn) (See this for proof)

Let us see the above example with the union by rank

Initially, all elements are single element subsets.
0 1 2 3

Do Union(0, 1)
1 2 3
/
0

Do Union(1, 2)
1 3
/
0 2

Do Union(2, 3)
1
/ |
0 2 3

The second optimization to naive method is Path Compression. The idea is to

flatten the tree when find() is called. When find() is called for an element x, root of
the tree is returned. The find() operation traverses up from x to find root. The idea of
path compression is to make the found root as parent of x so that we don't have to
traverse all intermediate nodes again. If x is root of a subtree, then path (to root)
from all nodes under x also compresses.
Let the subset {0, 1, .. 9} be represented as below and find() is called

for element 3.

/ |

4 5 6

/ /

0 3 7 8

1 2

When find() is called for 3, we traverse up and find 9 as representative

of this subset. With path compression, we also make 3 as the child of 9 so

that when find() is called next time for 1, 2 or 3, the path to root is red
uced.

/ /

4 5 6 3

/ / /

0 7 8 1 2

The two techniques complement each other. The time complexity of each operation
becomes even smaller than O(Logn). In fact, amortized time complexity effectively
becomes small constant.

Following is union by rank and path compression based implementation to find a

cycle in a graph:
C++

// A union by rank and path compression based program

// to detect cycle in a graph

#include <stdio.h>
#include <stdlib.h>
// a structure to represent an edge in the graph
struct Edge {
int src, dest;
};

// a structure to represent a graph

struct Graph {
// V-> Number of vertices, E-> Number of edges
int V, E;

// graph is represented as an array of edges

struct Edge* edge;
};

struct subset {
int parent;
int rank;
};

// Creates a graph with V vertices and E edges

struct Graph* createGraph(int V, int E)
{
struct Graph* graph = (struct Graph*)malloc(sizeof(struct Graph));
graph->V = V;
graph->E = E;

graph->edge = (struct Edge*)malloc(graph->E * sizeof(struct Edge));

return graph;
}

// A utility function to find set of an element i

// (uses path compression technique)
int find(struct subset subsets[], int i)
{
// find root and make root as parent of i (path compression)
if (subsets[i].parent != i)
subsets[i].parent = find(subsets, subsets[i].parent);

return subsets[i].parent;
}

// A function that does union of two sets of x and y

// (uses union by rank)
void Union(struct subset subsets[], int x, int y)
{
int xroot = find(subsets, x);
int yroot = find(subsets, y);

// Attach smaller rank tree under root of high rank tree

// (Union by Rank)
if (subsets[xroot].rank < subsets[yroot].rank)
subsets[xroot].parent = yroot;
else if (subsets[xroot].rank > subsets[yroot].rank)
subsets[yroot].parent = xroot;

// If ranks are same, then make one as root and increment

// its rank by one
else {
subsets[yroot].parent = xroot;
subsets[xroot].rank++;
}
}

// The main function to check whether a given graph contains cycle or not
int isCycle(struct Graph* graph)
{
int V = graph->V;
int E = graph->E;

// Allocate memory for creating V sets

struct subset* subsets = (struct subset*)malloc(V * sizeof(struct subset));

for (int v = 0; v < V; ++v) {

subsets[v].parent = v;
subsets[v].rank = 0;
}

// Iterate through all edges of graph, find sets of both

// vertices of every edge, if sets are same, then there is
// cycle in graph.
for (int e = 0; e < E; ++e) {
int x = find(subsets, graph->edge[e].src);
int y = find(subsets, graph->edge[e].dest);

if (x == y)
return 1;

Union(subsets, x, y);
}
return 0;
}
// Driver program to test above functions
int main()
{
/* Let us create the following graph
0
|
|
1-----2 */

int V = 3, E = 3;
struct Graph* graph = createGraph(V, E);

// add edge 0-1

graph->edge[0].src = 0;
graph->edge[0].dest = 1;

// add edge 1-2

graph->edge[1].src = 1;
graph->edge[1].dest = 2;

// add edge 0-2

graph->edge[2].src = 0;
graph->edge[2].dest = 2;

if (isCycle(graph))
printf("Graph contains cycle");
else
printf("Graph doesn't contain cycle");

return 0;
}
Run

Java
Output:
Graph contains cycle
Kruskal’s Minimum Spanning Tree Algorithm
What is Minimum Spanning Tree?
Given a connected and undirected graph, a spanning tree of that graph is a
subgraph that is a tree and connects all the vertices together. A single graph can
have many different spanning trees. A minimum spanning tree (MST) or minimum
weight spanning tree for a weighted, connected and undirected graph is a spanning
tree with weight less than or equal to the weight of every other spanning tree. The
weight of a spanning tree is the sum of weights given to each edge of the spanning
tree.

Number of edges in a minimum spanning tree: A minimum spanning tree has (V

– 1) edges where V is the number of vertices in the given graph.

Algorithm: The Kruskal's algorithm for finding MST works on a Greedy method.

1. Sort all the edges of the given graph in increasing order according to their
weight.
2. Pick the smallest edge. Check if it forms a cycle with the spanning tree formed
so far. If cycle is not formed, include this edge. Else, discard it.
3. Repeat step 2 until there are (V-1) edges in the spanning tree.

Note: In Step 2 to check if adding an edge forms a cycle or not efficiently, Union-
Find algorithm is used.

Illustration: Consider the below input graph.

The graph contains 9 vertices and 14 edges. So, the minimum spanning tree formed
will be having (9 - 1) = 8 edges.

After sorting:
Weight Src Dest
1 7 6
2 8 2
2 6 5
4 0 1
4 2 5
6 8 6
7 2 3
7 7 8
8 0 7
8 1 2
9 3 4
10 5 4
11 1 7
14 3 5

Now pick all edges one by one from sorted list of edges:
1. Pick edge 7-6: No cycle is formed, include it.

2. Pick edge 8-2: No cycle is formed, include it.

3. Pick edge 6-5: No cycle is formed, include it.

4. Pick edge 0-1: No cycle is formed, include it.

5. Pick edge 2-5: No cycle is formed, include it.

6. Pick edge 8-6: Since including this edge results in cycle, discard it.
7. Pick edge 2-3: No cycle is formed, include it.

8. Pick edge 7-8: Since including this edge results in cycle, discard it.
 9. Pick edge 0-7: No cycle is formed, include it.

10. Pick edge 1-2: Since including this edge results in cycle, discard it.
11. Pick edge 3-4: No cycle is formed, include it.

Since the number of edges included equals (V - 1), the algorithm stops here.

Implementation:
C++

// C++ code to implement Kruskal's Algorithm

// to find the MST

#include <bits/stdc++.h>
using namespace std;

// Function to implement find root method

// of the union find algorithm
int findRoot(int node, int parent[])
{
// Find root of set that contains node, node
while (parent[node] != node) {
parent[node] = parent[parent[node]];
node = parent[node];
}

return node;
}

// Function to perform union of two sets,

// node1 and node2 belongs to
void unionSets(int node1, int node2, int parent[])
{
// Find root of set, node1 belongs to
int p1 = findRoot(node1, parent);
// Find root of set, node2 belongs to
int p2 = findRoot(node2, parent);

// Make parent of p1 as p2, to join two sets

parent[p1] = parent[p2];
}

// Function to implement the kruskal's MST Algorithm

int kruskalMST(pair<int, pair<int, int> > graph[],
int V, int E)
{
// Parent array for union-find Algorithm
int parent[V];

// Initialize the parent array

for (int i = 0; i < V; i++) {
parent[i] = i;
}

int u, v, cost, minCost = 0;

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

u = graph[i].second.first;
v = graph[i].second.second;
cost = graph[i].first;

// Check if selected edge will form

// a cycle or not
// --> It will form a cycle if they belongs
// to the same set
if (findRoot(u, parent) != findRoot(v, parent)) {
minCost += cost;
unionSets(u, v, parent);
}
}

return minCost;
}

// Driver Code
int main()
{
/* Let us create following weighted graph
10
0--------1
||
6| 5 |15
||
2--------3
4 */
int V = 4; // Number of vertices in graph
int E = 5; // Number of edges in graph

// Declare a list of Pair of Pair

// pair<int, pair<int, int> > graph[],
// such that graph.first is the weight of an edge
// and, graph.second.first and graph.second.second
// are the vertices joined to form the edge
pair<int, pair<int, int> > graph[E];

// add edge 0-1

graph[0].first = 10;
graph[0].second.first = 0;
graph[0].second.second = 1;

// add edge 0-2

graph[1].first = 6;
graph[1].second.first = 0;
graph[1].second.second = 2;

// add edge 0-3

graph[2].first = 5;
graph[2].second.first = 0;
graph[2].second.second = 3;

// add edge 1-3

graph[3].first = 15;
graph[3].second.first = 1;
graph[3].second.second = 3;

// add edge 2-3

graph[4].first = 4;
graph[4].second.first = 2;
graph[4].second.second = 3;

// Sort the graph according to weight of edges

sort(graph, graph + E);

// Apply Kruskal's Algorithm

int minCost = kruskalMST(graph, V, E);
cout << "The cost of MST is: " << minCost;

return 0;
}
Run
Java

import java.util.Arrays;

// Class that represents an edge of the graph

class Edge implements Comparable<Edge>{

// Weight of the edge

int weight;

// Vertices on both ends of the edge

int u, v;

Edge(int weight, int u, int v) {

this.weight = weight;
this.u = u;
this.v = v;
}

@Override
public int compareTo(Edge o) {
if(this.weight > o.weight)
return 1;
return -1;
}
}

class GFG {

// Function to implement find root method

// of the union find algorithm
static int findRoot(int node, int parent[])
{
// Find root of set that contains node, node
while(parent[node] != node)
{
parent[node] = parent[parent[node]];
node = parent[node];
}

return node;
}

// Function to perform union of two sets,

// node1 and node2 belongs to
static void unionSets(int node1, int node2, int parent[])
{
// Find root of set, node1 belongs to
int p1 = findRoot(node1, parent);

// Find root of set, node2 belongs to

int p2 = findRoot(node2, parent);

// Make parent of p1 as p2, to join two sets

parent[p1] = parent[p2];
}

// Function to implement the kruskal's MST Algorithm

static int kruskalMST(Edge edge[], int V, int E)
{
// Parent array for union-find Algorithm
int parent[] = new int[V];

// Initialize the parent array

for(int i=0; i<V; i++)
{
parent[i] = i;
}

int u, v, cost, minCost = 0;

for(int i = 0; i<E; i++)

{
u = edge[i].u;
v = edge[i].v;
cost = edge[i].weight;

// Check if selected edge will form

// a cycle or not
// --> It will form a cycle if they belongs
// to the same set
if(findRoot(u,parent)!=findRoot(v,parent))
{
minCost += cost;
unionSets(u, v, parent);
}
}
return minCost;
}

// Driver code
public static void main(String[] args)
{
/* Let us create following weighted graph
10
0--------1
||
6| 5 |15
||
2--------3
4 */
int V = 4; // Number of vertices in graph
int E = 5; // Number of edges in graph

// Declare a list of Pair of Pair

// pair<int, pair<int, int> > graph[],
// such that graph.first is the weight of an edge
// and, graph.second.first and graph.second.second
// are the vertices joined to form the edge
Edge edge[] = new Edge[E];

// add edge 0-1

edge[0] = new Edge(10, 0, 1);

// add edge 0-2

edge[1] = new Edge(6, 0, 2);

// add edge 0-3

edge[2] = new Edge(5, 0, 3);

// add edge 1-3

edge[3] = new Edge(15, 1, 3);

// add edge 2-3

edge[4] = new Edge(4, 2, 3);

// Sort the graph according to weight of edges

Arrays.sort(edge);

// Apply Kruskal's Algorithm

int minCost = kruskalMST(edge, V, E);
System.out.print("The cost of MST is: "+minCost);
}
}
Run

Output:
The cost of MST is: 19

Time Complexity: O(ElogE) or O(ElogV). Sorting of edges takes O(ELogE) time.

After sorting, we iterate through all edges and apply find-union algorithm. The find
and union operations can take at most O(LogV) time. So overall complexity is
O(ELogE + ELogV) time. The value of E can be at most O(V2), so O(LogV) is
O(LogE) same. Therefore, the overall time complexity is O(ElogE) or O(ElogV).