How Kruskal's algorithm works?

1.	How Kruskal's algorithm works?
Answer» This algorithm treats the graph as a forest and every node it as an individual tree. A tree connects to another only and only if it has least cost among all available options and does not violate MST properties.

Discussion