摘要
提出了计算加权图中任意两点之间最短距离的算法——Dijkstra矩阵算法,证明了结论:当粮仓可建在村庄里或道路上时,则粮仓建在村庄里可使总运费达到最小.因此,粮仓建在道路上不能使总运费更少,不必要建在道路上.给出了最优粮仓地址的计算方法,对一个具体例子,求出了最优粮仓地址.
In this paper,the Dijkstra＇s matrix algorithm is proposed,which is to calculate the shortest distance between two arbitrary vertexes in a weighted graph.The proved conclusion： If grain store can be built in a village or on a path,the minimum transport costs will be achieved by building grain store in a village.The method for determining the best position of grain store is supplied,and an example is calculated.
出处
《北京建筑工程学院学报》
2011年第1期69-71,共3页
Journal of Beijing Institute of Civil Engineering and Architecture
关键词
粮仓选址
DIJKSTRA算法
最短路问题
grain store position
dijkstra＇s algorithm
problem of the shortest path
