In a depth-first traversal of a graph G with n vertices, k edges are marked as…
GATE · 2005 · IT
In a depth-first traversal of a graph G with n vertices, k edges are marked as tree edges. The number of connected components in G is
- A.
k
- B.
k + 1
- C.
n - k - 1
- D.
n - k
Attempted by 313 students.
Sign up free to check your answer
Sign up freeLoading lesson…