A fast 2D path finding library based on the A* algorithm. Works with both grids and graphs. Supports any .NET variant that supports .NETStandard 2.0 or higher. This library has no external dependencies. The library is licensed under the MIT license.
Hi, is it possible to take the size of the agent into account? For actually making sure the object which follows the path gets through the narrow gaps. For simplicity the object could be considered as circle with radius in cells (default 1, but 2, 3, 4, etc. also possible).
Hi, is it possible to take the size of the agent into account? For actually making sure the object which follows the path gets through the narrow gaps. For simplicity the object could be considered as circle with radius in cells (default 1, but 2, 3, 4, etc. also possible).