Best first search is a general heuristic search algorithm for shortest path problem. Its applicability is limited by its exponential memory requirement. In this paper

a new data structure for storing traffic network is presented. The search procedure is improved on the advantage of this data structure. On the other hand

a new heuristic estimate function based on the characteristic of GIS is discussed in this paper. The improved algorithm is used in a traffic analysis system.