A* algorithm vs uninformed search -
in case a* algorithm becomes same uninformed searching algorithm.
a* search algorithm decays dijkstra's algorithm admissible heuristic function h(v) = 0
v
, since in case f(v) = g(v) + h(v) = g(v) + 0 = g(v)
, , chose best first. pretty equivalent dijkstra's algorithm.
for unweighted graph, dijsktra's algorithm variant of bfs, can (a*) decays bfs in unweighted graphs h(v) = 0
.
Comments
Post a Comment