Which is faster? A* or Dijkstra?
A* and Dijkstra's algorithms are both used to find the shortest path between two nodes in a graph. A* is a variation of Dijkstra's algorithm that uses a heuristic function to prioritize nodes that are likely to be better than others. Dijkstra's algorithm, on the other hand, explores all possible paths. A* is considered a "best first search" algorithm because it chooses which vertex to explore next based on the value of f(v), which is calculated as h(v) + g(v). In this equation, h is the heuristic and g is the cost so far. A* is faster than Dijkstra's algorithm because it uses best-first-search.
For the betterment of the knowing and understanding ytvideo SOURCE :- Anthony madorsk.