Which type of best first search algorithm was used to predict the closeness of the end of path and its solution?
(a) Greedy BFS
(b) Divide and Conquer
(c) Heuristic BFS
The question was posed to me in an interview.
My question is based upon Graph Search topic in portion Graph Search of Data Structures & Algorithms II