This package provides a simple and efficient pathfinding solution for 2D games. It uses the A* algorithm with a heap-optimized priority queue to quickly find paths on grid-based maps. The package supports both rectangular and hexagonal grids, weighted tiles, and obstacles, making it suitable for strategy games, RPGs, and AI-driven navigation. With this package, you can find paths with just two lines of code.
The package includes source code and supports features such as rectangular and hexagonal grids, obstacles, and weighted tiles. It is optimized for performance and provides a simple and easy-to-use API.
