An Improved Dijkstra Shortest Path Algorithm
نویسندگان
چکیده
An improved Dijkstra shortest path algorithm is presented in this paper. The improved algorithm introduces a constraint function with weighted value to solve the defects of the data structure storage, such as lots of redundancy of space and time. The number of search nodes is reduced by ignoring reversed nodes and the weighted value is flexibly changed to adapt to different network complexity. The simulation experiment results show that the number of nodes on search shortest path and computation time is significantly reduced. Thus, improved algorithm can be faster to search out the target nodes. Keywords-Dijkstra algorithm; Shortest path; Constraint function
منابع مشابه
Research on the Optimization and Simulation of the Shortest Path Based on Algorithm of Dijkstra
Dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional Dijkstra algorithm, on account of the insufficiency of this algorithm in path optimization, this paper uses adjacency list and circular linked list with combination to store date, and through the improv...
متن کاملTraffic Network Optimal Scheduling Paths Based on Time Intervals Division
In order to make the network model was more fitting the actual condition of city traffic, this paper presents a dynamic transportation network model based on the traffic time division, and designs improved Dijkstra algorithm to solve the city traffic paths planning problem. Dijkstra algorithm is a typical singlesource shortest path algorithm is used to calculate a node to all other nodes in the...
متن کاملApplication of Shortest Path Search Algorithm in Disaster Decision Support System
Core setting region could facilitate disaster relief and strength communication among setting regions when emergent disaster happens. Shortest path search algorithms could be applied. Dijkstra algorithm is discussed and is improved to solve the confirmation of core setting region. It ensures that the core setting region is the nearest to the farthest region. The improved algorithm turns out to ...
متن کاملLow-Stretch Spanning Tree on Benchmark Circuits
We show the testing results of Kruskal, Prim-Dijkstra for finding a low-stretch spanning tree for both unweighted graphs and weighted graphs transformed from benchmark circuits [1]. On unweighted graph, our implementation can get an average stretch of about 7 for all benchmark circuits. Kruskal’s algorithm gives good edge selection for finding short stretch edges, but does not work well for oth...
متن کاملA Hybrid Routing Algorithm for an Efficient Shortest Path Decision in Network Routing
Recently, shortest path tree construction is essential in network routing. Dijkstra algorithm, one of the static routing algorithms, is widely used. When some links develop new weights, dynamic routing algorithms become more efficient than static routing algorithms. This is because dynamic routing algorithms reduce the redundancy caused by re-computing the affected part of the network in regard...
متن کامل