## Uninformed Search Strategies: Breadth-First Search

Uninformed Search Strategies 1. Breadth-First Search To understand this Breadth- First Search lets take a graph with nodes A, B, C, D, E,F and G . here I expand the shallowest unexpanded node. Here the fringe you see is the FIFO(First In First Out) queue .i.e., New successors go atRead More →