An Optimized Approach for Shortest Path Determination Based on Floyd Algorithm

The Floyd and Dijkstra shortest path algorithms are classical algorithms which have been widely used in spatial analysis and other areas.Traditional research of the shortest path algorithm focuses on the application of the algorithm and the optimization of one kind of algorithm;the combination of two kinds of optimized methods is rarely seen.This paper attempts to use the method of combining the Floyd algorithm with Dijkstra algorithm and the optimization of the code of traditional Floyd algorithm by taking the Lanzhou—Beijing railway transportation system as an example.The spatial-temporal complexities before and after the optimization of the algorithm,are compared.The experimental results show that the optimized algorithm has greatly reduced the computational count and the operational time.As a result,the algorithm efficiency is improved.