A* search algorithm - Wikipedia
https://en.wikipedia.org/wiki/A*_search_algorithm
WebA* (pronounced "A-star") is a graph traversal and pathfinding algorithm, which is used in many fields of computer science due to its completeness, optimality, and optimal efficiency. Given a weighted graph, a source node and a goal node, the algorithm finds the shortest path (with respect to the given weights) from source to goal.
DA: 28 PA: 3 MOZ Rank: 71