Analysis and Implementation of Campus Shortest Path Based on Floyd Algorithm
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.
NETL
NSTL
万方数据
维普
