Question: What is the primary use of Breadth-First Search (BFS) in graph traversal?
Options:
Correct Answer: Finding the shortest path in an unweighted graph
Solution:
BFS is primarily used for finding 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.