摘要
介绍了用迪杰斯特拉算法解数学建模中常遇到的“最短路”问题的一般步骤,通过框图描述了这一解题方法是如何在计算机上实现的。并给出了说明及实例。
With Dijkstra algorithm, the problem of 'the shortest distance'frequently appears in mathematics model establishment.The generalprocedures of how this happens are given in this paper. Also, how the algorithm is successfully operated in computer isdescribed via the architrave. And given ,illustrations as well as instances.
出处
《台州学院学报》
2002年第3期10-11,14,共3页
Journal of Taizhou University
关键词
迪杰斯特拉算法
'最短路'问题
矩阵
Dijkstra algorithm
the problem of 'the shortest distance'
matrix
