摘要
文章联系实际问题,结合旅行商问题和中国邮递员问题,提出赋权连通图中最小环路遍历路径以及求解该路径的方案.该方案参考最小生成树的普里姆算法,依据狄杰斯特拉算法,通过往返最短路径逐次比较,在赋权连通图中实现寻找最小环路遍历路径.
This paper proposed to empower a connected graph the smallest loop to traverse the path to solve practice problems,combined with the traveling salesman problem and the Chinese postman problem.In this program,referring to Prim algorithm of the minimum spanning tree,based on Dijkstra algorithm,by successive approximation and the shortest path to empower the connected graph,the minimum loop traversal path is found.
出处
《渭南师范学院学报》
2012年第10期78-80,共3页
Journal of Weinan Normal University
基金
渭南师范学院科研计划项目(12YKS030)
关键词
赋权
连通图
环路
遍历
算法
empowering
connected graph
loop
traverse
algorithm
