Dijkstra矩阵算法  

Dijkstra's Matrix Algorithm

作　　者：代西武[1] 

机构地区：[1]北京建筑工程学院基础科学部,北京100044

出　　处：《北京建筑工程学院学报》2007年第2期65-67,71,共4页Journal of Beijing Institute of Civil Engineering and Architecture

摘　　要：介绍了Dijkstra算法,对Dijkstra算法进行改进,提出了计算加权图中任意两点之间最短距离的算法——Dijkstra矩阵算法,给出了Dijkstra矩阵算法在Matlab语言中的实现,对一个具体例子,应用Dijkstra矩阵算法进行了验算.In this paper, the Dijkstra＇s algorithm is introduced. By improving Dijkstra＇ s algorithm, the Dijkstra＇ s matrix algorithm, which is to calculate the shortest distance between two arbitrary vertexes in a weighted graph is proposed. The MATLAB source code of Dijkstra＇ s matrix algorithm is supplied, and an example is calculated.

关 键 词：DIJKSTRA算法 最短路问题 最短距离 矩阵 MATLAB语言 

分 类 号：O151.21[理学—数学]