Kruskal's algorithm is used to | What is a Disjoint Set

 kruskal's algorithm is used to

1. Kruskal algorithm is a minimum spanning tree type algorithm which can be applied to disjoint vertices or edges set. It is also a greedy algorithm.

2. Kruskal algorithm is generally used to find the minimum spanning path in a weight-connected graph tree. 

3. Kruskal algorithm is used to solve the Grid system to find the electricity path.

4. It is used to find the least possible weight path that connected two vertices in a graph.

5. The real-life use of this algorithm is seen in the LAN and TV networks.

what is a disjoint set?

The word 'disjoint' means that is non-connected or not common between two elements. In graph theory, it can be said by the 'disjoint set' that the sets of edges or vertices in a graph are not common.

Fig. 01: Joint set graph to Disjoint set graph

In the above righ side graph, the two set are, 

Set1={A, B}

Set2={C, D, E}

Set1 ∩ Set2 = {A, B} ∩ {C, D, E}

            = Φ

There are no common elements between Set1 and Set2.

Read Similar Post: Bellman ford algorithm | Negative Weight Cycle