| 赋权图上最短路径的一种简便算法 |
| |
| 引用本文： | 吴鹏.赋权图上最短路径的一种简便算法[J].贵州师范大学学报(自然科学版),2012,30(5):69-72,102. |
| |
| 作者姓名： | 吴鹏 |
| |
| 作者单位： | 四川建筑职业技术学院计算机工程系,四川德阳,618000 |
| |
| 摘 要： | 在不考虑负回路的前提下,给出了在含有负权的赋权图上求任意两点间最短路径的一种简便算法,此算法既适用于有向图又适用于无向图,并且可据此算法找到最短路径。
|
| 关 键 词： | 赋权图 最短路径 矩阵-递推法 作差-筛选法 |
A simple solution to the shortest path problem of weighted graph |
| |
| WU Peng.A simple solution to the shortest path problem of weighted graph[J].Journal of Guizhou Normal University(Natural Sciences),2012,30(5):69-72,102. |
| |
| Authors: | WU Peng |
| |
| Institution: | WU Peng(Department of Computer Engineering,Sichuan College of Architectural Technology,Deyang,Sichuan 618000,China) |
| |
| Abstract: | Without the negative circle,the next article put forwards a simple algorithm to the shortest path problem of weighted graph between any two points.This algorithm applies to both the digraph and applied to undirected graphs,and we can find the shortest path through this algorithm. |
| |
| Keywords: | weighted graph the shortest path matrix-recursive algorithm making difference-filtering algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
