摘要
采用将驻留点和线路抽象为二部图中的两类顶点的模型描述有限区域网络路径,用参照距离值度量顶点间路径的长度,考虑换路线因素和距离因素对路径选择行为的影响,在Dijkstra算法基础上,设计了网络最优路径搜索算法引入迭代惩罚函数,实现数字化校园导游系统。
The paper describes the bipartite graph model to represent region network.I n bipartite graph,stop-points and routes are all considered as vector,and the length of path is calculated by links referencing distance.Based on the bipartite graph model and Dijkstra algorithm,an optimal path-finding algorithm for region path network is designed.It is found that the proposed algorithm can efficiently consider both the transfer factor and the distance factor of the path choice.Furthermore,a multi-path selection algorithm for region path network is designed based on the iterative penalty method,digital Campus tour guide system is achieved.
出处
《电脑知识与技术》
2010年第12期9773-9774,共2页
Computer Knowledge and Technology
