Data Structures | Graph | Question 4

The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity.
(A) \theta(n)
(B) \theta(m)
(C) \theta(m + n)
(D) \theta(mn)
(A) A
(B) B
(C) C
(D) D


Answer: (C)

Explanation: Connected components can be found in O(m + n) using Tarjan’s algorithm. Once we have connected components, we can count them.


Quiz of this Question

GATE CS Corner    Company Wise Coding Practice

Recommended Posts:



0 Average Difficulty : 0/5.0
No votes yet.