I need to find the shortest path in a graph that passes through at least one edge marked as “must pass”. Any ideas? Could Dijkstra’s algorithm be modified in order to achieve this?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I need to find the shortest path in a graph that passes through at least one edge marked as “must pass”. Any ideas? Could Dijkstra’s algorithm be modified in order to achieve this?
For the path from A to B that must pass through C, compute it as two shortest paths, one from A to C, and another from C to B.