eastar
by wkhere
A* graph pathfinding in pure Elixir
AI summary
Pathfinder
An algorithm for finding the shortest path in a graph
- stars
- 32
- forks
- 6
- watching
- 3
- awesome list
- 1
Similar projects
Found by comparing what the projects do, not just their names.
Pathfinder
A fast and efficient algorithm for finding the shortest path in a grid-based environment using ActionScript 3
Pathfinder
A pathfinding library for generating efficient routes on a grid or map
Pathfinder
Efficient shortest path calculation algorithm
Pathfinder
A pathfinding algorithm designed for 2D games with obstacles mapped to rectangular cells.
Pathfinder
An asynchronous A* pathfinding API written in Javascript.
Pathfinder
An implementation of the A* pathfinding algorithm
Pathfinder
A pathfinding solution in GameMaker that uses Dijkstra's algorithm to find the shortest path between two points in a weighted graph
Pathfinder
A flexible A"* search algorithm-based pathfinding interface for tile-based maps.
Pathfinding Demo
A WebAssembly-based A* pathfinding implementation for a maze demo
Path optimizer
A tool that uses graph contraction hierarchies to speed up shortest path calculations on OpenStreetMap data
Pathfinder
A pathfinding node for the Godot game engine that enables efficient computation of shortest paths in large graphs
Pathfinder
A minimal implementation of the A* pathfinding algorithm in C, suitable for small maps.
Pathtracer
A multithreaded spectral pathtracer implementing the algorithm of linear combination of bases for rendering with sRGB reflectance
Grid navigator
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
Pathfinding library
An implementation of the A* search algorithm in Go
Featured in 1 awesome list
Each link jumps to the spot where the list mentions eastar.
