15 packages returned for Tags:"BFS"

Package type
Sort by
Options
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...
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...
Graph traversal algorithms: DFS, BFS. Commonly used types: • Bfs<TGraph, TEdge, TEdgeEnumerator> • Dfs<TGraph, TEdge, TEdgeEnumerator> • InstantDfs<TGraph, TVertex, TEdge, TEdgeEnumerator, TColorMap, TColorMapPolicy> • IDfsHandler<TGraph, TVertex, TEdge>
Package contains utilities for graph traversal. You can use this package in your project to traverse the graph in BFS and DFS manner.
Single code to rule them all. Library to solve puzzles 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 puzzle, written in any .NET language, and get back the steps that reach the solution.