1
GATE CSE 1991
MCQ (More than One Correct Answer)
+2
-0
Kruskal’s algorithm for finding a minimum spanning tree of a weighted graph G with n vertices and m edges has the time complexity of:
A
$$O(n^{2})$$
B
O(mn)
C
$$O(m^2)$$
D
$$O(m \log n)$$

GATE CSE Subjects

Browse all chapters by subject

Software Engineering
Web Technologies