Simple A* (A-Star) library. Simply define your problem space, then traverse it. Supports multi-threaded traversal.
Optimized for heavy node expansion calculations rather than node quantity.
For examples, see github project.
Generic implementation of A* pathfinding algorithm for which you can provide different implementations of Distance Calculation algorythms, neighbor/space topology provider, pathable nodes provider, and struct representing node coordinates.
A simple to use collection of various path finding algorithms.
Includes a A*, Breadth-First, and Greedy graph traversing path finding implementations.
Currently a work in progress and API's may change until version 1.