Shortest path algorithm for differently weighted bidirectional graph
I am searching for a way of finding the shortest path for a differently weighted bidirectional graph. The graph is not complete, almost all the edges are bidirected and the weight from A to B is not the same as from B to A. Only two of the vertices, the source, and the target, will have only the mono-directed weighted edge connecting them.
All the algorithms' examples I found (Dijkstra, Floyd–Warshall etc.) are covering the situation when the weight from A to B is the same as from B to A.
graph-theory
asked Dec 3 '18 at 14:43
George P.
61
add a comment |
I am searching for a way of finding the shortest path for a differently weighted bidirectional graph. The graph is not complete, almost all the edges are bidirected and the weight from A to B is not the same as from B to A. Only two of the vertices, the source, and the target, will have only the mono-directed weighted edge connecting them.
All the algorithms' examples I found (Dijkstra, Floyd–Warshall etc.) are covering the situation when the weight from A to B is the same as from B to A.
graph-theory
asked Dec 3 '18 at 14:43
George P.
61
1
No, they all cover the more general case.
– Fabio Somenzi
Dec 3 '18 at 14:51
add a comment |
I am searching for a way of finding the shortest path for a differently weighted bidirectional graph. The graph is not complete, almost all the edges are bidirected and the weight from A to B is not the same as from B to A. Only two of the vertices, the source, and the target, will have only the mono-directed weighted edge connecting them.
All the algorithms' examples I found (Dijkstra, Floyd–Warshall etc.) are covering the situation when the weight from A to B is the same as from B to A.
graph-theory
asked Dec 3 '18 at 14:43
George P.
61
I am searching for a way of finding the shortest path for a differently weighted bidirectional graph. The graph is not complete, almost all the edges are bidirected and the weight from A to B is not the same as from B to A. Only two of the vertices, the source, and the target, will have only the mono-directed weighted edge connecting them.
All the algorithms' examples I found (Dijkstra, Floyd–Warshall etc.) are covering the situation when the weight from A to B is the same as from B to A.
graph-theory
graph-theory
asked Dec 3 '18 at 14:43
George P.
61
asked Dec 3 '18 at 14:43
George P.
61
asked Dec 3 '18 at 14:43
George P.
61
asked Dec 3 '18 at 14:43
George P.
61
asked Dec 3 '18 at 14:43
George P.
61
61
1
No, they all cover the more general case.
– Fabio Somenzi
Dec 3 '18 at 14:51
add a comment |
1
No, they all cover the more general case.
– Fabio Somenzi
Dec 3 '18 at 14:51
1
1
No, they all cover the more general case.
– Fabio Somenzi
Dec 3 '18 at 14:51
No, they all cover the more general case.
– Fabio Somenzi
Dec 3 '18 at 14:51
add a comment |
0
active
oldest
votes
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%2f3024147%2fshortest-path-algorithm-for-differently-weighted-bidirectional-graph%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 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.
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%2fmath.stackexchange.com%2fquestions%2f3024147%2fshortest-path-algorithm-for-differently-weighted-bidirectional-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
1
No, they all cover the more general case.
– Fabio Somenzi
Dec 3 '18 at 14:51