Question 10464 – Algorithms

Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges if the edges are sorted is __________

Correct Answer: A

Question 39 Explanation:

Though the edges are to be sorted still due to union find operation complexity is O(m log n).

O(m log n)

0 0 votes

Article Rating

0 Comments

Inline Feedbacks

View all comments