Can implement Prim's algo in O(nlogn) ?

Revision en1, by VietCT, 2020-06-30 15:07:45

I was wondering if we could implement Prim's algo in O(n log n) (n is number of vertices)

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English VietCT 2020-06-30 15:07:45 128 Initial revision (published)