Discussion
What is bidirectional search?
Answer: D
Running two searches that meet in the middle replaces one search of depth d with two of depth d over two, reducing the node count from b to the d down to twice b to the d over two. For b of ten and d of six that is a thousand nodes instead of a million. Bidirectional edges, strategy alternation and parallel problems are different notions. Halving an exponent is a far larger saving than any constant factor improvement.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development