The Network Method of Choosing the Satisfied Riding Routes
Jiao Xiang · Journal of Northeast Dianli University · 2009
In this paper,by considering the 2007 CUMCM(B)-To watch the Olympic Games by bus,we have discussed the problem of choosing riding routes.According to the fewest changing times,the shortest time and the least-cost principle,we are seeking to use the Matrix Algorithm between any two stations in the network shortest path and the Dijkstra Algorithm of the shortest path between the two given stations.The problems are solved with satisfied results.