Skip to content

Implemented Dijkstra’s and A* Search Algorithm in Python to find the shortest route between two cells in a grid and visualized their workflow using a 2D graphics module called Pygame

Notifications You must be signed in to change notification settings

ShowmickKar/Pathfinding-Visualizer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

13 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Pathfinding-Visualizer

Implemented Dijkstra’s and A* Search Algorithm in Python to find the shortest route between two cells in a grid and visualized their workflow using a 2D graphics module called Pygame

This is a project where I kind of followed along this tutorial to understand the applications of Object-Oriented-Programming and how A* Pathfinding algorithm works. However, I added my own spin on this and implemented another algorithm(Dijkstra's) in this project. Besides, this tutorial helped me understand the inner workings of algorithm visualization. Later I applied the knowledge that I gained in another project of mine, which was a Sorting Visualizer.

About

Implemented Dijkstra’s and A* Search Algorithm in Python to find the shortest route between two cells in a grid and visualized their workflow using a 2D graphics module called Pygame

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages