info@avatto.com
+91-9920808017
0. Lt G be an undirected graph. Consider a depth first traversal of G, and let T be the resulting depth-first search tree. 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?
{u,v} must be an edge in G, and u is a descendant of v in T
{u,v} must be an edge in G, and v is a descendant of u in T
If {u,v} is not an edge in G then u is a leaf in T
If {u,v} is not an edge in G then u and v must have the same parent in T
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
(ii) if ‘u’ is x leaf node
(ii) if ‘u’ is x leaf node
