18 packages returned for Tags:"a*"

MiNET A* version with performance improvements for Minecraft use.

A* path finding implementation

A lightweight, 2D A* (A Star) algorithm.

The core library for the pathfindax pathfinding framework

Plugin that makes it easier to use pathfindax with duality

Plugin that makes it easier to use pathfindax with duality tilemaps

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.

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.

Yet another library to manage hexagonal grids. For docs and usage examples please see the GitHub repo.

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.

Graph search algorithms that work against any graph type implementing the interfaces defined in SCGraphTheory.Abstractions.

.Net implementation of the A* path finding algorithm.

Library for path finding with A*. Also for grids.

Algorithms related to graphs. Contains DepthFirstSearch, BreadthFirstSearch, Astar

A simple to use collection of various path finding algorithms. Includes a A*, Breadth-First, and Greedy graph traversing path finding implementations. Currently a work in progress and API's may change until version 1.

Implementation of A* algorithm for robot pathfinding