中文说明：
提供一种求解最优哈密尔顿的算法---三边交换调整法，要求在运行jiaohuan3（三交换法）之前，给定邻接矩阵C和节点个数N，结果路径存放于R中。
English Description：
This paper provides an algorithm for solving the optimal Hamiltonian - trilateral exchange adjustment method. It is required to give the adjacency matrix C and the number of nodes n before running jiaohuan3 (trilateral exchange method), and the resulting path is stored in R