广东省中小城市公交线路评估

AbstractThis paper takes the public transportation network of Shanwei City asthe research object,through analyzing the public transportation transfersituation of Shanwei City,collecting the public transportation line andstation information of Shanwei City,choosing Java programming language,using two-dimensional array to complete the information storage of thepublic transportation line station and the multiplication algorithm of thelarge matrix with the public transportation station as the node,and usingadjacency matrix It can be used to find whether the graph nodes can beconnected with each other.It can complete the function of primary transferby finding the square of the matrix,and complete the function of secondarytransfer by finding the cube of the matrix.In the later stage,the startingpoint is determined to traverse the array of stations to find the traversal modewhere one or two midpoint can reach the end point,and the method offinding the square and cube of the adjacency matrix is optimized to achievethe purpose of primary and secondary transfer.Finally,by comparing thetime efficiency with other common shortest path algorithms,it shows thatthe adjacency matrix can achieve the efficiency and stability of one transferand two transfer schemes by finding the first and second power of the superlarge matrix.Keywords:Public transport;arge matrix multiplication;djacency matrix;transfer