Pathfinding - What is the difference between A * and Dijkstra's?

Although A* is similar to Dijkstra's algorithm, it differs in that it uses a heuristic function to give priority to nodes that are thought to provide better pathways. Alternatively, Dijkstra's traverses all possible routes.