Path-Based Floyd Algorithm in Automatic Search System

摘要

The shortest path planning is a point-to-point path planning approach as a network traffic system basic function of query. From the practical point of view, Floyd algorithm is designed based on the path to automatic search system, and a description of Floyd algorithm and the shortest path algorithm is described on the city. The system can be easily graphically painted and is set to be processed on graphics, mapped quickly to any queries for the shortest distance between two locations in the city. It very intuitively can see the route on the map and effectively improve the level of public information services and accelerate the process of urban modernization.