I decided to refresh my memory on how Dijkstra and A* operate, ready for my final exam on them, I would write a Python script that runs both of them at the same time for a visual comparison.

In the Dijkstra_python.py file, the shortest path will be found in the following diagram. This funtion will take three inputs (input diagram, starting point, end ...