Elixir.ExDoc.Formatter.HTML
eastar v0.4.2 → Overview → Astar

Astar

A* graph pathfinding.

Summary

astar(env, start, goal)

Find path between two vertices in a directed weighted graph

Types

vertex :: any

nbs_f :: (vertex -> [vertex])

distance_f :: (vertex, vertex -> non_neg_integer)

env :: {nbs_f, distance_f, distance_f}

Functions

astar(env, start, goal)
(function) # ↑

Specs:

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