摘要
针对公交线路中存在往返路线不一致、内外线路等情况,对用改进的邻接矩阵方法实现这一类型的公交换乘进行了研究.最后通过对线路结果集进行筛选、比较实现了最少换乘、最少站点为约束条件的公交换乘查询模块.
There are go-return route and out-in routes in bus route,use the method of better adjacency matrix to implement this kind of bus change.Finally,by selecting better in the sets of result,it can achieve the aim of least bus change and stations in bus change module.
出处
《电脑知识与技术（过刊）》
2007年第14期517-518,共2页
Computer Knowledge and Technology
关键词
往返路线
内外线
邻接矩阵
最少换乘
最少站点
go-return route
out-in route
adjacency matrix
least bus change
least stations
