搜索资源列表
AdjList
- a code to use DFS which is achieved with stack to search the map which is stored ine the adjList,this is my first time to practice the map
8_puzzle_solver_2009_10
- AI（人工智能）课程的作业，要求用java语言 随即生成8迷宫问题，然后用dfs解决，请大家参考-AI (Artificial Intelligence) program demands of their workers using java language then generate the eight maze problems, and then use dfs resolved, please refer to the
dfs_image_main
- 图像域上的DFS遍历，函数返回连通域数量，范围端点以及最大值-DFS traversal on the image domain, the function returns the number of connected domains, the scope of the endpoint as well as the maximum value
FastDFS_v1.18.tar
- FastDFS是一个开源的高性能分布式的文件系统, 它的主要功能包括： 文件存储，文件同步，文件存取，还有负载均衡-FastDFS is an open source high performance distributed file system (DFS). It s major functions include: file storing, file syncing and file accessing, and design
dfs
- BFS IMPLEMENT OF GRAPH
BFSDFS
- Simple an example for BFS and DFS search
dfsorigin
- DFS in Matlab, Depth First Search
graph
- 该压缩文件中包含了图论当中的一些重要算法，包括前序中序和后序遍历、最小二叉树、DFS、BFS以及拓扑排序。-The compressed file contains a graph theory among a number of important algorithms, including the former order in the order and postorder traversal, the smallest bina
basicoperationformap
- 包括了图的大部分基本算法，每一种算法都以邻接矩阵与邻接表两种形式给出，算法包括建图，图的遍历（如DFS和BFS），最小生成树，从某个源点到蓁各顶点的最短路径等-Includes most of the basic graph algorithms, each algorithm is to adjacency matrix and adjacency list is given in two forms, algorithms, inc
Chess(8puzzle)
- 这个程序是从广度优先搜索,深度优先搜索,A算法以及A算法等多方面算法来解决八数码问题.zip-8-puzzle A* BFS DFS MFC
dfs
- 深度优先搜索算法DFS的实现，1.如果有可能，访问一个领接的未访问的节点，标记它，并把它放入栈中。 2 当不能执行规则 1 时，如果栈不为空，则从栈中弹出一个元素。 3 如果不能执行规则 1 和规则 2 时，则完成了遍历。-Depth-first search algorithm DFS implementation, 1. If possible, visit a collar then outstanding access node
MY_DFS
- DFS is an uninformed search that progresses by expanding the first child node of the search tree that appears and thus going deeper and deeper until a goal node is found, or until it hits a node that has no children. The
SUDOKU
- Sudoku game + solver written in c# (using dfs with bit s magic)
DFs
- 深度优先搜索求格雷码，可以实现多组数据的输入-Gray code depth first search request
DFS
- DFS算法的非递归函数。DFS是求树的深度的深度优先算法-DFS algorithm of non-recursive function. DFS is seeking the depth of the tree depth-first algorithm
DSF.v9.15
- DFS Delphi components
java_code_of_algorithms
- 各种数据结构算法的java代码实现，包括选择排序、快速排序、分区算法、dfs、mst等18个算法的java代码。-Various data structure algorithms java code to achieve, including the selection sort, quick sort, partition algorithm, dfs, mst in 18 algorithm java code.
BFS_DFS
- BFS and DFS algorithm on graph (realization graph)
graphsearch(DFS)
- 根据深度优先搜索原理，用c++编程实现图的遍历，本程序源于对农夫和羊，狼以及蔬菜过河这一经典问题探究。-By c++ programing,we make DFS come ture! DFS means Depth First Search,it is a very impoint measure to reserch the graph.
maze3D
- Source Code OpenGL and Java (JOGL), for generate 3D maze (using DFS algorithm), and you can move a cursor in maze, using your mouse, to find a way out from maze.