This is a simple demo I wrote in Python to refine my understanding of the A* algorithm. I ended up implementing a min-heap and a priority queue as well. All the python files are individually runnable as examples.
GavRobbs/AStar
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|