Basic Elements of Kruskal's MST Algorithm

Steps:

1. Sort edges in increasing order by weight
2. Initialize MST set
3. For each edge:
   1. Check if nodes connected by edge are already in MST
   2. If so, continue
   3. Otherwise, add edge to MST and merge the two sets
4. Repeat for each edge

Additional information: link here