Abstract: Most of the developed algorithms are based on the improvement to the shortest path finding algorithm，however，the algorithm is essentially unsuitable for querying transit network.A new arrival matrix is defined and two matrix computation are originally proposed in this work.Then an efficient algorithm based on matrix computation for querying transit network is developed.Having analyzed it in detail，some important improvements are impacted to the new algorithm.Finally，the algorithm is applied to the practical data by programming，and a good result has been obtained.

Key words: transit network, matrix computation, shortest path finding algorithm

摘要： 目前绝大多数公交查询算法是基于最短路径查找算法的改进，但最短路径算法本质上不适合公交线路的查询。定义一种新型的直达矩阵，并提出两种新的矩阵运算。在此基础上，建立起了一种基于矩阵运算的高效公交查询算法。对算法进行分析后，引入了一些重要的改进。最后在计算机中把提出的算法应用到实际数据，取得了理想的效果。

关键词: 公交网络, 矩阵运算, 最短路径查找算法