19 packages tagged with “A*”
MiNET A* version with performance improvements for Minecraft use.
A* path finding implementation
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
Graph search algorithms that work against any graph type implementing the interfaces defined in SCGraphTheory.Abstractions.
Yet another library to manage hexagonal grids. For docs and usage examples please see the GitHub repo.
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.
Library for path finding with A*. Also for grids.
Simple implementation of AStar alghorithm. For more examples concerning How to use it check out github page.
.Net implementation of the A* path finding algorithm.
A simple but flexible implementation of the A* (A-Star) pathfinding algorithm for .NET Standard.
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
Implementation of A* algorithm for robot pathfinding
A* implimentation by josh wilbanks
MoreStructures is a library of classical algorithms and data structures, written 100% in (safe, managed) C# 10, for .NET 6 and above. Data structures - Stacks, Queues, Priority Queues, Disjoint Sets, Trees, Graphs, Suffix Trees, Suffix Tries. Algorithms - Strings sorting and matching. Lists searching and sorting. Trees augmentation and visit. Graphs: visits, minimum spanning tree, shortest distance, shortest path, topological sorting, strongly connected components. Suffix Trees and Tries construction and matching.