Let G be an undirected graph Consider a depth first traversal of G and let T be the resulting depth first search tree GATE CSE 2000

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Ask Questions
gate-cse-2000-->View question


Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree GATE CSE 2000

Let u be a vertex in G and let v be the first new (unvisited) vertex visited after visiting u in the traversal. Which of the following statements is always true?
A={u,v} must be an edge in G, and u is a descendant of v in T
B={u,v} must be an edge in G, and v is a descendant of u in T
C=If {u,v} is not an edge in G then u is a leaf in T
D=If {u,v} is not an edge in G then u and v must have the same parent in T


By:milan-ransingh

Taged users:


Likes:
Be first to like this question

Dislikes:
Be first to dislike this question

Talk about thisDelete|Like|Dislike|


Answers

Answer:C=If {u,v} is not an edge in G then u is a leaf in T. In DFS, after visiting a node, we first recur for all unvisited children. If there are no unvisited children (u is leaf), then control goes back to parent and parent then visits next unvisited children.
prajwalamv

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer
Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|
------------------------------------

Can you help us to add better answer here? Please see this



Not the answer you're looking for? Browse other questions from this Question paper or ask your own question.

Join eduladder!