Towards shortest path computation using Dijkstra algorithm

Abstract

Shortest Path issue plays an important role in applications of road network such as handling city emergency way and guiding driver system. The concepts of network analysis with traffic issues are recognized. The condition of traffic among a city changes periodically and there are usually large amounts of requests occur, it needs to be solve quickly. By using the Dijkstra's Algorithm, the above problems can be solved through shortest paths. The shortest path and the best path is computed based on the problem of traffic condition shortest path. This plays an important role in navigation systems as it can help to make sensible decision and time saving decisions. The main purpose is to get the implementation at low cost. Thus, it brings a new framework called towards shortest path which enables drivers to quickly and effectively collect the shortest path as well as alternative path and traffic information. An impressive the result is that the driver can get their shortest path result and also gives alternative paths for the same route with the traffic count. Our experimental resultsfind that it is better invarious parameters and it gives relatively fast response time, for shortest path problem.