Loop detection in connected graph
up vote
0
down vote
favorite
Most example I found only treat single linked lists. I need a solution for a multiple linked list.
Image is easier (valid):
Invalid:
Which algorithm would be able to return the begining of the loop (B) and not collide with E? A good starting point would be also to know if there is a loop at all.
Stuff like this or edge counting doesn't work (because not single linked...).
Thanks.
loops detection cycle
asked Nov 22 at 16:37
immerhart
75131430
add a comment |
up vote
0
down vote
favorite
Most example I found only treat single linked lists. I need a solution for a multiple linked list.
Image is easier (valid):
Invalid:
Which algorithm would be able to return the begining of the loop (B) and not collide with E? A good starting point would be also to know if there is a loop at all.
Stuff like this or edge counting doesn't work (because not single linked...).
Thanks.
loops detection cycle
asked Nov 22 at 16:37
immerhart
75131430
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Most example I found only treat single linked lists. I need a solution for a multiple linked list.
Image is easier (valid):
Invalid:
Which algorithm would be able to return the begining of the loop (B) and not collide with E? A good starting point would be also to know if there is a loop at all.
Stuff like this or edge counting doesn't work (because not single linked...).
Thanks.
loops detection cycle
asked Nov 22 at 16:37
immerhart
75131430
Most example I found only treat single linked lists. I need a solution for a multiple linked list.
Image is easier (valid):
Invalid:
Which algorithm would be able to return the begining of the loop (B) and not collide with E? A good starting point would be also to know if there is a loop at all.
Stuff like this or edge counting doesn't work (because not single linked...).
Thanks.
loops detection cycle
loops detection cycle
asked Nov 22 at 16:37
immerhart
75131430
asked Nov 22 at 16:37
immerhart
75131430
edited Dec 6 at 13:43
asked Nov 22 at 16:37
immerhart
75131430
asked Nov 22 at 16:37
immerhart
75131430
asked Nov 22 at 16:37
immerhart
75131430
75131430
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
up vote
0
down vote
accepted
Just check if a route from 'end of connection node (B)' to 'start of connection node (C)' exists, if yes, a new loop would be created. Doesn't quite answer it, but good enough...
answered Dec 6 at 13:45
immerhart
75131430
add a comment |
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%2f53435161%2floop-detection-in-connected-graph%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
up vote
0
down vote
accepted
Just check if a route from 'end of connection node (B)' to 'start of connection node (C)' exists, if yes, a new loop would be created. Doesn't quite answer it, but good enough...
answered Dec 6 at 13:45
immerhart
75131430
add a comment |
up vote
0
down vote
accepted
Just check if a route from 'end of connection node (B)' to 'start of connection node (C)' exists, if yes, a new loop would be created. Doesn't quite answer it, but good enough...
answered Dec 6 at 13:45
immerhart
75131430
add a comment |
up vote
0
down vote
accepted
up vote
0
down vote
accepted
Just check if a route from 'end of connection node (B)' to 'start of connection node (C)' exists, if yes, a new loop would be created. Doesn't quite answer it, but good enough...
answered Dec 6 at 13:45
immerhart
75131430
Just check if a route from 'end of connection node (B)' to 'start of connection node (C)' exists, if yes, a new loop would be created. Doesn't quite answer it, but good enough...
answered Dec 6 at 13:45
immerhart
75131430
answered Dec 6 at 13:45
immerhart
75131430
answered Dec 6 at 13:45
immerhart
75131430
answered Dec 6 at 13:45
immerhart
75131430
75131430
add a comment |
add a comment |
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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%2f53435161%2floop-detection-in-connected-graph%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
