- the weight of the edges correspond to the duration of passing the edge
- the start point, which is passed on the algorithm is matched to a segment on the map
- AStar algorithm is applied to resulting graph by using AStarShortestPath by JGraphT
- algorithm is adapted to our requirements by checking for turn restrictions and forbidden weather conditions for the edges of the path and by searching in a given period of time
- heuristic: haversine distance between current and target node
Further details of the project can be found in our [organisational page](https://git.imp.fu-berlin.de/swp-datenverwaltung-navigation-2023/organisational), where our project report can be downloaded.
## Start the application in Docker
To start the appliaction in Docker, you have to clone the repositories of [map-data-parser](https://git.imp.fu-berlin.de/swp-datenverwaltung-navigation-2023/map-data-parser), [metric-builder](https://git.imp.fu-berlin.de/swp-datenverwaltung-navigation-2023/metric-builder) and routing-service (the one you are on right now) into your local system. Inside the headfolders of these repositories, there are Docker Image files named <servicename>.tar. You have to load these images into your local Docker enviroment. This can be easily done by pasting
