Graph Algorithm 8

0. Consider the following graph

 Among the following sequences
 1. abeghf
 2. abfehg
 3. abfhge
 4. afghbe
 Which are depth first traversals of the above graph?

  • Option : D
  • Explanation :
    (1) a b e g h f
    (3) a b f h g e
    (4) a f g h b e is possible DFS of given graph.
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 *