期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2014
卷号：2
期号：11
出版社：S&S Publications
摘要：Roads play a vital role to the people live in different places and, from day to day, they travel toschools, to work, to shops, and to transport their goods. Even in this modern world, roads remain one of the mediumsused most frequently for travel and transportation. The computation of a shortest path between different locationsappears to be a key problem in the road networks. The wide range of applications was introduced to overcome theproblem by developing various shortest path algorithms. Even now the problem still persists to find the shortest path onroad networks. To overcome the shortest path problem a new algorithm namely, Modified Dijkstra’s Shortest Path(MDSP) algorithm using multiple parameters is proposed in this paper. The proposed algorithm is compared with theexisting algorithm to prove its efficiency.
关键词：Dijkstra’s algorithm; Time Complexity; Road Network
