| 关于最短路径算法 |
| |
| 引用本文： | 肖金声. 关于最短路径算法[J]. 中山大学学报(自然科学版), 1987, 0(3) |
| |
| 作者姓名： | 肖金声 |
| |
| 作者单位： | 中山大学计算中心 |
| |
| 摘 要： | 本文先为两个经典的最短路径算法补充具体路径的保留办法。然后,提供一个便于实现的求有向图两点间所有路径的算法.
|
| 关 键 词： | 有向图 最短路径 算法 |
The Algorithms about Shortest Paths |
| |
| Xiao Jinsheng. The Algorithms about Shortest Paths[J]. Acta Scientiarum Naturalium Universitatis Sunyatseni, 1987, 0(3) |
| |
| Authors: | Xiao Jinsheng |
| |
| Affiliation: | Xiao Jinsheng |
| |
| Abstract: | This paper supplemented the measures that keep particular path for two classical algorithms for shortest paths. Then, it provided an algorithm to seek all paths between two vertexes. This algorithm is convenient for implementation. |
| |
| Keywords: | directed grath shortest path algorithm |
| 本文献已被 CNKI 等数据库收录！ |
