This package provides a comprehensive pathfinding solution for 2D grids using the A* algorithm. It includes optimized scripts, documentation, demo scenes, and sample code to help you quickly and efficiently implement pathfinding in your projects. With this package, you can save time and focus on other aspects of your project.
The package offers two pathfinding methods: asynchronous and synchronous. The asynchronous method, GeneratePath(), calculates the path without blocking the main thread, while the synchronous method, GeneratePathSync(), is suitable for cases where blocking is not an issue. It supports both boolean and float cost maps, as well as Euclidean and Manhattan distance heuristics. The pathfinding methods return a list of (x,y) coordinates representing the path from the start to the goal.
