if the graph is not connected, then it finds a minimum spanning forest a minimum spanning tree for each connected component .
if the graph is not connected, then it finds a minimum spanning forest a minimum spanning tree for each connected component . | MalKruskal