2 ms·
An example for those not in the know: to find a shortest route on a realworld map, an admissible heuristic would be that the minimum travel distance between two
by superjan 2y ago
An example for those not in the know: to find a shortest route on a realworld map, an admissible heuristic would be that the minimum travel distance between two nodes will be a straight line. While examining options, A* takes this into account, Dijkstra does not.