Skip to content
Related Articles

Related Articles

Data Structures | Graph | Question 4
  • Last Updated : 19 Feb, 2013

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

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up
Recommended Articles
Page :