English is not my mother tongue so I don´t know exactly wich is the difference between a tour and path in graphs theory context. I think that in both cases it is a way throught various vertex or points. Is this correct?

  • $\begingroup$ Usually, a path connects two vertices without repeat. A tour goes though all vertices. $\endgroup$ – Ed Pegg Aug 22 '17 at 14:53
  • $\begingroup$ So the difference is if vertices are repeated? $\endgroup$ – Ixer Aug 22 '17 at 15:10
  • 1
    $\begingroup$ All vertices -- tour. Some vertices -- path. Neither repeats a vertex. $\endgroup$ – Ed Pegg Aug 22 '17 at 15:11
  • $\begingroup$ Seems that a tour is a clycle according to this phrase in wikipedia :"A Hamiltonian cycle, Hamiltonian circuit, vertex tour or graph cycle is a cycle that visits each vertex exactly once (except for the vertex that is both the start and end, which is visited twice)." Is this incorrect in wikipedia? $\endgroup$ – Ixer Aug 22 '17 at 15:40

Walk - A sequence of vertices and edges, where the edges connect the adjacent vertices in the sequence

Tour - a walk with no repeated edges

Path - a walk with no repeated vertices

Source: CS 70 MT1 Review Spring 2018 @ UC Berkeley


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.