returned for Tags:"depth-first"
Lightweight generic Graph implementation in C#
Provides Tree-Based Search algorythms such as Depth-First, Breadth-First, Iterative-Deepening and NegaMax
Graph search algorithms that work against any graph type implementing the interfaces defined in SCGraphTheory.Abstractions.
Basic data structures in C# convenient for many applications.
Currently contains only trees and ordered trees.