Consider the following graph

Among the following sequences I a b e g h f II a b f e h g III a b f h g e IV a f g h b e

Which are depth first traversals of the above graph?

Keep practicing — related questions

• Consider the undirected unweighted graph G. Let a breadth-first traversal of G be done starting from a node...
• The Depth-First Search uses
• Consider the label sequences obtained by the following pairs of traversals on a labeled binary tree. Which ...
• Consider an undirected graph G with 'n' vertices and 'e' edges. What is the time taken by Depth First Searc...
• Which of the following traversal is used for Graph?
• Level order traversal of a rooted tree can be done by stating from the root and performing
• Post order traversal of a given binary search tree, T produces the following sequence of keys 10, 9, 23, 22...
• Directions: Read the following passage having some numbered blanks. Probably the motorist saw the _______(i...