A New Proposed Modified Shortest Path Algorithm’s Using Dijkstra’s

Roads are essential for the daily mobility of residents in various locations to work, education, and other destinations as well as for the transportation of their commodities. Roads continue to be one of the most popular modes of travel and transportation even in today's society. determining the shortest route between two places appears to be a significant issue with the road networks. To address the, a variety of applications were introduced by creating a number of shortest path algorithms. Finding the shortest route still presents a challenge. road systems. This work proposes a novel algorithm, the Modified Dijkstra's Shortest Path (MDSP) algorithm, which uses many parameters to solve the shortest path issue. To demonstrate the effectiveness of the suggested algorithm, it is compared to the current algorithm.