Astar
Summary↑
| astar(env, start, goal) | A* path finding |
Types ↑
vertex :: any
distance_f :: (vertex, vertex -> non_neg_integer)
env :: {nbs_f, distance_f, distance_f}
Functions
Specs:
A* path finding.
env- a graph "environment" - the tuple{nbs, dist, h}where each element is a function:nbs- returns collection of neighbor vertices for a given vertexdist- returns edge cost between two neighbor verticesh- returns estimated cost between two arbitrary verticesstart- starting vertexgoal- vertex we want to reach