摘要
本文提出一个求解最短路问题的计算机算法,可称之为相关边法.它是在利用dijkstra算法的基础上,提出网络最大相关边数的概念,通过构造网络的相关矩阵和判断矩阵,从而计算网络任意两点间的最短距离.用此法求解大网络时,数据输入简单方便,能大大节省计算机内存和提高运行速度,为微计算机解决大网络问题提供了切实可行的算法.
In this paper, a computer algorithm (named the correlation edge algorithm) of finding the shortest path is presented. By using the Dijkstra algorithm, and introducing the concept of the largest correlation dege of a network, the shortest distance between any two points of the network can be calculated through constructing a correlation matrix and a judgement matrix. With this algorithm to solve a large network, the data input work is simple and convenient. Thus, the algorithm, which requires less computer storage space and possesses mor rapid operation speed, can be provided with a practical tool for microcomputer to solve a large network.
出处
《系统工程》
CSCD
1989年第5期46-51,共6页
Systems Engineering
