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 FindHamiltonianCycle, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
- FindHamiltonianCycle[g] returns an empty list if no Hamiltonian cycle is found.
- FindHamiltonianCycle considers the input graph as undirected.
- FindHamiltonianCycle uses heuristic algorithms to find a Hamiltonian cycle; therefore, there is no guarantee that a Hamiltonian cycle will be found even if one exists.
- Graph Utilities Package
- Graphs & Networks
- Graph Visualization
- Computation on Graphs
- Graph Construction & Representation
- Graphs and Matrices
- Graph Properties & Measurements
- Graph Operations and Modifications
- Statistical Analysis
- Social Network Analysis
- Graph Properties
- Mathematical Data Formats
- Discrete Mathematics