利用公 交线路路 口作 为顶 点，简化 了传统算 法对复 杂 网络拓扑 图的计 算；同时，利 用乘客 出行

偏好 ．引入 线 网密度来评 价乘客的 出行 方便程度 ，并提 出了一种最短路 径快速搜 索算法．实验证明 ，与传

统算法相比 ，该算法明显提 高了路径搜 索效率． -Intersection as the peak use of bus lines, simplified the traditional algorithm is the calculation of complex network topology　same time, the use of passenger travel preferences. The introduction of line density to evaluate the convenience of passengers, travel, and proposed a shortest path fast search algorithm. Experimental results show that compared with traditional algorithm, the algorithm is efficient for path search efficiency.