摘要
在九十年代公认的求最短路径的最好的算法是由E.W.Dijkstra于1959年提出的标号算法,此算法可以很好地解决求最短路径问题,但是该算法采用手工求解,计算量大且很繁琐.本文在此算法的基础上采用矩阵运算的方法,从而实现了完全应用程序求解,在很大程度上解决了上述问题所遇到的难点,使求最短路径和最短距离这两个较复杂的问题变得非常容易求解.
In the 1990s, the best algorithm for the shortest path problem is the labeling algorithm proposed by E.W.Dijkstra in 1959, which can solve the shortest path problem efficiently. But the realization of the algorithm is manual, and require a large quantity of calculation, which is very complex. In this paper, the algorithm based on the matrix and is realized by program completely. This solved the difficulties above greatly and made two more complicated problems： the shortest path problem and the shortest distance problem very easy.
出处
《甘肃高师学报》
2008年第2期28-30,共3页
Journal of Gansu Normal Colleges
关键词
最短路径
最短距离
算法矩阵
the shortest path
the shortest distance
the algorithm matrix
