Bi-directional Dijkstra Algorithm and the Acceleration of Intermediate List

This article is intended to propose a bi-directional algorithm and the acceleration of intermediate list. When identifying the shortcut between 2 designated vertexes on a map of Washington with nearly 5,000 vertexes by way of bi-directional Dijkstra algorithm and acceleration of intermediate list on a computer with a primary frequency of 633 MHz, the maximum time needed is less than 31.1 MSEL. The efficiency of bi-directional Dijkstra Algorithm is generally more than 40% higher than that of the traditional Dijkstra Algorithm. The more vertexes there are on the map, the higher the efficiency will be.