Lightweight A* Pathfinding

This simple-to-use, yet robust pathfinder is a must-have for navigating any graphed elements.
Just implement 1 method to find the neighbors of a given node, and you're done! Or make use of a variety of helper methods to add functionality, such as
1) Performing an action on all path nodes (or all nodes within a range) 2) Modifying weight of a path between nodes based on criteria of your design 3) Quitting early given some condition of a node
It's not limited to 2D grids, either - it can navigate 3D elements, or even non-visual graphs - anything that has a concept of adjacency or distance between elements!
Check out the demo scene for an example of its features, or see the README for instructions on how to incorporate this lightweight pathfinder into your game.