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.
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.
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...