期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2014
卷号：2
期号：10
出版社：S&S Publications
摘要：Shortest Path problems are inevitable in road network applications such as city emergency handling anddrive guiding system. Basic concepts of network analysis in connection with traffic issues are explored. The trafficcondition among a city changes from time to time and there are usually huge amounts of requests occur, it needs to findthe solution quickly. The above problems can be rectified through shortest paths by using the Dijkstra’s Algorithm. Themain objective is the low cost of the implementation. The shortest path problem is to find a path between two vertices(nodes) on a given graph, such that the sum of the weights on its constituent edges is minimized. This problem has beenintensively investigated over years, due to its extensive applications in graph theory, artificial intelligence, computernetwork and the design of transportation systems. The classic Dijkstra’s algorithm was designed to solve the singlesourceshortest path problem for a static graph. It works starting from the source node and calculating the shortest pathon the whole network. Noting that an upper bound of the distance between two nodes can be evaluated in advance onthe given transportation network. In order to solve the problem, we have been implemented shortest path for roadnetwork by using Applets in a programing language java. Software required for this application is jdk1.7.0_01.
关键词：shortest path; Dijkstra’s Algorithm; Breadth First Search; maximum number of nodes
