| 邻接矩阵求带权图中最短通路 |
| |
| 引用本文： | 黄师化.邻接矩阵求带权图中最短通路[J].安庆师范学院学报(自然科学版),2013(4):26-28,44. |
| |
| 作者姓名： | 黄师化 |
| |
| 作者单位： | 安庆师范学院 计算机与信息学院,安徽 安庆,246133 |
| |
| 摘 要： | 通过对带权邻接矩阵定义一种运算，计算n阶简单带权图中任意两点之间步长为1，2，…，n -1的最短通路长度，逐步比较，确定通路所过各边权值之和最小的即最短路径。在计算的过程中用矩阵记下最短路径所经过的所有结点，最后验证了其在无向和有向简单带权图中的有效性。
|
| 关 键 词： | 带权邻接矩阵 带权图 最短通路 矩阵算法 |
Adjacency Matrix Algorithm for the Shortest Path in the Weighted Graph |
| |
| HUANG Shi-hua.Adjacency Matrix Algorithm for the Shortest Path in the Weighted Graph[J].Journal of Anqing Teachers College(Natural Science Edition),2013(4):26-28,44. |
| |
| Authors: | HUANG Shi-hua |
| |
| Institution: | HUANG Shi-hua ( School of Computer and Information, Anqing Teachers College, Anqing, Anhui 246133, China ) |
| |
| Abstract: | A kind of calculation is defined based on weighted adjacency matrix which can get the length of the shortest path between any two points in step 1, 2,..., n-1 in n_points simple weighted graph.By comparison gradually, the shortest path is determined in which the sum of weights of the edges is minimum .And in the process of calculation the matrix can be used to take note of all nodes in the shortest path .Finally the effectiveness of the algorithm is verified by programming in the undirected and the directed weighted simple graph. |
| |
| Keywords: | weighted adjacency matrix weighted graph the shortest path matrix algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
