Follow Us :

Graph Algorithm 9

6In 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
  • Option : D
  • Explanation :
    If n vertex and K edges are there then the number of connected component in the graph is n – K.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *