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
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
