Skip to content

The purpose of this project is to implement Breadth-First Search for pathfinding on a square grid. The starting and ending points are fixed, and users can draw obstacles as yellow blocks. The program includes options to start BFS, go back to the previous move, and reset the grid.

Notifications You must be signed in to change notification settings

medha-kul/BFS-finder

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Implementing Breadth-First Search for Pathfinding on Square. The starting point(Pink) and ending point are fixed. The first square of the large square is initial point and last square on the bottom right is the ending point(Magenta).

You can draw blocks between(Yellow), however you like, and choose from the menubar, you can choose to start the BFS(Breadth First Search), go back on the previous move, and reset the whole thing.

Type make run to execute the file.

About

The purpose of this project is to implement Breadth-First Search for pathfinding on a square grid. The starting and ending points are fixed, and users can draw obstacles as yellow blocks. The program includes options to start BFS, go back to the previous move, and reset the grid.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published