Pathfinding

Pathfinding algorithms

conrex

9.2

An implementation of the CONREC contouring algorithm, described at <http://paulbourke.net/papers/conrec/>.

Popularity

Stargazers
54
Watchers
3
Forks
1

Downloads

Yesterday
0
Last 7 days
20
All Time
73

Activity

Open Issues
0
Open PRs
0
Merged PRs
1

Releases

Latest Version
1.0.0
Last Update
November 17, 2020

eastar

5.9

Eastar is a pure-Elixir implementation of A* graph pathfinding algorithm.

All graph environment, like nodes connectivity, distance & H-metric are abstracted away - you provide them as functions.

Popularity

Stargazers
29
Watchers
2
Forks
6

Downloads

Yesterday
3
Last 7 days
275
All Time
5,924

Activity

Open Issues
0
Open PRs
0
Merged PRs
3

Releases

Latest Version
0.5.1
Last Update
September 02, 2019