An novel shortest path algorithm based on spatial relations

In this paper, a new shortest path search algorithm is proposed based on the spatial relationship of path and it's adjoining blocks. Parallel computation is used to expedite path searching. It can achieve higher efficiency of finding the shortest path, with time complexity of O(n) in case of node number much less than edge number.