Skip to content

paras-jindal/path-finding

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

path-finding

A python visualization of the A* path finding algorithm. It allows you to pick your start and end location and view the process of finding the shortest path.

Requirements

  • Python 3.x
  • TKinter
  • Pygame

About

so i made a code on the base of dijkstra algorithm which is used to find the shortest path between two nodes

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages