This is a necessary trade-off for using a specific-goal-directed heuristic. For Dijkstra’s algorithm, since the entire shortest-path tree is generated, every node is a goal, and there can be no ...