Which sequences of paths are explored by BFS and DFS in this problem?
- DFS explores a --> b --> d --> b --> d and keeps oscillating between the two nodes b and d. BFS first adds a --> b and a --> e to the frontier. It expands ab and adds abd and abc to the frontier. Path ae is then expanded, adding aef to the frontier. Path abd is selected and removed from the frontier, and expanded so that abdb and abdc are added to the frontier. Path abc is selected and expanded, adding abcb and abcd to the frontier. Finally, aef is selected and the goal node is reached.