Data Structures | Graph | Question 4
The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity.
(C) (m + n)
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
Please Login to comment...