搜索资源列表
Graph
- 基于数据结构（c语言）图的遍历，包括深度优先遍历和广度优先遍历。-Based on data structures (c language) graph traversal, including the depth-first traversal and breadth-first traversal.
DataStructure8
- Java数据结构第七课：图的实现。包括初始化图，添加边，删除边，及深度优先遍历和广度优先遍历算法。-Java Data Structure Lesson: Figure of the implementation. Including the initialization graph, add edge, remove edge, and depth-first traversal and breadth-first traversal algorithm.
DFTravel
- 代码可以实现有向图及无向图的深度优先收缩-Code can achieve a directed graph and undirected graph depth-first contraction
BBB
- 设有一个有向图存储在邻接表中。试设计一个算法，按深度优先搜索策略对其进行拓扑排序。并以右图为例检验你的算法的正确性。-There is a directed graph stored in the adjacent table. Trial design an algorithm, depth-first search strategy by the topology of its sort. And to test your example picture on the right algor
tree
- 题目：生成如下二叉树，并用深度先序遍历输出结果 要求：用程序实现 说明：先生成如下所示的二叉树，然后先序遍历输出其结果：1243576 -Title: Generation as a binary tree, and use the depth first traversing the output requirements: to achieve with the program Descr iption: Mr. into the binary tree as shown
Exp9_DFS
- 用C++编写的深度优先搜索算法，很好很强大-Written in C++, depth-first search algorithm, very very powerful ~ ~ ~
BFS_AND_DFS1
- 该代码为图的深度优先遍历和广度优先遍历，图的存储方式为领接矩阵存储，并且是有向图-The code for the graph depth-first traversal and breadth-first traversal, graph is stored as the leading access matrix storage, and is a directed 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.
TraversingGraph
- 数据结构中的图的遍历问题。 设计一个网络蜘蛛系统，用有向网表示网页的链接网络，其中，顶点表示某个网页，有向弧表示网络之间的链接关系。并且分别以a. 深度优先搜索，b. 广度优先搜索的策略抓取网页。-The graph data structure traversal problem. Design a web spider system, with a link to the web page that network, where vertices a page, there is the
DepthFirstSearch-8Queens
- 回溯法解决八皇后问题，深度优先搜索的一种形式-Back, the eight queens problem, depth-first search
DFS
- A program to find the depth first search on a given graph.It contains a source code, input file and an output file.
eight
- 基于java的八数码，深度优先搜索，gui-Eight java-based digital, depth-first search, gui
Maze
- 用C实现的迷宫求解算法。图形界面，求解过程参照了深度优先搜索，迷宫由随即矩阵生成，采用栈作为路径存储结构。-Achieved with the C maze algorithm. Graphical interface, the process of solving the light of the depth-first search, maze generated by the matrix immediately, using the stack as the path to the st
tt0703
- 搜索算法。无向图的邻接表存储，深度优先搜索-Undirected graph of adjacency table storage, depth-first search
bianli
- 用邻接矩阵确定图 输出深度优先遍历和广度优先遍历的结果-Map with the adjacency matrix to determine the depth first traversal and breadth of the output first traversal of the results
sdyx
- VC6.0实现,深度优先搜索算法,在源码中加入了祥细的注释-Depth-first search algorithm
FiveGame6_1
- 具有人工智能的五子棋游戏，采用流行的深度优先算法，外加Alpha-Beta剪枝，再加历史启发优化，可搜索到第4步-Backgammon game with artificial intelligence, using the popular depth-first algorithm, plus Alpha-Beta pruning, combined with historical inspiration optimized search to Step 4
huarongdao
- “华容道”游戏解法的研究与实现 “华容道”是中国古代传统单人玩的拼板类游戏。虽然以前多次见到报刊、网络有具体解法的报道,但未见到有对此游戏全面的分析和通用局的计算机解法的描述。为此,作者采用改进的非递归深度优先算法对《华容道》通用局的解法进行了全面的分析和论证。随后通过编程实现了这一通用解法,并通过对当前常见的几十个布局进行了测试,从而验证了分析结论及其有效性。-" Huarong" Research and implementation of the game solut
missionariesProblem
- 这是人工智能的一个经典算法，运用深度优先的策略，拥有详细的解释-This is a classic artificial intelligence algorithm, using depth-first strategy, with detailed explanations
sudoku
- C++解数独的代码，使用了三种方法，依次对应解决不同难度的数独，并且最后采用由堆栈为基础数据结构的深度优先搜索法解数独，可以保证解决所有的可解数独。使用了STL的bitset，利用位操作节省内存。-C++ code alone the stops, using three methods, followed by the corresponding number of varying difficulty to solve alone, and Finally the data structur