1,054 views
0 votes
0 votes

Consider the following graph G.

Modified DFS on G applied as follows:
• Starting vertex is ‘p’.
• Vertex is visited based on alphabetic order.
• Vertices are visited in order p, q, r, s, t, v.
• It works same as DFS except the visiting order restriction

What is the number of back edges during the above DFS traversal on G?

a. 2

b. 3

c. 4

d. 5

Explain...how??

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
Na462 asked Nov 7, 2018
946 views
1 votes
1 votes
0 answers
2
Aditya Bahuguna asked Jan 3, 2018
293 views
0 votes
0 votes
1 answer
3
Shivi rao asked Oct 31, 2017
575 views
Please someone explain ....A directed graph G is acyclic iff depth first search of G yields no back edges
1 votes
1 votes
2 answers
4
atul_21 asked Sep 29, 2017
1,384 views
What should be the answer?? Key is given as opttion B. . !! I was getting D) None