Route finder is a very simple small scale project. The user can enter a source and a destination and the system will find out the best route for them according to their priority - time, fare or distance. The data is made up. The main focus was to implement Dijkstra's shortest path algorithm in a project.

Screenshots

Home page Best route

Implementation

We build a graph from the database of edges. Then we run Dijkstra's shortest path algorithm for weighted graph. Thus we find the shortest path based on the priority set by the user. We simply build the path and show it to the user.