Q23
What is a primary use case for Depth-First Search (DFS)?
A.
To find the minimum spanning tree.
B.
To find the shortest path in a weighted graph.
C.
To find a path between two nodes.
D.
To check the connectivity of a graph.
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board