Mixing
How many directions you need to change the graph to go
There is a directed graph. All edges are in one direction only. The problem is to find the minimum number of possible changes so that you can get from one given node to another.
For example:
For a graph with three nodes and two edges (1->2, 3->2). You need to determine how many changes in edge direction should be made to achieve a path from node 1 to node 3. The answer will be 1, since it is enough to change edge 2->3 and get the path 1->2->3.
This is a task with a limited time (5s). The number of points and edges are in the range [1,10^6]. Memory is limited to 256 megabytes
Please help with finding a fast algorithm to solve this task
algorithm graph
edited Jan 2 at 22:32
zohar.kom
1,0841720
asked Jan 2 at 14:42
alex zamyatinalex zamyatin
316
add a comment |
There is a directed graph. All edges are in one direction only. The problem is to find the minimum number of possible changes so that you can get from one given node to another.
For example:
For a graph with three nodes and two edges (1->2, 3->2). You need to determine how many changes in edge direction should be made to achieve a path from node 1 to node 3. The answer will be 1, since it is enough to change edge 2->3 and get the path 1->2->3.
This is a task with a limited time (5s). The number of points and edges are in the range [1,10^6]. Memory is limited to 256 megabytes
Please help with finding a fast algorithm to solve this task
algorithm graph
edited Jan 2 at 22:32
zohar.kom
1,0841720
asked Jan 2 at 14:42
alex zamyatinalex zamyatin
316
2
What have you tried so far?
– merlyn
Jan 2 at 15:05
7
Mininun changes required in a directed graph to make path from 1 to n, Minimum edges to reverse to make path from a source to a destination
– Nico Schertler
Jan 2 at 15:06
add a comment |
There is a directed graph. All edges are in one direction only. The problem is to find the minimum number of possible changes so that you can get from one given node to another.
For example:
For a graph with three nodes and two edges (1->2, 3->2). You need to determine how many changes in edge direction should be made to achieve a path from node 1 to node 3. The answer will be 1, since it is enough to change edge 2->3 and get the path 1->2->3.
This is a task with a limited time (5s). The number of points and edges are in the range [1,10^6]. Memory is limited to 256 megabytes
Please help with finding a fast algorithm to solve this task
algorithm graph
edited Jan 2 at 22:32
zohar.kom
1,0841720
asked Jan 2 at 14:42
alex zamyatinalex zamyatin
316
There is a directed graph. All edges are in one direction only. The problem is to find the minimum number of possible changes so that you can get from one given node to another.
For example:
For a graph with three nodes and two edges (1->2, 3->2). You need to determine how many changes in edge direction should be made to achieve a path from node 1 to node 3. The answer will be 1, since it is enough to change edge 2->3 and get the path 1->2->3.
This is a task with a limited time (5s). The number of points and edges are in the range [1,10^6]. Memory is limited to 256 megabytes
Please help with finding a fast algorithm to solve this task
algorithm graph
algorithm graph
edited Jan 2 at 22:32
zohar.kom
1,0841720
asked Jan 2 at 14:42
alex zamyatinalex zamyatin
316
edited Jan 2 at 22:32
zohar.kom
1,0841720
asked Jan 2 at 14:42
alex zamyatinalex zamyatin
316
edited Jan 2 at 22:32
zohar.kom
1,0841720
edited Jan 2 at 22:32
zohar.kom
1,0841720
edited Jan 2 at 22:32
zohar.kom
1,0841720
1,0841720
asked Jan 2 at 14:42
alex zamyatinalex zamyatin
316
asked Jan 2 at 14:42
alex zamyatinalex zamyatin
316
asked Jan 2 at 14:42
alex zamyatinalex zamyatin
316
316
2
What have you tried so far?
– merlyn
Jan 2 at 15:05
7
Mininun changes required in a directed graph to make path from 1 to n, Minimum edges to reverse to make path from a source to a destination
– Nico Schertler
Jan 2 at 15:06
add a comment |
2
What have you tried so far?
– merlyn
Jan 2 at 15:05
7
Mininun changes required in a directed graph to make path from 1 to n, Minimum edges to reverse to make path from a source to a destination
– Nico Schertler
Jan 2 at 15:06
2
2
What have you tried so far?
– merlyn
Jan 2 at 15:05
What have you tried so far?
– merlyn
Jan 2 at 15:05
7
7
Mininun changes required in a directed graph to make path from 1 to n, Minimum edges to reverse to make path from a source to a destination
– Nico Schertler
Jan 2 at 15:06
Mininun changes required in a directed graph to make path from 1 to n, Minimum edges to reverse to make path from a source to a destination
– Nico Schertler
Jan 2 at 15:06
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%2f54008306%2fhow-many-directions-you-need-to-change-the-graph-to-go%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%2f54008306%2fhow-many-directions-you-need-to-change-the-graph-to-go%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
2
What have you tried so far?
– merlyn
Jan 2 at 15:05
7
Mininun changes required in a directed graph to make path from 1 to n, Minimum edges to reverse to make path from a source to a destination
– Nico Schertler
Jan 2 at 15:06