Shortest Route planning Algorithm within Dynamic Restricted Searching Area
一种动态限制搜索区域的最短路径规划算法*

A shortest route-planning algorithm within a dynamic restricted searching area was proposed.This algorithm restric-ted the searching area according to the spatial distribution feature of the real road network dynamically,in order to reduce the searching size,reduce the time complexity and spatial complexity,enhance the efficiency.The experiment indicates the algorithm can enhance the efficiency of the shortest route-planning in the city which has a relatively regular real road network greatly.