Skip to content

A pathfinding viewer that use Dijkstra's algorithm to find the shortest path from start (blue square) to end (red square).

License

Notifications You must be signed in to change notification settings

Pur2all/Pathfinder

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Pathfinder

This is my first experiment with pygame, I made a pathfinding viewer that use Dijkstra's algorithm to find the shortest path from start (blue square) to end (red square). It is also possible to draw some walls simply dragging on grid.

How to use it:

  • To run it, after you go in the same directory of the project, write in the console: python3 Pathfinder.py
  • To make walls: drag with cursor on the grid
  • To reset the grid: press backspace
  • To execute the algorithm: press enter

How it looks:

Image of how it looks

About

A pathfinding viewer that use Dijkstra's algorithm to find the shortest path from start (blue square) to end (red square).

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages