关键词: K条最短路径, 智能搜索, Dijkstra算法, 公交查询

Abstract: Spatial data structure of the implementation for the city public transportation query system was proposed. Based on Dijkstra's shortest path algorithm, an intelligent algorithm for state space searching for K shortest path was presented with the aid of the thoughts of state space searching and dynamic cut branch in artificial intelligence. The algorithm could show inquiry traffic route, riding scheme and so on through electronic map, and change maps of different cities. The practical tests of the system show that the query system designed in the method presented by this paper has the characteristics of high speed, multimedia display, convenient maintenance, and powerful commonality.

Key words: K shortest paths, intelligent search, Dijkstra algorithm, public transportation query