Q6
Which traversal algorithm would you use to find the shortest path in an unweighted graph?
A.
Depth-First Search (DFS)
B.
Dijkstra's Algorithm
C.
Breadth-First Search (BFS)
AnswerD.
Floyd-Warshall Algorithm
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board