HamiltonianCycle[g]
finds a Hamiltonian cycle in graph 
if one exists.
HamiltonianCycle[g,All]
gives all Hamiltonian cycles of graph 
.
HamiltonianCycle
HamiltonianCycle[g]
finds a Hamiltonian cycle in graph 
if one exists.
HamiltonianCycle[g,All]
gives all Hamiltonian cycles of graph 
.
更多信息和选项
- HamiltonianCycle functionality is now available in the built-in Wolfram Language function FindHamiltonianCycle.
- To use HamiltonianCycle, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
范例
基本范例 (2)
HamiltonianCycle has been superseded by FindHamiltonianCycle:
文本
Wolfram Research (2012)，HamiltonianCycle，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianCycle.html.
CMS
Wolfram 语言. 2012. "HamiltonianCycle." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianCycle.html.
APA
Wolfram 语言. (2012). HamiltonianCycle. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianCycle.html 年