GATE | GATE CS 2008 | Question 85

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) &thetha;(n)
(B) &thetha;(m)
(C) &thetha;(m + n)
(D) &thetha;(mn)

Answer: (C)

Explanation: Number of connected components in undirected graph can simply calculated by doing a BFS or DFS. The best possible time complexity of BFS and DFS is O(m + n).

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.