Bandwidth
May 6, 2024Question 680 – RAM
May 6, 2024Question 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)