An Effective Method of Shortest-path Search in Complicated Road Network
She Dun · 2012
With introduction in details of Dijkstra and A* algorithm,this article analyzes the bottlenecks of these two algorithms when applied in huge and complicated road network,finally,an effective method based on network block is proposed.By sub-block processing on complicated road network,we can get parts of the blocks that content the shortest path as much as possible,as the search area is narrowed,the time taken in calculating the path is sure to be reduced.