As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. >>

attempts to find a Hamiltonian cycle.


  • FindHamiltonianCycle functionality is now available in the built-in Wolfram Language function FindHamiltonianCycle.
  • To use , you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
  • FindHamiltonianCycle[g] returns an empty list if no Hamiltonian cycle is found.
  • considers the input graph as undirected.
  • uses heuristic algorithms to find a Hamiltonian cycle; therefore, there is no guarantee that a Hamiltonian cycle will be found even if one exists.
Translate this page: