Skip to content

A* pathfinding algorithm, which finds the shortest path between two points that the user picks.

Notifications You must be signed in to change notification settings

emirmatik/a-pathfinding-algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 
 
 

Repository files navigation

A* Pathfinding Algorithm w/ custom walls and start-end points

Use npm install to install dependencies first
Use npm start to run the app in the development mode

🧮 Select Start and End point coordinates as you wish
✍ Add custom walls with using left click of your mouse
⚪ You can delete walls with right click as well
🎯 Algorithm will find the shortest way between start and end points !

Notes:

  • If you want to change the number of rows and columns, do not forget to change it in CSS(.grid container) as well.
  • If you get "Cannot read property 'split' of null" Error, refresh the page

Colors:

🟢 Spot in evaluation
🔴 Evaluated spot
🔵 The Closest Path
⚫ Wall

Sample Result:

Photo1.0

About

A* pathfinding algorithm, which finds the shortest path between two points that the user picks.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published