Shortest Path Analysis Based on Dijkstra’s Algorithm in Myanmar Road Network

Yi Yi Win, Hnin Su Hlaing, Tin Tin Thein


The shortest path problem based on the data structure has become one of the hot research topics in graph theory. In modern life, everyone needs to reach their destinations in time. Distance calculator helps the system to find the distance between cities and calculate by traffic in both mile and time. The aim of this study is to provide finding the shortest path for bus routing based on Dijkstra’s algorithm (DA). As the basic theory of solving this problem, DA has been widely used in engineering calculations.  DA is used to find the shortest path from one node to another node in a graph. DA is also known as a single source shortest path algorithm. This system acquired data from the geographic information system (GIS) of Cities in Myanmar.

Full Text:


Copyright (c) 2019 Edupedia Publications Pvt Ltd

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.


All published Articles are Open Access at 

Paper submission: