浏览全部资源
扫码关注微信
中山大学计算中心
Published:1987,
Published Online:25 May 1987,
扫 描 看 全 文
The Algorithms about Shortest Paths. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 26(3):42-47(1987)
DOI:
The Algorithms about Shortest Paths. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 26(3):42-47(1987) DOI:
本文先为两个经典的最短路径算法补充具体路径的保留办法。然后
提供一个便于实现的求有向图两点间所有路径的算法.
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.
有向图最短路径算法
0
Views
17
下载量
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution