Road Map Estimation by using the Single Source Shortest Path Algorithm (DIJKSTRA'S Algorithm)

Traffic congestion is becoming a serious problemin more and more modern cities. Encouraging moreprivate-vehicle drivers to use public transportationis one of the most effective and economical ways toreduce the ever increasing congestion problem onthe roads. To make public transport services moreattractive and competitive, providing travellers withindividual travel advice for journeys becomescrucial. However, with the massive and complexnetwork of a modern division, finding one or severalsuitable route(s) according to user preferences fromone place to another is not a simple task. This paperfocuses on the uses of the Dijkstra’s algorithm tofind the shortest path in the Sagaing Division. Theimplementation of the shortest path algorithm ispresented by the undirected graphs. This paper isable to suggest unfamiliar public users to choose aroute based on their preferences. Users can choosenot only shorter route with more frequent stationchange but also longer route with less stationchange. This system can also calculate the solutionpath from the starting station to the intendedstation. Based on the solution path, the systemsuggests the shortest distance, minimum cost andminimum time of the paths for the user’sconvenience. In order to develop a utility, this paperhas selected the Java Language