3 packages returned for Tags:"Breadth-first"

Lightweight generic Graph implementation in C#

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

ImVader is a framework for working with graphs. It provides implementation of common graph algorithms: BFS, DFS, Dijkstra and Floyd-Worshell algorithms, topological sort, computing strong components, finding minimum cuts and others.