摘要
利用ArcGIS软件创建校园矢量图,并结合Floyd算法,解决校园中各地点间的最短路径问题。对Floyd算法从两个方面简化:对于插入的节点,先对其路径长度进行比较,若其到所求节点路径比所求节点对间路径长,则不需参与计算;引入序号矩阵记录使两顶点间的路径长度变短的中间节点序号。最后,在Matlab软件中编程实现,得出校园各地点间的最短路径,结果表明,该方法具有可行性。
The vector map of campus was created by ArcGIS software.The problem of the shortest paths of every two places in the campus was resolved while combining the Floyd algorithm.The Floyd algorithm was simplified on two aspects：for the inserting node,firstly compare its path to find if it has longer distance from the fixed node than that between the pair of fixed nodes,then there is no need to calculate;introducing serial numbers matrix to record those serial numbers of middle nodes which can shorten paths.In the end,programming realization has been made in Matlab software to get shortest paths between every two places in campus,which shows the feasibility of this method.
出处
《武汉理工大学学报（信息与管理工程版）》
CAS
2012年第6期695-698,703,共5页
Journal of Wuhan University of Technology：Information & Management Engineering
基金
国防科技基金资助项目(201103HX01)
作者简介
作者简介：严晓凤（1987-），女，湖北鄂州人，武汉理工大学理学院硕士研究生．
