Vidyalelo
Data Structure · Q85

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 85

Q85

Which type of best first search algorithm was used to predict the closeness of the end of path and its solution?

A.
Greedy BFS
Answer
B.
Divide and Conquer
C.
Heuristic BFS
D.
Combinatorial

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board