以最少换乘次数和站数为目标的公交出行算法

摘要：
城市公交系统是与城市居民日常生活联系最为紧密的环节之一，甚至在一定程度上决定着城市居民的生活方式。随着城市规模的扩大，城市公交系统也随之变得比较复杂，城市居民出行方式也日益增多，其中一种比较普及的出行方式便是乘坐公交车，这是大多数城市居民经常选择的一种交通方式。所以出行之前选择最优的公交路线也随着变的比较让人关注。在实际中，人们认为的最方便快捷的公交路线，即最少换乘次数的公交路线。在计算机算法中最优的路径是最短路径，但是这在现实生活中并不一定是最优的，在某些情况下，最短的路径要经过多次的换乘，这对于大多数的居民的生活习惯来说并不是最优的路线，在人们的意识中，越少的换车就越方便。利用无向图的广度遍历，通过将路径保存，然后对路径进行筛选，以途经最少结点的原则来求的结果。

关键词：图；公交系统；图遍历；最少换乘次数

Abstruct:
Urban transit system with urban everyday life is one of the most closely contact link, even in a certain extent, determines the urban lifestyles. With the expansion of cities, urban transit system becomes more complex, and urban transportation are increasing, one is quite popular travel is by bus, this is most urban residents often choose a kind of means of transportation. So before the trip to choose the optimum bus routes also compared with change focus. In practice, most people think of convenient public transport routes, namely transfer number at the bus route. In computer algorithm for optimal path is the shortest path, but this in real life is not necessarily the optimal and, in some cases, the shortest path to transfer, after several times for most of the residents of this life habit is not optimal route, in the consciousness of people, the less the transfer. Using the breadth of graph traversal, through the path to save, then by screening path, through the principle of minimum node to results.

Keyword: Figure; Transit system; Graph traversal; At least transfer number

*若需了解更多与协助请咨询↓→[电脑QQ][手机QQ]【数据协助】