DT Q11

Home
DT Q11

0. 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 ________.

Answer
Comment
Array

Option : A
Explanation :
O(m + n) Because, edges are sorted so , no need to make min heap, so deletion from min heap time is saved.

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.