摘要
把图论中针对单个结点的广度优先搜索思想 ,推广到拥有若干个结点集合的广度优先搜索上 .对旅游路线中最佳路径的问题 ,提出一种新的算法 ,可解决旅游路线中的最少换乘问题 ,并已成功地在计算机上实现 .
The idea of breadth-first search, or BRS for short, aiming at single node in graph theory is extended to the BRS possessing set of nodes. In relation to best path in travel route, the author advances a new algorithm which has been implemented on computer and will solve least transfer in travel route.
出处
《华侨大学学报(自然科学版)》
CAS
2001年第4期348-350,共3页
Journal of Huaqiao University(Natural Science)