Vidyalelo
Data Structure · Q129

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 129

Q129

What is the time complexity of Kruskal's algorithm?

A.
O(log V)
B.
O(E log V)
Answer
C.
O(E2)
D.
O(V log E)

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board