A developed Dijkstra algorithm and simulation of urban path search

摘要

A developed Dijkstra shortest path search algorithm is proposed through improving data structure, preprocessing to remove redundant vertices and setting the search region sequence. The average running time before and after improvement is compared and analyzed through the simulation tests. The results show that the developed Dijkstra shortest path search algorithm can improve storage efficiency and reduce meaningless operation, shorten the operation time and increase search space and time complexity.