Improvement of the Optimal Hamilton Circuit for Undirected Complete Graph

Based on the Nearest Neighbor Algorithm, this paper introduces the Algorithm of Gradually Convergent and the Cross-wire Cutting, which according to gradually convergence of the path-changing and the principle of minimum path length variation respectively. Both of them optimize the algorithm of Optimal Hamilton Circuit in undirected complete graphs, comparing three aspects of accuracy, stability and running speed. Finally, we can know the preponderance and inferior of these algorithms through synthesizing.