文件名称:哈密顿
介绍说明--下载内容均来自于网络,请自行研究使用
由c语言编程,在window下运行,为无向图,先读入两个数据,第一个数据为点的个数,第二个数据为边的个数。此后依次输入哪两个点之前连线,即完成无向图。之后程序会输出0和1,0代表不存在哈密顿回路,1代表存在哈密顿回路(Programming by C language, run under window, for undirected graph, read two data first, the first data is the number of points, the second data is the number of edges. Then, which two points are connected in advance to complete the undirected graph. After that, the program outputs 0 and 1,0 representing the Hamiltonian loop, and 1 represents the Hamiltonian circuit)
相关搜索: 判断无向图是否存在哈密顿回路
(系统自动生成,下载前可以参看下载内容)