The most efficient algorithm for finding the number of connected components in…

PYQ GATE 2008

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

  1. A.

    θ(n)

  2. B.

    θ(m)

  3. C.

    θ(m + n)

  4. D.

    θ(mn)

Attempted by 787 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…