Question: In A* algorithm, if g is equal to 0, it works as A Breadth first search B None of the answers Depth first search D

In A* algorithm, if g is equal to 0, it works as A Breadth first search B None of the answers Depth first search D Best first search
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
