Data Structures | Graph | Question 4

Last Updated :
Discuss
Comments

The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity.

theta(n)

theta(m)

theta(m + n)

theta(mn)

This question is part of this quiz :

Top MCQs on Graph Data Strcuture with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy