eastar
Pathfinder
An algorithm for finding the shortest path in a graph
A* graph pathfinding in pure Elixir
32 stars
3 watching
6 forks
Language: Elixir
last commit: 9 months ago
Linked from 1 awesome list
astar-algorithmelixirgraph-algorithmsgraph-pathfinding
h4cc/awesome-elixirRelated projects:
| Repository | Description | Stars |
|---|---|---|
 tomnewton/as3astar | A fast and efficient algorithm for finding the shortest path in a grid-based environment using ActionScript 3 | 21 |
 hypersurge/pathfinder | A pathfinding library for generating efficient routes on a grid or map | 27 |
 easbar/fast_paths | Efficient shortest path calculation algorithm | 271 |
 albert-dang/a-star-pathing | A pathfinding algorithm designed for 2D games with obstacles mapped to rectangular cells. | 7 |
 prettymuchbryce/easystarjs | An asynchronous A* pathfinding API written in Javascript. | 1,893 |
 dev1an/a-star | An implementation of the A* pathfinding algorithm | 39 |
 gmclan-org/dijkstra-graph | A pathfinding solution in GameMaker that uses Dijkstra's algorithm to find the shortest path between two points in a weighted graph | 4 |
 kevhiggins/a-star_pathfinder | An A">*</span> search algorithm implementation for pathfinding in tile-based maps. | 3 |
 jacobdeichert/wasm-astar | A WebAssembly-based A* pathfinding implementation for a maze demo | 427 |
 stunkymonkey/osm_ch | A tool that uses graph contraction hierarchies to speed up shortest path calculations on OpenStreetMap data | 17 |
 matejsloboda/dijkstra_map_for_godot | A pathfinding node for the Godot game engine that enables efficient computation of shortest paths in large graphs | 78 |
 felselva/uastar | A minimal implementation of the A* pathfinding algorithm in C, suitable for small maps. | 112 |
 geometrian/simple-spectral | A multithreaded spectral pathtracer implementing the algorithm of linear combination of bases for rendering with sRGB reflectance | 188 |
 azakhary/as3pathfinder | A Grid Path finding Library written in ActionScript 3 that finds the shortest route from start point to end on a 2D grid with obstacles using Dijkstra's algorithm | 17 |
 beefsack/go-astar | An implementation of the A* search algorithm in Go | 601 |