摘要
本文通过对Dijkstra算法、A算法和Floyd算法等最短路径算法的分析研究,选择Dijkstra算法作为物流配送路线规划的核心算法;并且针对原始Dijkstra算法的不足,分别对原始Dijkstra算法的数据存储方式、执行效率和数据结构提出了优化的方法。
In this paper the Dijkstra algorithm is selected as the key algorithm of logistics and the transit route plan after research of Dijkstra algorithm, A＊ algorithm and Floyd algorithm, as for the deficiency of Dijkstra algorithm, this paper also gives modified methods for Dijkstra algorithm in packing of data manner, execution efficiency and data structure separately.
出处
《农业网络信息》
2007年第5期60-62,共3页
Agriculture Network Information
