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) &thetha;(n)
(B) &thetha;(m)
(C) &thetha;(m + n)
(D) &thetha;(mn)
Answer: (C)
Explanation: Number of connected components in undirected graph can simply calculated by doing a BFS or DFS. The best possible time complexity of BFS and DFS is O(m + n).
Quiz of this Question
Recommended Posts:
- GATE | GATE CS 2008 | Question 85
- GATE | GATE CS 2008 | Question 84
- GATE | GATE CS 2008 | Question 83
- GATE | GATE CS 2008 | Question 85
- GATE | GATE CS 2008 | Question 72
- GATE | GATE CS 2008 | Question 71
- GATE | GATE CS 2008 | Question 70
- GATE | GATE CS 2008 | Question 69
- GATE | GATE CS 2008 | Question 68
- GATE | GATE CS 2008 | Question 67
- GATE | GATE CS 2008 | Question 66
- GATE | GATE CS 2008 | Question 85
- GATE | GATE CS 2008 | Question 73
- GATE | GATE CS 2008 | Question 74
- GATE | GATE CS 2008 | Question 81
- GATE | GATE CS 2008 | Question 80
- GATE | GATE CS 2008 | Question 79
- GATE | GATE CS 2008 | Question 78
- GATE | GATE CS 2008 | Question 77
- GATE | GATE CS 2008 | Question 76
