Is it possible to do a breath first search using only (size of graph) + a constant amount of memory — in other words, without recording which nodes have already been visited?
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.
Is it possible to do a breath first search using only (size of graph) + a constant amount of memory — in other words, without recording which nodes have already been visited?
No. You always need to remember where you have visited. In the worst case, therefore, you need to record the visited state of all nodes. However, the branching factor and depth of the graph are the main factors. If the graph doesn’t branch a lot, you won’t need anything like that. If it is highly branching, you tend to the worst case.