The most efficient algorithm for finding the number of connected components in…
GATE · 2008 · CS
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.
θ(n)
- B.
θ(m)
- C.
θ(m + n)
- D.
θ(mn)
Attempted by 623 students.
Show answer
Correct answer: C
The worked solution is available to enrolled students.
Video solution available to enrolled students.
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…