Labels

[MATH] Hamiltonian path

http://mathworld.wolfram.com/HamiltonianPath.html

HamiltonianPath[g, All]
at Sunday, March 15, 2009

1 comment:

  1. UnknownMarch 15, 2009 at 6:08 PM

    Hamiltonian path is a path that visit each vertex once.

    Eulerian path is a path that contain no repeated edge, namely, a trail containing all edges

    trail/path

    ReplyDelete

Subscribe to: Post Comments (Atom)