21 packages returned for Tags:"dfs"

QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net, Silverlight, Windows Phone and Win 8. QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning... More information

QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net

Correct QuickGraph version for projects such as GraphX that use cross-platform PCL libraries. QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net, Silverlight, Windows Phone and Win 8. QuickGraph comes with algorithms such as depth first seach,... More information

Library to create simple Mazes

QuickGraph provides generic directed/undirected graph data structures and algorithms for .Net, Silverlight, Windows Phone and Win 8. QuickGraph comes with algorithms such as depth first search, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum... More information

The interfaces and base classes of distributed file system for asp.net core or Zaaby Framework.

FastDFS client wrapper for asp.net core or Zaaby

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...

文件系统，支持本地目录和分布式方式

Mongo repository for the FastDFS

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: BFS, DFS. Commonly used types: • GenericSearch<TGraph, TVertex, TEdge, TEdgeEnumerator> • EnumerableBfs<TGraph, TVertex, TEdge, TEdgeEnumerator>, EnumerableDfs<TGraph, TVertex, TEdge, TEdgeEnumerator> • EagerBfs<TGraph, TVertex, TEdge, TEdgeEnumerator>, EagerDfs<TGraph,... More information

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.

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...

General purpose data structures and algorithms mostly to cover the functionallity or performance gap in the framework. Includes: ProrityQueue, Bag, SymboleTable, Trie, UnionFind, Search Trees (BST, OST, RBT), sorting and graph algorithms.

A Graph data structure that supports Breadth First Search and Depth First Search

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...