| 无环网络中的最短路径问题研究 |
| |
| 引用本文： | 徐翠霞.无环网络中的最短路径问题研究[J].科技广场,2007(3):73-75. |
| |
| 作者姓名： | 徐翠霞 |
| |
| 作者单位： | 潍坊学院计算机与通信工程学院,潍坊,261061 |
| |
| 摘 要： | 针对无环网络的特点,以拓扑排序为基础,本文提出了解决无环网络最短路径问题的简单算法。通过理论分析表明,拓扑排序策略对于最短路径问题的研究,较传统的方法运算简单、求解直观,因此,该方法无论用于教学还是解决实际问题,都有较大的实用价值。
|
| 关 键 词： | 无环网络 最短路径 拓扑排序 边松弛 路径松弛 |
| 文章编号： | 1671-4792-（2007）1-0040-03 |
the Simple Algorithm of Finding Shortest Path in Acyclic Network |
| |
| Xu Cuixia.the Simple Algorithm of Finding Shortest Path in Acyclic Network[J].Science Mosaic,2007(3):73-75. |
| |
| Authors: | Xu Cuixia |
| |
| Abstract: | Based on the characteristics of acyclic network, the paper proposed an algorithm to solve the shortest path problems in the acyclic network using topological sorting. By theoretical analysis, the result shows that compared with traditional method, the proposed method has an excellent efficiency and low computational complexity and simple result representation. It is worthy not only at teaching but also at practice. |
| |
| Keywords: | Acyclic Network Shortest Path Topological Sort Edge Relaxation Path Relaxation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
