这个程序主要是应用在图论中来解决哈密顿回路问题 是比较常见的-This procedure is mainly used in graph theory to solve the Hamiltonian circuit problem is more common

主要包含数学中的离散优化各个问题求解，有最短路、哈密尔顿回路、顶点覆盖近似算法、最大流和最小截等问题。-Discrete optimization

对matlab解决图论问题的算法做个汇总。主要包括：顶点覆盖近似算法、哈密尔顿回路、最大流和最小截、最短路和次短路、最小生成树Prim算法、最短路径等等。由于太多就不一一列举了。-Matlab to solve the problem of graph theory algorithms to be aggregated. Include: vertex cover approximation algorithm, Hamilton circuit, the maximum flow and m

用回溯法求解一般哈密尔顿回路问题,理论加代码-General Hamilton circuit problem, theoretical and backtracking to solve code