This is a project for the Datastructures and Algorithms project course in the University of Helsinki.
The goal is to compare two shortest path algorithms, Fringe search and Dijkstra. The original plan was to compare IDA* and Dijkstra but I changed it because IDA* was not working well for the massive graph from OpenStreetMap that I'm using in this project.
The backend is done with python and for the API I used is pythons FastAPI. The frontend is done with React.js and for the map I used React-leaflet. The map data is downloaded with pythons OSMNX library which can download data from OpenStreetMap. This app uses the map data (a graph) of Helsinki.
I deployed the app to fly.io, but it used too much memory for the free tier. I also though about using render but it needs more memory than it's free tier allows also. :( Thankfully the app is easy to use locally too! You can find out how to use the app in the user guide.