搜索资源列表
5
- 有关深度优先的课件，很详细，很强大，很好的学习资料，献给大家了！-Courseware on depth-first, very detailed, very powerful, very good learning materials, dedicated to all of you!
youxiangtu
- C++语言下的有向图深度优先搜寻和广度优先搜索-C++ language under the directed graph depth-first search and breadth-first search
DFS
- 深度优先搜索算法，代码简单易懂，对于初学者很容易理解-Depth-first search algorithm, the code easy to understand, easy to understand for beginners
EightNumber
- 采用有界深度优先搜索算法求解八数码难题，代码简单易懂-Using bounded depth-first search algorithm for Eight puzzle, the code easy to understand
commonapproachtogiveprioritytosearch
- 这是数据结构中一些常用的方法，主要讲的是深度优先探索，希望能给大家答疑解惑-This is the data structure of some commonly used methods, mainly talking about the depth-first exploration, hope that they can FAQ
2
- 最短哈密尔顿回路，分支界限法，递归调用，深度优先-The shortest Hamilton circuit, branch and bound method, the recursive call, depth-first
1
- 最短哈密尔顿图，穷举法，递归调用， 深度优先查找-The shortest Hamiltonian, brute-force method, the recursive call, depth-first search
graphoperation
- 根据从键盘输入的数据创建图（图的存储结构可采用邻接矩阵或邻接表），并对图进行深度优先搜索和广度优先搜索（实验类型：验证型） 1）问题描述：在主程序中提供下列菜单： 1…图的建立 2…深度优先遍历图 3…广度优先遍历图 0…结束 2）实验要求：图的存储可采用邻接表或邻接矩阵；定义下列过程： CreateGraph(): 按从键盘的数据建立图 DFSGrahp()：深度优先遍历图 BFSGrahp()：广度优先遍历图-According to dat
graph
- 图子系统实验，定义了图的存储结构，以及队列操作。包括邻接矩阵，深度优先遍历，以及广度优先遍历-Figure subsystem test, defines the memory structure map and queue operations. Including the adjacency matrix, depth-first traversal and breadth-first traversal
DFS3
- 我自己用matlab写的深度优先算法，能够实现任意选择起色访问点进行访问的DFS算法-Matlab write my own use depth-first algorithm, to achieve any improvement in access point choose to visit the DFS algorithm
DFS
- Depth First Search program
Project1
- Breadth first search and Depth first search
DFSTraverse
- 是本科计科专业数据结构的实验之一，实现深度优先遍历-Total undergraduate experimental subjects of professional data structure to achieve depth-first traversal
graohliantong
- 利用深度优先遍历，判断无向/有向图的连通性的程序。-Using depth-first traversal to determine undirected/directed graph of the connectivity process.
eight-number
- 八数码的三种解法：A算法，广度优先，深度优先-Three Solutions to eight digital: A algorithm, breadth-first, depth first
syndiastikhbeltistopoihshaskisi
- DFS CODE Depth-first search algorithm Matlab source this procedure site collected from abroad, is the standard depth-first search algorithm, can be achieved and the detection circuit node traversal functions, details see the original English Notes I
skode
- 自己用c++编写的计算数独的程序。使用枚举法，深度优先搜索得出结果。不能判断是否有多解。适合初级程序员参考。-Their written using c++ calculate the number of separate procedures. Enumeration method used, the outcome of depth-first search. Can not determine whether the multiple solutions. Junior programme
DFSTest
- 深度有限搜索，数据结构中，深度优先算法的代码实现-Limited depth searching, data structures, depth-first algorithm code
IDS
- 基于迭代深入深度优先搜索算法实现八数码问题-Depth based on depth-first search iterative algorithm Eight Puzzle Problem
search-file
- 2． 设计一个程序，实现文件查找。文件查找操作是一项非常基本的操作，一般的文件查找操作采用递归算法，实际上是采用“深度优先”的策略。请设计一个基于“广度优先”算法的文件查找程序。 提示：由于要找的文件往往距离待查文件夹最近的文件加中。因此，基于“广度优先”算法的文件查找的效率会优于“深度优先”算法。可以将待搜索的文件夹放入一个队列，然后列出该文件夹下所有成员：如果是文件，则与查找条件进行匹配；如果是文件夹，则将其放入队列。在次从队列头取文件夹，执行同样逻辑，直到队列为空。 - De