HamiltonianQ[g]
yields True if there exists a Hamiltonian cycle in graph 
, or in other words, if there exists a cycle that visits each vertex exactly once.
HamiltonianQ
HamiltonianQ[g]
yields True if there exists a Hamiltonian cycle in graph 
, or in other words, if there exists a cycle that visits each vertex exactly once.
更多信息和选项
- HamiltonianQ functionality is now available in the built-in Wolfram Language function HamiltonianGraphQ.
- To use HamiltonianQ, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
范例
基本范例 (2)
HamiltonianQ has been superseded by HamiltonianGraphQ:
文本
Wolfram Research (2012)，HamiltonianQ，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianQ.html.
CMS
Wolfram 语言. 2012. "HamiltonianQ." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianQ.html.
APA
Wolfram 语言. (2012). HamiltonianQ. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/HamiltonianQ.html 年