Open In App

Data Structures | Graph | Question 4

Last Updated : 28 Jun, 2021
Like Article
Like
Save
Share
Report

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)



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
Please comment below if you find anything wrong in the above post


Like Article
Suggest improvement
Previous
Next
Share your thoughts in the comments

Similar Reads