Which of the following can traverse the state space tree only in DFS manner?
(a) branch and bound
(b) dynamic programming
(c) greedy algorithm
I got this question during a job interview.
I would like to ask this question from Graph Search in chapter Graph Search of Data Structures & Algorithms II