基于平面图的最短路径算法的研究

研究平面图特殊应用条件下最短路径搜索算法的时间复杂度和空间复杂度。从应用的角度，设计一种新的数据存储结构，改进最短路径搜索算法，并建立一个简捷的估价函数，使基于平面图的动态路径规划算法在时间复杂性和空间复杂性上均达到了线性，为进一步解决这一领域内的网络综合分析打下了基础。

Study on a Routing Algorithm Based on Ichnography

Deals with the computation of the shortest paths over a network of an ichnography to resolve the time complexity and space complexity problems in the shortest path searching algorithm. This algorithm is based on real network implementation. A new data structure is designed and a liner time and space expense is reached in searching for the shortest paths in a real network of ichnography. In this article, a strict demonstration is given to demonstrate the time and space expenditure.