Efficient algorithm based on matrix computation for querying transit network
Yizhang Guan · Computer Engineering and Applications Journal · 2008
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.