The shortest path algorithm based on regular hexagon grids
Xie Shun-chun · Cehui kexue · 2008
In this paper, the authors analyze the insufficiency of existed algorithms, combine the geometrical character of the regular hexagon grid with the idea of water diffusion, and propose a new shortest path algorithm based on the regular hexagon grids data.During the search process of new algorithm, the accumulation cost that account from any regular hexagon grid to starting search grid should not be modified.As a result, compared with the classic algorithm of Dijikstra, the time complexity of new algorithm is O(nn),which save the searching time significantly.