GraphUtilities`
GraphUtilities`
HamiltonianCycles
As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. »
HamiltonianCycles[g,n]
gives a list of n Hamiltonian cycles.
HamiltonianCycles[g]
gives a list of one Hamiltonian cycle.
更多信息和选项
- HamiltonianCycles functionality is now available in the built-in Wolfram Language function FindHamiltonianCycle.
- To use HamiltonianCycles, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
- HamiltonianCycles[g,n] returns an empty list if no Hamiltonian cycle exists.
- HamiltonianCycles considers the input graph as undirected.
- The complexity of the algorithm is such that finding all Hamiltonian cycles for a large graph can take an exponential amount of time.
范例
打开所有单元关闭所有单元基本范例 (2)
This defines a small graph and finds a Hamiltonian cycle of the graph:
HamiltonianCycles has been superseded by FindHamiltonianCycle:
Scope (1)
Applications (1)
Wolfram Research (2007),HamiltonianCycles,Wolfram 语言函数,https://reference.wolfram.com/language/GraphUtilities/ref/HamiltonianCycles.html.
文本
Wolfram Research (2007),HamiltonianCycles,Wolfram 语言函数,https://reference.wolfram.com/language/GraphUtilities/ref/HamiltonianCycles.html.
CMS
Wolfram 语言. 2007. "HamiltonianCycles." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/GraphUtilities/ref/HamiltonianCycles.html.
APA
Wolfram 语言. (2007). HamiltonianCycles. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/GraphUtilities/ref/HamiltonianCycles.html 年