1.

If Kruskal’s algorithm is used for finding a minimum spanning tree of a weighted graph G with n vertices and m edges and edge weights are already given in a sorted list, then, What will be the time complexity to compute the minimum cost spanning tree given that union and find operations take amortized O(1) ?(A) O(m logn)(B) O(n)(C) O(m)(D) O(n logm)

Answer»


Discussion

No Comment Found

Related InterviewSolutions