Which search algorithm explores all nodes one level at a time before moving to the next level?
A
A* Search
B
Depth-First Search (DFS)
C
Breadth-First Search (BFS)
D
Greedy Search
Correct Answer: Option C — Breadth-First Search (BFS)
Explanation:
Breadth-First Search (BFS) explores a graph or tree level by level, visiting all nodes at the current depth before moving to the next level. It uses a queue (FIFO) data structure to manage nodes. BFS is particularly useful for finding the shortest path in an unweighted graph because it guarantees the minimum number of edges from the starting node to the destination.