https://github.com/wkhere/eastar

A* graph pathfinding in pure Elixir
https://github.com/wkhere/eastar

astar-algorithm elixir graph-algorithms graph-pathfinding

Last synced: about 2 months ago
JSON representation

A* graph pathfinding in pure Elixir

• Host: GitHub
• URL: https://github.com/wkhere/eastar
• Owner: wkhere
• License: bsd-2-clause
• Created: 2013-11-12T15:58:39.000Z (over 10 years ago)
• Default Branch: master
• Last Pushed: 2024-03-10T22:19:14.000Z (3 months ago)
• Last Synced: 2024-04-14T04:07:57.063Z (2 months ago)
• Topics: astar-algorithm, elixir, graph-algorithms, graph-pathfinding
• Language: Elixir
• Homepage:
• Size: 108 KB
• Stars: 30
• Watchers: 3
• Forks: 6
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Changelog: CHANGELOG.md
  • License: LICENSE

Lists

• awesome-elixir - eastar - A* graph pathfinding in pure Elixir. (Algorithms and Data structures)

README

        
eastar

======

[![Build Status](https://travis-ci.org/wkhere/eastar.svg?branch=master)](https://travis-ci.org/wkhere/eastar)

[![Coverage Status](https://coveralls.io/repos/github/wkhere/eastar/badge.svg?branch=master)](https://coveralls.io/github/wkhere/eastar?branch=master)

[![hex.pm version](https://img.shields.io/hexpm/v/eastar.svg)](https://hex.pm/packages/eastar)

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*.

### usage

API is described at [hexdocs](http://hexdocs.pm/eastar/).

Look at examples and tests to see how the graph environment can be set up.

Enjoy!

[A\*]:      http://en.wikipedia.org/wiki/A*_search_algorithm