Research on the Shortest Path for Crossing Desert Based on Floyd Algorithm

The shortest path problem is a hot topic in graph theory and network. It is applied in practical engineering. Floyd algorithm is an efficient algorithm for computing the shortest path between any two points in the network, and it is widely used. Taking an interesting desert crossing game as an actual case, this paper studies the shortest path problem of crossing the map from all conditions known and some conditions known respectively, constructs a strategy model combined with Floyd algorithm to solve the problem, and finally gives the best crossing route strategy. The analysis results show that the shortest path strategy model based on Floyd algorithm solves the problem well. It shows that the algorithm is effective and shortest path algorithm.