1.4.7 Eulerian Cycle / Chinese Postman

Problem Input | Problem Output


INPUT                    OUTPUT


Input Description: A graph G=(V,E) . Problem: Find the shortest tour of G visiting each edge at least once.


Implementations

  • Combinatorica (Mathematica) (rating 3)
  • Nijenhuis and Wilf: Combinatorial Algorithms (FORTRAN) (rating 3)

    Related Problems

  • Hamiltonian Cycle
  • Matching


    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 .