reason for computing topological ordering for shortest path in a weighted DAG
up vote
0
down vote
favorite
What is the reason for having to first compute the topological ordering for finding the shortest path in a DAG? For example, if we are given a DAG in an adjacency list format, can't we just iterate BFS or DFS style to find the shortest path? (starting with the start node of course) Why does there have to be a unique ordering? I've been doing examples, and it seems that finding a topological ordering does not make a difference.
directed-acyclic-graphs graph-traversal topological-sort weighted-graph
asked Nov 8 at 4:32
JohnnyD27
613
add a comment |
up vote
0
down vote
favorite
What is the reason for having to first compute the topological ordering for finding the shortest path in a DAG? For example, if we are given a DAG in an adjacency list format, can't we just iterate BFS or DFS style to find the shortest path? (starting with the start node of course) Why does there have to be a unique ordering? I've been doing examples, and it seems that finding a topological ordering does not make a difference.
directed-acyclic-graphs graph-traversal topological-sort weighted-graph
asked Nov 8 at 4:32
JohnnyD27
613
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
What is the reason for having to first compute the topological ordering for finding the shortest path in a DAG? For example, if we are given a DAG in an adjacency list format, can't we just iterate BFS or DFS style to find the shortest path? (starting with the start node of course) Why does there have to be a unique ordering? I've been doing examples, and it seems that finding a topological ordering does not make a difference.
directed-acyclic-graphs graph-traversal topological-sort weighted-graph
asked Nov 8 at 4:32
JohnnyD27
613
What is the reason for having to first compute the topological ordering for finding the shortest path in a DAG? For example, if we are given a DAG in an adjacency list format, can't we just iterate BFS or DFS style to find the shortest path? (starting with the start node of course) Why does there have to be a unique ordering? I've been doing examples, and it seems that finding a topological ordering does not make a difference.
directed-acyclic-graphs graph-traversal topological-sort weighted-graph
directed-acyclic-graphs graph-traversal topological-sort weighted-graph
asked Nov 8 at 4:32
JohnnyD27
613
asked Nov 8 at 4:32
JohnnyD27
613
asked Nov 8 at 4:32
JohnnyD27
613
asked Nov 8 at 4:32
JohnnyD27
613
asked Nov 8 at 4:32
JohnnyD27
613
613
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
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.
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%2f53201599%2freason-for-computing-topological-ordering-for-shortest-path-in-a-weighted-dag%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
