The A-Star algorithm is a path-finding method that finds the shortest path between the beginning and end states. It is used for a variety of purposes, including maps, where it helps to find the shortest distance between a source (initial state) and a destination (final state) (final state). Like the Dijkstra method, the A-Star search algorithm creates the lowest-cost path tree from the start node to the goal node.