If path lengths can be easily lower bounded, we can use this information to guide the search.
An admissible heuristic h is a function that gives a guaranteed lower bound on the distance from any node u to the destination t. Natural example: straight-line distance (at maximum speed) to t.
