Data-Structures
October 6, 2023Web-Technologies
October 6, 2023Graphs
|
Question 2
|
Let 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 ν 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
|
Question 2 Explanation:
In DFS after visiting u, there is no child node then back tracking is happen and then visit the node v. There is no need of (u,v) be an edge.
Correct Answer: C
Question 2 Explanation:
In DFS after visiting u, there is no child node then back tracking is happen and then visit the node v. There is no need of (u,v) be an edge.
Subscribe
Login
0 Comments