Generic A* algorithm for node.js
JavaScript
69
18
No license
This is a generic implementation of the A* search algorithm for Node.js, designed to find the shortest path between nodes in a graph. It's suitable for developers building applications that require pathfinding capabilities, such as game AI, network routing, or maze solvers. The library accepts customizable options for node representation, neighbor discovery, distance calculation, and heuristic functions, making it flexible for various use cases.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of superjoe30/node-astar
sets in javascript
A lightweight but safe dictionary, for when Object won't cut it
binary heap (priority queue) algorithms (ported from Python's heapq module)
Support the repos that depend on this repository
Top contributors
andrewrk
21 contributions
dominictarr
1 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet
