Search With Open and Closed List
You start BFS at node A in a graph. The neighbors of A are B and C. Which node will BFS visit first?
During BFS, a node D is discovered via two paths: A→B→D and A→C→D. Which path does BFS record?
If BFS is applied to a graph with cycles, how does the algorithm avoid infinite loops?
BFS is applied to find the shortest path from node S to node G in an unweighted graph. What property ensures the path is shortest?
In BFS, what happens when a goal node is discovered in the open list?