1,113 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

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