An A* Algorithm with a New Heuristic Distance Function for the 2-Terminal Shortest Path Problem
Kazuaki Yamaguchi · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2006
The 2-terminal shortest path problem is to find a shortest path between two specified vertices in a given graph G. In this paper, we consider this problem in the following situation: G is given before the two vertices are specified so that some preprocessing is allowed to reduce the response time. We present a method for calculating lower bounds of the length of the shortest path for any pair of vertices. Experimental results show that the A* algorithm with our method performs much better than previous methods.