---

A new algorithm to solve the Hamilton Cycle problem.

It is intended for release as a Perl module on CPAN. ( source code on GitHub )

---

Please enter the edge list of an undirected graph, to try it out:

Here are some graphs to get you started:

• simple graph
• bigger graph
• a non-Hamiltonian graph
• a Hamiltonian graph
• The Herschel Graph is richly connected; all vertices have degree 3 or 4. One would intuitively expect the Herschel Graph to be Hamiltonian. However, the Herschel Graph is the smallest, non-Hamiltonian, polyhedral graph.
• A 40 vertex graph that is found to be Hamiltonian rather quickly.

---

Ashwin Dixit

ashwin at ownlifeful dot com

---