A*or A-star is an
the algorithm in which we traverse the graph and search for the best shortest path
from the start vertex to goal, ex: Google Map, it is the combination of both BFS and Best
search algorithm,
To
calculate the best-shorted path we do use weight (Heuristic Value) and cost of
the path.
A heuristic Value is a rough guess that's used when
the actual information isn't available
A*or A-star algorithm is often used in computer science due to its completeness, optimal efficiency, and guaranteed result.
In spite
of one major practical drawback is its space complexity, as it stores all generated nodes in its
memory, but it is the most successful search algorithms to find the shortest path between vertexes.
Example :
0 Comments