Breadth First Search - Part 1

The simplest version of breadth-first search. This version doesn't use a visited set but still finds the shortest path from the start state to a goal state. Part 2 will show you how to use a visited set to potentially make the search more efficient.

Видео Breadth First Search - Part 1 канала John Levine