21 packages returned for Tags:"DFS"

Package type
Sort by
Options
  • 25,869 total downloads
  • last updated 5/29/2019
  • Latest version: 1.0.17
  • maze dfs
Library to create simple Mazes
  • 3,636 total downloads
  • last updated 2/11/2018
  • Latest version: 1.1.1
  • Zaaby Zaabee DFS
The interfaces and base classes of distributed file system for asp.net core or Zaaby Framework.
  • 1,281 total downloads
  • last updated 8/7/2020
  • Latest version: 18.1.0
  • DHI MIKE DFS
DFS is the DHI Data File System, a binary data file format for handling spatially distributed and time dependent data, ranging from measurements of temperature at a single point, to water levels in entire oceans. This Package targets both .NET and native C/C++ projects, i.e. it contains C/C++... More information
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...
Package contains utilities for graph traversal. You can use this package in your project to traverse the graph in BFS and DFS manner.
Graph traversal algorithms: DFS, BFS. Commonly used types: InstantDfs<TGraph, TVertex, TEdge, TEdgeEnumerator, TColorMap, TGraphPolicy, TColorMapPolicy> EnumerableBfs<TGraph, TVertex, TEdge, TEdgeEnumerator, TExploredSet, TGraphPolicy, TExploredSetPolicy>
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.