Hamiltonian-graph
于 2011-07-20 发布
文件大小:9KB
0 56
下载积分: 1
下载次数: 6
代码说明：
哈密顿图的判定：经过图中所有顶点一次且仅一次的回路称为哈密顿回路。具有哈密顿回路的图称为哈密顿图，(determine Hamiltonian graph : After all the vertices of a graph and only one loop is called Hamiltonian circuit. A graph that has a Hamiltonian circuit is called a Hamiltonian map,)
下载说明：请别用迅雷下载，失败请重下，重下不扣分！
发表评论
