Vidyalelo
Data Structure · Q133

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 133

Q133

In Depth First Search, how many times a node is visited?

A.
Once
B.
Twice
C.
Equivalent to number of indegree of the node
Answer
D.
Thrice

Answer: Option C

Solution

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