1.5.5 Hamiltonian Cycle

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: A graph G = (V,E) .

Problem: Find an ordering of the vertices such that each vertex is visited exactly once.

Implementations

  • Netlib / TOMS -- Collected Algorithms of the ACM (FORTRAN) (rating 6)
  • Nijenhuis and Wilf: Combinatorial Algorithms (FORTRAN) (rating 5)
  • The Stanford GraphBase (C) (rating 4)
  • Combinatorica (Mathematica) (rating 3)
  • Xtango and Polka Algorithm Animation Systems (C++) (rating 3)

    Related Problems

  • Eulerian Cycle / Chinese Postman
  • Traveling Salesman Problem

    Go to the corresponding chapter in the book
    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Tue Jun 03, 1997 .