Graph Search on Data Structure and Algorithms related Questions and Answers


Question :   Which type of best first search algorithm was used to predict the closeness of the end of path and its solution?
1. Greedy BFS
2. Divide and Conquer
3. Heuristic BFS
4. Combinatorial
5.
Answer :   1 - Greedy BFS  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter