Graph Algorithm 13

20Consider the following sequence of nodes for the undirected graph given below:

1. a b e f d g c
2. a b e f c g d
3. a d g e b c f
4. a d b c g e f
A Depth First Search (DFS) is started at node a. The nodes are listed in the order they are first visited. Which all of the above is (are) possible output(s)?

Option : D
Explanation :
a b e f d g c, a b e f c g d, a d g e b c f are possible dFs traverse of given graph.

Forgot your password?

I agree with the Terms.