Which of the following branch and bound strategy leads to breadth first search?
(a) LIFO branch and bound
(b) FIFO branch and bound
(c) Lowest cost branch and bound
(d) Highest cost branch and bound
This question was addressed to me in an interview for job.
My question comes from Graph Search topic in portion Graph Search of Data Structures & Algorithms II