24 packages tagged with “AStar”
MiNET A* version with performance improvements for Minecraft use.
Portable NuGet library/package for navigating on a tile-based 2-dimensional raster/matrix.
The core library for the pathfindax pathfinding framework
A lightweight, 2D A* (A Star) algorithm.
Plugin that makes it easier to use pathfindax with duality
Plugin that makes it easier to use pathfindax with duality tilemaps
A* algorithm written in C#, used with LINQ expressions.
Re-usable and immutable AStar Search implementation
Dijstra and Astar Path Finding
A simple but flexible implementation of the A* (A-Star) pathfinding algorithm for .NET Standard.
This is a small library that implements a meldable priority queue and a generalizable A* search algorithm on top of that. The performance is good. It targets PCL profile 111.
An implemenation of AStart path finding for hexagonal maps.
Simple implementation of AStar alghorithm. For more examples concerning How to use it check out github page.
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.
Algorithms related to graphs. Contains DepthFirstSearch, BreadthFirstSearch, Astar
A package to help consume the API Usage endpoint without duplicating code.
Unsafe implementation of AStar algorythm
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.
Javascript Astar (javascript-astar) binding library for Bridge.NET projects.
Pathfinding library: A-star and 2D subgoal pathfinding
High-performance, memory-efficient A* pathfinding implementation for grid-based environments with minimal garbage collection overhead
AMath.Algorithms is a library from AMath (Advanced Math) library groups. It includes the fastest and most popular algorithms to find shortest route and etc.
A* implimentation by josh wilbanks