Tour vs Path in graph theroy
$begingroup$
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?
graph-theory terminology
asked Aug 22 '17 at 14:50
IxerIxer
1910
$endgroup$
add a comment |
$begingroup$
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?
graph-theory terminology
asked Aug 22 '17 at 14:50
IxerIxer
1910
$endgroup$
$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
$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
add a comment |
$begingroup$
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?
graph-theory terminology
asked Aug 22 '17 at 14:50
IxerIxer
1910
$endgroup$
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?
graph-theory terminology
graph-theory terminology
asked Aug 22 '17 at 14:50
IxerIxer
1910
asked Aug 22 '17 at 14:50
IxerIxer
1910
asked Aug 22 '17 at 14:50
IxerIxer
1910
asked Aug 22 '17 at 14:50
IxerIxer
1910
asked Aug 22 '17 at 14:50
IxerIxer
1910
1910
$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
$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
add a comment |
$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
$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
$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$
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
$begingroup$
So the difference is if vertices are repeated?
$endgroup$
– Ixer
Aug 22 '17 at 15:10
$begingroup$
All vertices -- tour. Some vertices -- path. Neither repeats a vertex.
$endgroup$
– Ed Pegg
Aug 22 '17 at 15:11
$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
$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
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
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
answered Feb 13 '18 at 19:39
winstonjwinstonj
1
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2402445%2ftour-vs-path-in-graph-theroy%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
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
answered Feb 13 '18 at 19:39
winstonjwinstonj
1
$endgroup$
add a comment |
$begingroup$
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
answered Feb 13 '18 at 19:39
winstonjwinstonj
1
$endgroup$
add a comment |
$begingroup$
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
answered Feb 13 '18 at 19:39
winstonjwinstonj
1
$endgroup$
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
answered Feb 13 '18 at 19:39
winstonjwinstonj
1
answered Feb 13 '18 at 19:39
winstonjwinstonj
1
answered Feb 13 '18 at 19:39
winstonjwinstonj
1
answered Feb 13 '18 at 19:39
winstonjwinstonj
1
1
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2402445%2ftour-vs-path-in-graph-theroy%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$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
$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