Pathfinder
A pathfinder that will find and visually display the shortest path between any two given points. The user has the choice of either using A* Search or Dijkstra's Algorithm and has a variety of options available.
Python
A* Search
Dijkstra's Algorithm
Tkinter
Description
Built using Python with the Tkinter GUI library, this project allows users to experiment with common pathfinding algorithms. The project is set in a grid-tiled environment where users are able to select start/end points and draw in obstacles that the pathfinder must overcome. The pathfinding process is then animated showing visiaully each cell that is being checked by the program giving an intution for how the alorithms work.In this project I implemented two of the most common pathfinding algorithms: A* search and Dijkstra's algorithm. By toggling between the two users can clearly see the differences in the behaviour of each algorithm.
Features
- Supports A* Seach and Dijkstra's Algorithm
- Programmed in Python using Tkinter as a GUI
- Graphically shows all the cells that are checked and queued by the algorithm
- Supports several features including:
- Random max generation
- Enabling/Disabling of diagonal moves
- Variable animation speed