Pure Elixir implementation of A* graph pathfinding.
This version aims to be as generic as possible, abstracting away the graph environment: nodes connectivity, distance & H-metric - you provide them as functions.
If you like some references to the literature, you can think of it as the star of Ea.
API is described at hexdocs.
Look at examples and tests to see how the graph environment can be set up.
Enjoy!