 |
COMBINATORICA PACKAGE SYMBOL
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.
Details
- To use
, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
