5 packages returned for Tags:"breadth-first"

Lightweight generic Graph implementation in C#

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

Provides Tree-Based Search algorythms such as Depth-First, Breadth-First, Iterative-Deepening and NegaMax

Basic data structures in C# convenient for many applications. Currently contains only trees and ordered trees.

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.