| 基于交通网络最短路径搜索的改进算法 |
| |
| 引用本文： | 刘韵,何建农.基于交通网络最短路径搜索的改进算法[J].计算机工程与应用,2007,43(14):220-222. |
| |
| 作者姓名： | 刘韵 何建农 |
| |
| 作者单位： | 福州大学数学与计算机科学学院 |
| |
| 摘 要： | 对全源最短路径搜索算法进行了深入的研究分析，并结合国内城市道路交通的实际情况，提出了基于边序列最短路径搜索算法的一种改进算法——EBSP*算法。该算法在平均时间复杂度上比传统的Floyd最短路径搜索算法有较大的提高。
|
| 关 键 词： | 最短路径 Floyd EBSP EBSP* |
| 文章编号： | 1002-8331（2007）14-0220-03 |
| 收稿时间： | 2006-6-6 |
| 修稿时间： | 2006-10 |
Improved algorithm about searching for the shortest path over the traffic network |
| |
| LIU Yun,HE Jian-nong.Improved algorithm about searching for the shortest path over the traffic network[J].Computer Engineering and Applications,2007,43(14):220-222. |
| |
| Authors: | LIU Yun HE Jian-nong |
| |
| Affiliation: | College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350002,China |
| |
| Abstract: | In this paper a new algorithm about searching for the shortest path in a weight graph is introduced.Taking the traffic network into consideration,the algorithm is based on the edges searching.This algorithm is better than the Floyd algorithm in average time complexity. |
| |
| Keywords: | the shortest path Floyd EBSP EBSP |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
