A Fast Algorithm for Finding the Shortest Path Between Arbitrary Two Points in a Traffic Road Net

There have been many algorithms for finding the shortest path between arbitrary two points in a traffic road net. Among these the Dijkstra's algorithm is one of the most effective algorithms, its time complexity is O( n 2 ). The algorithm presented in this paper is different from Dijkstra's. Its main idea is that we select edges and build a binary tree according to the direction of a straight line segment from the start point to the finish point, and adopt an effective method to reduce the size of the binary tree and shorten the length of the path, then calculate the approximate shortest path and its length in terms of the labels of the binary tree's nodes. Repeatedly implementing this algorithm a constant times can obtain the shortest path and the length.