Shortest-Path Finding System using Dijkstra’s Algorithm

Traveling is the part of every person’s day-to-day life. Dijkstra’s algorithm can be used to find the shortest route between one city and all other cities. This paper proposes, when the user gives any road map as input, stores in database. If the user wants to search the shortest path of any two cities in given road map, the system calculates the shortest path using Dijkstra’s algorithm. This shortest path display the total distances of the path passed of over all cities. This system can find shortest path of the world over, if the relation of the cities and distances between them is given by user. Therefore, it is widely used for various maps. As a result, using of shortest path finding system, it can save the time and cost. Unfamiliar public user with a region can be supported beneficially due to the above strength of this system. This system is useful in terms of computation when applied to the route finding task. The implementation of the shortest path finding system is used as undirected graph. This paper investigates the above algorithm and implements this algorithm by using Java Programming Language and MYSQL Database