- Download the file "aspf.py" from this repository
- Extract the file
- Open the files with in your favourite code editor (VS-code, Atom, Spyder or Pycharm (don't use jupyter notebook. This is not suitable for this purpose))
- Run the file
- On the grids, select a starting point (in orange) and an end-point (in skyblue/turquiose)
- Draw any pattern of obstacles (but be sure to leave spaces open for the algorithm to reach from start to end. Don't block path)
- Press spacebar to start the plotting
- When the plotting is finished, a purple line will be generated from the end point set by user, to the starting point, denoting the shortest path
- To escape the screen, or stop the process in between, just click on the red "X" button on the top right corner of the window.
-
Notifications
You must be signed in to change notification settings - Fork 0
MainakRepositor/Efficient-PathFinder
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published