Enumerate all input paths to a target
Attempting to enumerate all input-paths (path starting at a vertex with in degree of zero) to a target vertex.
All of the incoming/outgoing edges are stored in a vector called vertices.
I am attempting to use recursion to go through starting at the target, work backwards and at each incoming node, recursively call and retrieve the paths till a vertex that has its incoming vector edge size of zero (i.e indegree of zero).
All of the different paths are stored in a vector using string concatenation.
The function is printing the right amount of different paths and theyre starting vertices but some of the paths are missing some of the vertices after that. I am unsure of what is causing this issue.
bool enum_paths_helper(int target, vector<string> &paths, int &y) {
if (has_cycle() || target < 0 || target >= num_nodes())
return false;
int i;
if (vertices[target].incoming.size() == 0) {
y = paths.size();
paths.push_back(vertices[target].name);
return true;
}
for (i = 0; i < vertices[target].incoming.size(); i++) {
enum_paths_helper(vertices[target].incoming[i].vertex_id, paths, y);
paths[y] = paths[y] +" " + vertices[target].name;
}
return true;
}
c++ graph directed-acyclic-graphs
edited Nov 29 '18 at 6:09
adiga
11k62444
asked Nov 28 '18 at 4:04
John LarkosJohn Larkos
167
add a comment |
Attempting to enumerate all input-paths (path starting at a vertex with in degree of zero) to a target vertex.
All of the incoming/outgoing edges are stored in a vector called vertices.
I am attempting to use recursion to go through starting at the target, work backwards and at each incoming node, recursively call and retrieve the paths till a vertex that has its incoming vector edge size of zero (i.e indegree of zero).
All of the different paths are stored in a vector using string concatenation.
The function is printing the right amount of different paths and theyre starting vertices but some of the paths are missing some of the vertices after that. I am unsure of what is causing this issue.
bool enum_paths_helper(int target, vector<string> &paths, int &y) {
if (has_cycle() || target < 0 || target >= num_nodes())
return false;
int i;
if (vertices[target].incoming.size() == 0) {
y = paths.size();
paths.push_back(vertices[target].name);
return true;
}
for (i = 0; i < vertices[target].incoming.size(); i++) {
enum_paths_helper(vertices[target].incoming[i].vertex_id, paths, y);
paths[y] = paths[y] +" " + vertices[target].name;
}
return true;
}
c++ graph directed-acyclic-graphs
edited Nov 29 '18 at 6:09
adiga
11k62444
asked Nov 28 '18 at 4:04
John LarkosJohn Larkos
167
add a comment |
Attempting to enumerate all input-paths (path starting at a vertex with in degree of zero) to a target vertex.
All of the incoming/outgoing edges are stored in a vector called vertices.
I am attempting to use recursion to go through starting at the target, work backwards and at each incoming node, recursively call and retrieve the paths till a vertex that has its incoming vector edge size of zero (i.e indegree of zero).
All of the different paths are stored in a vector using string concatenation.
The function is printing the right amount of different paths and theyre starting vertices but some of the paths are missing some of the vertices after that. I am unsure of what is causing this issue.
bool enum_paths_helper(int target, vector<string> &paths, int &y) {
if (has_cycle() || target < 0 || target >= num_nodes())
return false;
int i;
if (vertices[target].incoming.size() == 0) {
y = paths.size();
paths.push_back(vertices[target].name);
return true;
}
for (i = 0; i < vertices[target].incoming.size(); i++) {
enum_paths_helper(vertices[target].incoming[i].vertex_id, paths, y);
paths[y] = paths[y] +" " + vertices[target].name;
}
return true;
}
c++ graph directed-acyclic-graphs
edited Nov 29 '18 at 6:09
adiga
11k62444
asked Nov 28 '18 at 4:04
John LarkosJohn Larkos
167
Attempting to enumerate all input-paths (path starting at a vertex with in degree of zero) to a target vertex.
All of the incoming/outgoing edges are stored in a vector called vertices.
I am attempting to use recursion to go through starting at the target, work backwards and at each incoming node, recursively call and retrieve the paths till a vertex that has its incoming vector edge size of zero (i.e indegree of zero).
All of the different paths are stored in a vector using string concatenation.
The function is printing the right amount of different paths and theyre starting vertices but some of the paths are missing some of the vertices after that. I am unsure of what is causing this issue.
bool enum_paths_helper(int target, vector<string> &paths, int &y) {
if (has_cycle() || target < 0 || target >= num_nodes())
return false;
int i;
if (vertices[target].incoming.size() == 0) {
y = paths.size();
paths.push_back(vertices[target].name);
return true;
}
for (i = 0; i < vertices[target].incoming.size(); i++) {
enum_paths_helper(vertices[target].incoming[i].vertex_id, paths, y);
paths[y] = paths[y] +" " + vertices[target].name;
}
return true;
}
c++ graph directed-acyclic-graphs
c++ graph directed-acyclic-graphs
edited Nov 29 '18 at 6:09
adiga
11k62444
asked Nov 28 '18 at 4:04
John LarkosJohn Larkos
167
edited Nov 29 '18 at 6:09
adiga
11k62444
asked Nov 28 '18 at 4:04
John LarkosJohn Larkos
167
edited Nov 29 '18 at 6:09
adiga
11k62444
edited Nov 29 '18 at 6:09
adiga
11k62444
edited Nov 29 '18 at 6:09
adiga
11k62444
11k62444
asked Nov 28 '18 at 4:04
John LarkosJohn Larkos
167
asked Nov 28 '18 at 4:04
John LarkosJohn Larkos
167
asked Nov 28 '18 at 4:04
John LarkosJohn Larkos
167
167
add a comment |
add a 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%2f53511951%2fenumerate-all-input-paths-to-a-target%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%2f53511951%2fenumerate-all-input-paths-to-a-target%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
