Analysis and Research of Minimum Loop Traversal Path of the Weighted Graph
Suo Hong-jun · Journal of Weinan Normal University · 2012
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.