Q20
What is the primary characteristic of a graph traversal algorithm like BFS or DFS?
A.
It detects cycles in a graph.
B.
It finds the minimum spanning tree.
C.
It visits all nodes in a specific order.
AnswerD.
It calculates the shortest path.
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board