Open Jonas-Petersen opened 2 years ago
Implemented a graph search as an A* search in the graph_search.py
file.
After searching a shortest path from node A to node B this path gets stored in a dictionary, so that if a path for the same combination is searched again, it is already available.
For the A* search we used the python-astar library: https://github.com/jrialland/python-astar
User story
Acceptance criteria
Definition of done (DoD)
DoD general criteria