Question: Which traversal method is typically used to find the shortest path in an unweighted graph?
Options:
Correct Answer: Breadth-First Search
Solution:
BFS is used to find the shortest path in an unweighted graph because it explores all neighbors at the present depth prior to moving on to nodes at the next depth level.