| 拆边法求最短路径 |
| |
| 引用本文： | 舒兴明. 拆边法求最短路径[J]. 大学数学, 2002, 18(3): 44-47 |
| |
| 作者姓名： | 舒兴明 |
| |
| 作者单位： | 华南热带农业大学,经贸学院,海南,儋州,571737 |
| |
| 摘 要： | 本文利用局部比较法 ,在图中定义子图、无效路径、以及可去边 .利用推导的有关定理 ,拆去可去边 ,利用最短路径相同的等价性 ,达到化简图 ,从而求出最短路径
|
| 关 键 词： | 最短路径问题 无向图 子图 可去边 拆边法 |
| 文章编号： | 1007-4120(2002)03-0044-04 |
| 修稿时间： | 2001-04-04 |
Method of Removing the Side of the Graph to Solve the Shortest Path |
| |
| SHU Xingming. Method of Removing the Side of the Graph to Solve the Shortest Path[J]. College Mathematics, 2002, 18(3): 44-47 |
| |
| Authors: | SHU Xingming |
| |
| Abstract: | In this paper, we compare the partial side of a so n graph in a mother graph and remove the removable sides. Then the shortest path of a graph is easily get when the graph is get more and more simple but the sho rtest paths of the two graphs are sameness. |
| |
| Keywords: | the problem of the shortest path nodirection g raph son graph removable side the method of removing side |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
