The Design And Realization Of Optimum Path Query Component Based On STL In Public Transportation Network

The optimum path query of public transportation network is always a research hotspot in city electronic map; it also almost becomes an indispensable function of electronic map. At present, most electronic map products, however, base their optimum path query on the shortest path, undoubtedly, it is reasonable under some situations, to some extent, it also conforms with the people's demand, but it is regretting that when users use the function, such a problem often occurs, that is the shortest path usually means more transfers, which obviously goes against our accustoms, in fact, we prefer to select the scheme of fewer transfers, even if comparably it is farer than the scheme of shortest path. Therefore, how to realize the optimum path query based on fewest transfers is a very urgent problem for electronic map.This paper initially puts forward the optimum path query based on fewest transfers, and associating with traditional optimum path query based on shortest path, make the function of electronic map be more in accord with our habits using public transportation. Adopting COM component as the two main algorithm's development base, the system has very good transportability and reusability, in addition, the author filled the excellent efficiency of STL into the algorithm, which not only simplified the code, and became easy to maintain, but also improve the efficiency of the whole algorithm, finally, the author finished the call of this component in PC and network system, especially the call method in network environment, should be a very good idea to realize WebGIS.