12 packages returned for Tags:"BFS"

QuickGraph provides generic directed/undirected graph datastructures and algorithms for .NET Standard 2.0 QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc...
Single code to rule them all. Library to solve problems/games whose solution is based on a tree search, such as: N-Puzzle, Unblock Me, Sokoban, maze solving, Rubik's Cube, etc. Provide a description for the problem/game, written in any .NET language, and get back the steps that reach the solution.
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.