| 浅析航线选择中的改进最短路径算法 |
| |
| 引用本文： | 郁振伟,叶清.浅析航线选择中的改进最短路径算法[J].船海工程,2007,36(6):86-88. |
| |
| 作者姓名： | 郁振伟 叶清 |
| |
| 作者单位： | 海军潜艇学院,山东,青岛,266071 |
| |
| 摘 要： | 利用改进的最短路径算法对船舶最佳航线最短路径作出定量描述,阐述Dijkstra算法和改进算法,并通过船舶最佳航线选择示例说明算法的应用,比较表明,改进算法在搜索效率上优于Dijkstra算法。
|
| 关 键 词： | Dijkstra算法 改进算法 最佳航线 最短路径 |
| 文章编号： | 1671-7953（2007）06-0086-03 |
| 收稿时间： | 2007-07-25 |
| 修稿时间： | 2007-09-24 |
Cause analysis of improvedalgorithm of shortcut onselecting the favorite line |
| |
| Authors: | YU Zhenwei YE Qing |
| |
| Abstract: | In This paper the problem is dealt quantitatively by using the improved shortcut algorithm.The Dijkstra algorithm and improved algorithm are described in detail.The application of the improved algorithm is also illustrated with an example of selecting Optimum route..By Comparing Dijkstra algorithm with the improved algorithm,it is found that the latter is better than the former in searching efficiency. |
| |
| Keywords: | dijkstralgorithm improved algorithm optimum route shortcut |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
