Solving the Shortest Path in Parallel of City Road Network

With the current scale of urban expansion and transport network more complex,the computation of the shortest path problem will consume more time and spatial resources.In order to have a more efficient real-time,simplify the complex network based on the city community.To maintain the original characteristics of network,in every district to find the representative node,and other nodes as transparent has nothing to do.Then do wayfinding used layered calculation of thought and parallel search algorithms.The experimentation has been implemented in parallel PC environment.The experimental results show that the running time and memory space allocation have a obvious advantage,and have good practicability.