An novel shortest path algorithm based on spatial relations

Wei Jinzhan, He Yanmei,Zhu Zhaomin,Zhu Liucun

Proceedings of the 2020 4th International Conference on Electronic Information Technology and Computer Engineering（2020）

引用 1|浏览1

暂无评分

摘要

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.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要