There is too much iteration when using the traditional Floyd algorithm to calculate the shortest path, that is to say, the computation of traditional Floyd algorithm is too large for an urban road network with a large number of nodes. As for this disadvantage, the Floyd algorithm was improved and optimized further in this study; moreover, the improved Floyd algorithm was used to solve the shortest path problem in car navigation system, and it achieved good results. Two improvements were done: firstly, construct an iterative matrix for solving the shortest path...