Kruskal's Algorithm for Dense Graph

Revision en1, by aniervs, 2019-12-21 00:33:55

Hello, how can Kruskal's algorithm be modified to run in O(n^2) time in a dense graph of n nodes??

Tags mst, kruskal, #graph

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English aniervs 2019-12-21 00:33:55 133 Initial revision (published)