basic graph search algorithm takes all neighbors of a top node and adds them all back to the todo queue, sorted by the distance to the query. this implies many expensive distance calculations.

there are heuristics that precalculate directions to neighbors and first use neighbors that are in the same direction as the query. HCNNG does that.