A matrix algorithm about bus line inquiry scheme

In this paper a matrix algorithm about the city bus line inquiry is designed. Two non-negative fundamental matrices are introduced into the algorithm to record the shortest distance and the corresponding bus line number between two stands when they are both stations on some same bus line. By using these matrices, the efficiency of some classical shortcut algorithm is improved to decrease the quantity of searching. Also the matrix algorithm translates the scheme of the shortest rides into searching nonzero elements in these matrices and avoiding numerous reduplicate comparatives and replacing operation. The algorithm is verified efficient to inquire bus shortcut in Beijing.