搜索资源列表
-
0下载：
dfs 深度优先搜索！这是走迷宫的基本算法。用广义表建立迷宫，用邻接表建立图，用dfs搜索，许多大学的数据结构作业-dfs depth-first search! Maze This is the basic algorithm. Generalized Table established maze, with the establishment of the adjacent table map, with dfs search, the University of many data str
-
-
1下载：
学习人工智能作的一个小设计，用VC++6.0来基本实现传教士和野人渡河问题，这个算法是应用深度优先搜索算法。-study artificial intelligence for a small design, VC 6.0 to achieve missionaries and savage river, the algorithm is the use of depth-first search algorithm.
-
-
1下载：
这个程序是从广度优先搜索，深度优先搜索，A算法以及A*算法等多方面算法来解决八数码问题-this procedure is breadth - first search, depth-first search, A and A * algorithm algorithm various algorithms to solve the problem eight digital
-
-
0下载：
包括无向图的深度优先搜索，普里姆算法构造最小生成树，数据结构习题的答案-including undirected graph of the depth-first search, Primbetov tectonic minimum spanning tree algorithm and data structure Exercise answer!
-
-
0下载：
在VC界面上实现深度优先搜索、广度优先搜索的功能，操作简单方便-in VC interface to achieve depth-first search, breadth - first search function is easy and simple
-
-
0下载：
最优路径 深度优先搜索-optimal path depth-first search
-
-
0下载：
用C实现的迷宫求解算法。图形界面，求解过程参照了深度优先搜索，迷宫由随即矩阵生成，采用栈作为路径存储结构-Implemented in C maze solving algorithm. Graphical interface, the solution process with reference to the depth-first search, then the matrix generated by the maze, using the stack as the storage st
-
-
0下载：
试运用深度优先搜索算法寻找过河问题的一个解决方案，题目叙述如下：猎人、狗、男人带着男孩1、男孩2，女人带着女孩1、女孩2，一共8个个体。一艘小船，一次只能过两个个体，狗和四个小孩不会划船。注意：（1）猎人不在，狗咬任何人；（2）男人不在，女人打男孩；（3）女人不在，男人打女孩。-Test the use of depth-first search algorithm to find a solution to cross the river problem, topics are describ
-
-
0下载：
解数独的源码，使用深度优先搜索解决，有可视化的界面，能够很快的解出数独存在的一组解-Sudoku source, using the depth-first search
-
-
0下载：
商人过河问题是数学建模中的一个经典问题，程序利用链表存储渡河状态，使用穷举的算法实现。该算法会找出N个商人/随从渡河的一个可行方案，但并不保证是最佳方案。写完这个程序后让我想到的居然是图的深度优先搜索，二者在查找的思想上是类似的。-Merchants across the river mathematical modeling problem is a classic problem, the use of list storage procedures to cross the river,
-
-
1下载：
编写一个算法程序实现：
1、 用邻接表存储下图：
2、完成对以上图的深度优先搜索，设出发顶点是V1。
-Procedures for the preparation of an algorithm to achieve: 1, with adjacent storage under the map table: 2, completion of the above graph depth-first search, set the start
-
-
0下载：
depth first search is a searching algo
-
-
0下载：
DFS Search in Graph . Depth First Search
-
-
0下载：
此程序从国外网站收集得到，是标准的深度优先搜索算法，可实现节点遍历和检测回路的功能，详细情况请看原英文注释
我在此程序中添加了随机性，即遇到分叉时，随机选下一个节点，成为随机深度优先搜索算法-This procedure has been collected from the foreign website, the standard depth-first search algorithm, can be achieved and the detection circuit node t
-
-
0下载：
这是一个用matlab读取txt（特定格式）文件并读取文件，画出figure，自动保存和关闭figure。程序运用了深度搜索递归算法。（因为大家没有input的txt文件，所以阅读程序领会思想和方法即可）-This is a use matlab to read txt (a specific format) file and read documents, painted figure, on and off automatically to preserve figure. Procedur
-
-
0下载：
标准的深度优先搜索算法，可实现节点遍历、产生随机路由、检测图中是否有回路等功能，-Standard depth-first search algorithm, the node traversal can be achieved, resulting in a random routing, testing whether there is any loop diagram functions
-
-
0下载：
图论编程，包含文件操作，建立图的邻接表，并实现深度优先搜索-Graph theory programming, including file operations, the establishment of plans of the adjacent table, and the depth-first search
-
-
0下载：
DFS
A depth-first search program that avoids cycling.
solve( Node, Solution):
Solution is an acyclic path (in reverse order) between Node and a goal-DFS
A depth-first search program that avoids cycling.
solve( Node, Solution):
So
-
-
0下载：
Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking.
-
-
0下载：
基于C语言的数据结构与算法分析：深度优先搜索-Based on data structures and algorithms in C language analysis: depth-first search
-
