breadth-first-search-algorithm

Developed a maze-solving script in Python, employing the breadth-first search (BFS) algorithm to determine the shortest path between two points within a maze. Implemented the project using the curses library for user interface and visualization.

python breadth-first-search-algorithm

Updated Jan 2, 2024
Python

Improve this page

Add a description, image, and links to the breadth-first-search-algorithm topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the breadth-first-search-algorithm topic, visit your repo's landing page and select "manage topics."

Learn more

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

breadth-first-search-algorithm

Here are 5 public repositories matching this topic...

Tynab / Animal-Chess

Tynab / Searching-Algorithms

niusha-sabahi / python-challenges-solutions

LesiaUKR / goit-algo-fp

DularaWijerathne / Path_Finder

Improve this page

Add this topic to your repo