search is an informed search algorithm that combines the advantages of _______ and _______ search algorithms.

  • Breadth-first, Depth-first
  • Breadth-first, Dijkstra's
  • Greedy, Depth-first
  • Greedy, Dijkstra's
A* search combines the advantages of the Greedy algorithm, which prioritizes nodes based on a heuristic, and Dijkstra's algorithm, which ensures the shortest path. This combination allows A* to efficiently find the optimal path by considering both the heuristic information and the actual cost of reaching the node.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *