Path Finding API - Dijkstra Algorithm

This project was developed as part of our second-year computer science end-of-year project. The main focus was to create a Python API capable of determining the optimal path from a starting city to a destination city using the Dijkstra algorithm. The API also provides visualizations of the graph before and after the path finding process, helping users better understand the path and the graph structure.

It is important to note that this API represents only one part of a larger project, which also includes a web application for clients and a desktop application for administration purposes. The API serves as the backend engine for computing optimal trajectories and generating visual outputs.

The API was built using Python, leveraging NetworkX for graph management, Matplotlib for graph visualization, and Flask for building the web API.