利用矩阵翻转法求最佳H圈

Seeking the Best Hamilton Cycle Through Matrix Turning

利用矩阵翻转实现二边逐次修正法求最佳哈密尔顿圈（H圈）。首先构造完备加权图，并用距离矩阵表示之，使所选初始圈的顶点为矩阵主对角线的上方元素对应的顶点；然后对距离矩阵加边框并进行若干次“翻转”，直到矩阵不满足二边逐次修正法的修正原则，最后得到的矩阵主对角线的上方元素确定了最佳H圈的权重及路线。

The paper utilizes the matrix turning to realize that using the principle of one by one revision of two sides to obtain the best Hamilton Circle. We construct complete weighted graph at first, and represent it by matrix, such that the points of the initial Circle are the points corresponding to the upper elements of the matrix main diagonal. Then carrying on ＂turning＂ on matrix several times until the matrix does not satisfy with the principle of one by one revision of two sides. At last, the weight and route of the best Hamilton Circle are confirmed by the upper elements of the final matrix main diagonal.