在一个图中 求最短哈密尔顿回路并将最短路径储存-least hamilton road

求哈密尔顿圈，即每个点走一次，走遍每个点-Seek Hamilton Circle, take the time that each point, each point traveled

基于降度算法的哈密尔顿最优圈搜寻方法,寻找费用最小的哈密尔顿路径，用于解决TSP、任务分流、任务指派等问题-Find the best Hamilton route based on the method of lap down algorithm. The algorithm finds the minimum cost path for solving TSP, the task diversion, task assignment and other issues