提供一种求解最优哈密尔顿的算法---三边交换调整法，要求在运行jiaohuan3（三交换法）之前，给定邻接矩阵C和节点个数N，结果路径存放于R中。-Hamilton provides an optimal algorithm for solving triangular exchange--- Adjustment Act to require running jiaohuan3 (c exchange) before the adjacency matrix C, given the number of nodes N, the results of the path stored in R,.