Skip to content

Kevinliaoo/Path_finding

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Path finding visualizer

This program is a path finding algoriths visualizer that can run both A* and Dijkstra algorithm.
img

Instalations

Use the package manager pip to install dependencies.

python -m venv venv 
venv\Scripts\activate.bat
pip install -r requirements.txt

Running

python path.py

Instructions

  • Left click: Place startpoint, endpoint and obstacles

  • Right click: Remove blocks

  • Keyboard a: Run A* algorithm

  • Keyboard d: Run Dijkstra algorithm

  • keyboard r: Resets the program, once algorithm finished running

  • keyboard c: Cleans the grid to run an algorithm again, once previous algorithm finished runnig

  • keyboard p: Randomly generates a map (with 500 obstacles points)

Dijkstra algorithm




A* algorithm



What I learned by doing this project:

  • Understanding different types of path finding algorithms

  • Using pygame to create a GUI

Author

Kevin Liao - @kevinliaoo

About

Path finding algoriths

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages