Scribd
Upload
18 views18 pages

Breadth First Search (BFS) in Python

BFS is an algorithm for searching a maze. It starts at the start cell and explores all neighboring cells before moving to the next level of neighbors. The algorithm uses a queue to keep track of cells to visit at each level.

Uploaded by

harshitad1272
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
18 views18 pages

Breadth First Search (BFS) in Python

BFS is an algorithm for searching a maze. It starts at the start cell and explores all neighboring cells before moving to the next level of neighbors. The algorithm uses a queue to keep track of cells to visit at each level.

Uploaded by

harshitad1272
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

Breadth First Search (BFS)

Maze World
Goal Cell

Start Cell
Pseudocode
https://www.youtube.com/watch?v=D14YK-
0MtcQ

You might also like