Q15
In which case is the BFS traversal algorithm particularly useful?
A.
Finding the maximum flow in a network.
B.
Checking if a graph is connected.
C.
Finding the shortest path in a weighted graph.
D.
Finding the shortest path in an unweighted graph.
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board