We know that if the heuristic function in A* is good enough, then A* can always find a shortest weighted path between two vertices, and is generally much faster than Dijkstra. Assume we are using a...

We know that if the heuristic function in A* is good enough, then A* can always find a shortest weighted path between two vertices, and is generally much faster than Dijkstra. Assume we are using a graph where a good heuristic function is well defined for A*, such that A* can always find the same shortest paths as Dijkstra. Briefly explain when you should choose Dijkstra over A* in this case.