Algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles)
Path finding in a graph
Graph data structure with path finding and traversing algorithms
A simple implementation of A* Pathfinding algorithm for sensory type ninjas.
A simple undirected graph that allows for finding the shortest path between nodes via Dijkstra's algorithm
Loads package.json, by finding the first directory with a package.json, recursing up, starting with the given directory.
mineflayer plugin which adds 3d pathfinding
Parses grid path finding benchmark data
Algorithm for finding shortest and widest paths in a weighted graph