Abiblo Computer Science - A* Algorithm
A*algorithm belong to a member of the best first heuristic search technique class which attempted to identify the best path from a start node to a designated goal node mostly in the case of problem graph.
The cost of distance ( unknown) from the current node to the goal is estimated using the evaluation function which later added to the known cost of the shortest path from the start node to current node which provides a figure of merit for the current node.
Based on each iteration, the search is pursued by using the node with the best cost figures. The mixture of depth first and breadth first will constitute a behaviour which is displayed based on the operation of the algorithm.