Link to this section Summary

Types

env()

nbs_f()

Find path between two vertices in a directed weighted graph.

distance_f() :: (vertex(), vertex() -> non_neg_integer())

env() :: {nbs_f(), distance_f(), distance_f()}

nbs_f() :: (vertex() -> [vertex()])

vertex() :: any()

astar(env(), vertex(), vertex() | (vertex() -> bool())) :: [vertex()]

Find path between two vertices in a directed weighted graph.

env - a graph "environment" - the tuple {nbs, dist, h} where each element is a function:
- nbs - returns collection of neighbor vertices for a given vertex
- dist - returns edge cost between two neighbor vertices
- h - returns estimated cost between two arbitrary vertices
start - starting vertex
goal - vertex we want to reach, or a function of arity 1 to check if current vertex is a goal