In computer science, A* (pronounced “A star”) is a graph/tree search algorithm that finds a path from a given initial node to a given goal node (or one passing a given goal test). It employs a “heuristic estimate” that ranks each node by an estimate of the best route that goes through that node. It visits the nodes in order of this heuristic estimate. The A* algorithm is therefore an example of best-first search.
See more at Wikipedia.org...
Free Download Now!
