Discussion
What is the memory cost of graph search?
Answer: A
The explored set grows with the number of distinct states visited, which destroys depth first search's linear memory advantage and makes graph search comparable to breadth first in space. Techniques such as storing only a bounded cache trade completeness for memory. Paths are recovered by parent pointers, the space is never enumerated in advance, and successors are computed on demand. Every guarantee in search costs memory, and the accounting is worth doing explicitly.
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