Kruskal Algorithm on disconnected graph

Revision en1, by aya1909, 2020-10-21 16:07:45

what will happen if i run kruskal algorithm on disconected graph?? Actual problem is given n disconnected undirected graphs find kth largest value of mst of all graphs


  Rev. Lang. By When Δ Comment
en1 English aya1909 2020-10-21 16:07:45 208 Initial revision (published)