| 最短路径算法的比较 |
| |
| 引用本文： | 王苏男,宋伟,姜文生.最短路径算法的比较[J].系统工程与电子技术,1994(5). |
| |
| 作者姓名： | 王苏男 宋伟 姜文生 |
| |
| 作者单位： | 北方交通大学 |
| |
| 摘 要： | 本文介绍了三种最短路径算法及其算法步骤，这三种算法分别被称为Ｄｉｊｋｓｔｒａ算法、ＰＳＰ算法和ＤＢＦＳ１算法。文中对这三种算法的比较，着重阐述了作为一种在计算机上非常优越的算法ＤＢＦＳ１算法的优越性及其原因。最后，给出了ＤＢＦＳＬ１算法的流程图。
|
| 关 键 词： | 路径，算法，比较 |
Comparison of the Shortest Path Algorithms |
| |
| Wang Sunan,Song Wei,Jiang Wensheng.Comparison of the Shortest Path Algorithms[J].System Engineering and Electronics,1994(5). |
| |
| Authors: | Wang Sunan Song Wei Jiang Wensheng |
| |
| Abstract: | his paper presents three shortest path algorithms,which are quite popular at pres-ent,and their algorithmic procedure.These three algorithms are respectively called Dijkstra algorithm,PSP(partitioning shortest path)algorithm and DBFS1(Dynamic Breadth-First Search algorithm,By comparing these three algorithms,this paper puts emphasis on expounding the advan- tage of DBFS1 algorithm,the extremely superior algorithm,and the reason. Lastly,this paper pres-ents the flow diagram of DBFS1 algorithm. |
| |
| Keywords: | Shortest path algorithm Comparison |
| 本文献已被 CNKI 等数据库收录！ |
|
