Pathfinder Explanation
This project is a visual way of understanding how the pathfinding algorithms A* Search and Dijkstra work. This projects walks the user through the step by step process of both algorithms.
Python
A* Search
Dijkstra's Algorithm
Tkinter
Features
- Support A* Seach and Dijkstra's Algorithm
- Programmed in Python using Tkinter as a GUI
- Allows the user to see each step of the process
- The program alows the user to clearly see:
- The direction of shortest return
- Step count
- Value of the heuristic function
- Total cost value of the given cell