graph/astar_utils library

A* shortest path with pluggable heuristic — roadmap #534.

Functions

astar(WeightedAdjacency graph, int start, int goal, double heuristic(int node)) → List<int>?
A* from start to goal. heuristic must be admissible (never overestimate). Returns path from start to goal (empty if not found), or null if no path.