I can not understand the difference between generation and expansion of nodes. How the time and space complexity of BFS are different in each two scenarios?

    Test at generation: 1+b+b2+...+b^d=O(b^d)

    Test at expansion: 1+b+b2+...+b^d+(b^d−1)b=O(b^d+1) 
  • $\begingroup$ Could you please describe the algorithms for so-called "generation" and "expansion"? $\endgroup$ – xskxzr Jun 3 '18 at 13:43

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Browse other questions tagged or ask your own question.