A* is a pathfinding algorithm based on Dikjstra. It computes one of the best path to reach two nodes in a graph.