Graph Algorithm 4

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

Answer
Comment
Array

Option : C
Explanation :
The most efficient algorithm for finding the number of connected components (articulation point) in an undirected graph on n vertices and n edges using depth-first search takes O(m + n) time.Assume n ≤ m

Forgot your password?

I agree with the Terms.