If I have some sort of data structure that I wish to conduct a search on that has a single starting node but multiple goal nodes, can I still use a bi-directional search algorithm?
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.
If I have some sort of data structure that I wish to conduct a search on that has a single starting node but multiple goal nodes, can I still use a bi-directional search algorithm?
Why not? You can think of it in the following manner – add an auxiliary non-existent node that is connected to all the goal nodes with distance zero and then perform bi-directional search between the start node and the new one.
Of course you don’t actually NEED to add this node this was just to illustrate the idea.