Kruskal's algorithm is a minimum spanning tree algorithm that connects all vertices in a graph while minimizing total edge weight.

• Sort edges in ascending order

• Add edges one by one to spanning tree

• Ensu...read more