Vidyalelo
Data Structure · Q36

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 36

Q36

What does the term "back edge" refer to in DFS?

A.
An edge that causes a cycle in the graph.
B.
An edge that connects two nodes in the same level.
C.
An edge that connects a node to its ancestor in the DFS tree.
Answer
D.
An edge that connects a node to a descendant in the DFS tree.

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board