Can I speed up a shortest path computation by running dijkstra algorithms simultaneoulsy forward and backward?
-
One algorithm would run from the origin to the destination and the other from the destination backward to the origin. Follow-up questions are: 1. How can the overall algorithm determine when to stop? 2. How should the algorithm identify the shortest path? 3. How much faster would this algorithm be than computing in one direction?
-
Answer:
Excellent questions. If you think about them awhile and try a few runs at the program I am sure you will come up with the answers.
Ron G at Yahoo! Answers Visit the source
Related Q & A:
- How many hours a week can I work as a minor in California?Best solution by lni.wa.gov
- How can I hook up a Dual Tuner dvr to a second tv?Best solution by Yahoo! Answers
- How can I speed up my wireless connection????Best solution by Super User
- How can I speed up a download?Best solution by Yahoo! Answers
- What can I take on a plane and what can't I?Best solution by Yahoo! Answers
Just Added Q & A:
- How many active mobile subscribers are there in China?Best solution by Quora
- How to find the right vacation?Best solution by bookit.com
- How To Make Your Own Primer?Best solution by thekrazycouponlady.com
- How do you get the domain & range?Best solution by ChaCha
- How do you open pop up blockers?Best solution by Yahoo! Answers
For every problem there is a solution! Proved by Solucija.
-
Got an issue and looking for advice?
-
Ask Solucija to search every corner of the Web for help.
-
Get workable solutions and helpful tips in a moment.
Just ask Solucija about an issue you face and immediately get a list of ready solutions, answers and tips from other Internet users. We always provide the most suitable and complete answer to your question at the top, along with a few good alternatives below.