Pathfinding algorithm constrained to one-way roads
Say I have 5 "towns": A, B, C, D and E.
Now I want to figure out a path between these towns, but I am constrained to roads, for example A only has roads to B, C and E and B only has a road to C etc.
I can't visit a town twice and the roads are only one-way. I want to "visit" all the towns. How would I programmatically solve this?
I've already tried starting at A, then seeing what roads there are and checking each option, although all my tries so far at implementing this have failed.
algorithm path-finding
edited Nov 24 '18 at 9:57
Gihan Saranga Siriwardhana
615424
asked Nov 24 '18 at 8:05
MelluhMelluh
14
|
show 1 more comment
Say I have 5 "towns": A, B, C, D and E.
Now I want to figure out a path between these towns, but I am constrained to roads, for example A only has roads to B, C and E and B only has a road to C etc.
I can't visit a town twice and the roads are only one-way. I want to "visit" all the towns. How would I programmatically solve this?
I've already tried starting at A, then seeing what roads there are and checking each option, although all my tries so far at implementing this have failed.
algorithm path-finding
edited Nov 24 '18 at 9:57
Gihan Saranga Siriwardhana
615424
asked Nov 24 '18 at 8:05
MelluhMelluh
14
What have you done so far? I did a quick google search and a few introduction popped up. Could you please add your attempts you did so far? Finally, you are mentioning three towns but to me it looks like every character represents one town and you have five characters (=5 towns).
– Alex_P
Nov 24 '18 at 8:12
sounds very similar to node pathing in a network
– John Lord
Nov 24 '18 at 8:24
@Alex_P Sorry, there are indeed 5 towns, that was a typo. Could you link the resources you found? I couldn't really find anything myself, but that might just be my search query. As for what I've already tried, I've updated the post with that.
– Melluh
Nov 24 '18 at 8:48
Did you see the links I posted? Did you find them before?
– Alex_P
Nov 24 '18 at 15:19
Voting to close due to lack of research. The keywords to google are "directed graphs" and "traveling salesman problem"
– BlueRaja - Danny Pflughoeft
Nov 24 '18 at 17:14
|
show 1 more comment
Say I have 5 "towns": A, B, C, D and E.
Now I want to figure out a path between these towns, but I am constrained to roads, for example A only has roads to B, C and E and B only has a road to C etc.
I can't visit a town twice and the roads are only one-way. I want to "visit" all the towns. How would I programmatically solve this?
I've already tried starting at A, then seeing what roads there are and checking each option, although all my tries so far at implementing this have failed.
algorithm path-finding
edited Nov 24 '18 at 9:57
Gihan Saranga Siriwardhana
615424
asked Nov 24 '18 at 8:05
MelluhMelluh
14
Say I have 5 "towns": A, B, C, D and E.
Now I want to figure out a path between these towns, but I am constrained to roads, for example A only has roads to B, C and E and B only has a road to C etc.
I can't visit a town twice and the roads are only one-way. I want to "visit" all the towns. How would I programmatically solve this?
I've already tried starting at A, then seeing what roads there are and checking each option, although all my tries so far at implementing this have failed.
algorithm path-finding
algorithm path-finding
edited Nov 24 '18 at 9:57
Gihan Saranga Siriwardhana
615424
asked Nov 24 '18 at 8:05
MelluhMelluh
14
edited Nov 24 '18 at 9:57
Gihan Saranga Siriwardhana
615424
asked Nov 24 '18 at 8:05
MelluhMelluh
14
edited Nov 24 '18 at 9:57
Gihan Saranga Siriwardhana
615424
edited Nov 24 '18 at 9:57
Gihan Saranga Siriwardhana
615424
edited Nov 24 '18 at 9:57
Gihan Saranga Siriwardhana
615424
615424
asked Nov 24 '18 at 8:05
MelluhMelluh
14
asked Nov 24 '18 at 8:05
MelluhMelluh
14
asked Nov 24 '18 at 8:05
MelluhMelluh
14
14
What have you done so far? I did a quick google search and a few introduction popped up. Could you please add your attempts you did so far? Finally, you are mentioning three towns but to me it looks like every character represents one town and you have five characters (=5 towns).
– Alex_P
Nov 24 '18 at 8:12
sounds very similar to node pathing in a network
– John Lord
Nov 24 '18 at 8:24
@Alex_P Sorry, there are indeed 5 towns, that was a typo. Could you link the resources you found? I couldn't really find anything myself, but that might just be my search query. As for what I've already tried, I've updated the post with that.
– Melluh
Nov 24 '18 at 8:48
Did you see the links I posted? Did you find them before?
– Alex_P
Nov 24 '18 at 15:19
Voting to close due to lack of research. The keywords to google are "directed graphs" and "traveling salesman problem"
– BlueRaja - Danny Pflughoeft
Nov 24 '18 at 17:14
|
show 1 more comment
What have you done so far? I did a quick google search and a few introduction popped up. Could you please add your attempts you did so far? Finally, you are mentioning three towns but to me it looks like every character represents one town and you have five characters (=5 towns).
– Alex_P
Nov 24 '18 at 8:12
sounds very similar to node pathing in a network
– John Lord
Nov 24 '18 at 8:24
@Alex_P Sorry, there are indeed 5 towns, that was a typo. Could you link the resources you found? I couldn't really find anything myself, but that might just be my search query. As for what I've already tried, I've updated the post with that.
– Melluh
Nov 24 '18 at 8:48
Did you see the links I posted? Did you find them before?
– Alex_P
Nov 24 '18 at 15:19
Voting to close due to lack of research. The keywords to google are "directed graphs" and "traveling salesman problem"
– BlueRaja - Danny Pflughoeft
Nov 24 '18 at 17:14
What have you done so far? I did a quick google search and a few introduction popped up. Could you please add your attempts you did so far? Finally, you are mentioning three towns but to me it looks like every character represents one town and you have five characters (=5 towns).
– Alex_P
Nov 24 '18 at 8:12
What have you done so far? I did a quick google search and a few introduction popped up. Could you please add your attempts you did so far? Finally, you are mentioning three towns but to me it looks like every character represents one town and you have five characters (=5 towns).
– Alex_P
Nov 24 '18 at 8:12
sounds very similar to node pathing in a network
– John Lord
Nov 24 '18 at 8:24
sounds very similar to node pathing in a network
– John Lord
Nov 24 '18 at 8:24
@Alex_P Sorry, there are indeed 5 towns, that was a typo. Could you link the resources you found? I couldn't really find anything myself, but that might just be my search query. As for what I've already tried, I've updated the post with that.
– Melluh
Nov 24 '18 at 8:48
@Alex_P Sorry, there are indeed 5 towns, that was a typo. Could you link the resources you found? I couldn't really find anything myself, but that might just be my search query. As for what I've already tried, I've updated the post with that.
– Melluh
Nov 24 '18 at 8:48
Did you see the links I posted? Did you find them before?
– Alex_P
Nov 24 '18 at 15:19
Did you see the links I posted? Did you find them before?
– Alex_P
Nov 24 '18 at 15:19
Voting to close due to lack of research. The keywords to google are "directed graphs" and "traveling salesman problem"
– BlueRaja - Danny Pflughoeft
Nov 24 '18 at 17:14
Voting to close due to lack of research. The keywords to google are "directed graphs" and "traveling salesman problem"
– BlueRaja - Danny Pflughoeft
Nov 24 '18 at 17:14
|
show 1 more comment
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
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
},
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%2fstackoverflow.com%2fquestions%2f53456331%2fpathfinding-algorithm-constrained-to-one-way-roads%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- 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.
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%2fstackoverflow.com%2fquestions%2f53456331%2fpathfinding-algorithm-constrained-to-one-way-roads%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
What have you done so far? I did a quick google search and a few introduction popped up. Could you please add your attempts you did so far? Finally, you are mentioning three towns but to me it looks like every character represents one town and you have five characters (=5 towns).
– Alex_P
Nov 24 '18 at 8:12
sounds very similar to node pathing in a network
– John Lord
Nov 24 '18 at 8:24
@Alex_P Sorry, there are indeed 5 towns, that was a typo. Could you link the resources you found? I couldn't really find anything myself, but that might just be my search query. As for what I've already tried, I've updated the post with that.
– Melluh
Nov 24 '18 at 8:48
Did you see the links I posted? Did you find them before?
– Alex_P
Nov 24 '18 at 15:19
Voting to close due to lack of research. The keywords to google are "directed graphs" and "traveling salesman problem"
– BlueRaja - Danny Pflughoeft
Nov 24 '18 at 17:14