Skip to content
Related Articles
Open in App
Not now

Related Articles

Data Structures | Graph | Question 4

Improve Article
Save Article
  • Last Updated : 28 Jun, 2021
Improve Article
Save Article

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

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!