搜索资源列表
maze dfs
- 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
DFS※Prim
- 用普里姆(Prim)算法构造最小生成树；图的DFS算法的非递归遍历函数。-with Primbetov (PRIM), the minimum spanning tree algorithm constructs; Map of the DFS non - recursive algorithm traversal function.
dfs的程序
- DFS的程序 VC++编写的 保存为TXT格式
graph
- 图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法DFS BFS 图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法DFS BFS-Adjacency list graph representation of source storage This is a computer algorithm based on graph theory such as the basic algorithm DFS BFS graph adjacency li
shixiantudebianli
- MatToList(MGraph g,ALGraph *&G)：将邻接矩阵g转换成邻接表G。 ListToMat(ALGraph *G,MGraph &g)：将邻接表G转换成邻接矩阵g。 DispMat(MGraph g)：输出邻接矩阵g。 DispAdj(ALGraph *G)：输出邻接表G。 DFS(ALGraph *G,int v)：以递归的方法从顶点v深度优先遍历图G。 =
DFS
- 标准的深度优先搜索算法，可实现节点遍历、产生随机路由、检测图中是否有回路等功能，-Standard depth-first search algorithm, the node traversal can be achieved, resulting in a random routing, testing whether there is any loop diagram functions
DFS
- 图论编程，包含文件操作，建立图的邻接表，并实现深度优先搜索-Graph theory programming, including file operations, the establishment of plans of the adjacent table, and the depth-first search
DFS
- DFS算法的非递归函数。DFS是求树的深度的深度优先算法-DFS algorithm of non-recursive function. DFS is seeking the depth of the tree depth-first algorithm
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.
DFS
- Use DFS algorithm to show all file and directries
main
- Dijkstra and DFS. It finds all the shortest ways from one point to all others. Then it counts all the ways which is always coming to the destiny.
dfs
- this code for dfs in c-this code for dfs in c++
dfs-bfs
- 简单的图的深度搜索和广度搜索，适合初学者交流-a simple example of DFS and BFS
DFS
- DFS algorithm c++ code
DFS
- DFS图形算法的一种实现，供初学者参考。-The DFS graphics algorithms, an implementation of reference for beginners.
demo-dfs-directed
- Toan roi rac: Thuat taon DFS
DFS
- peymayesh dfs graph ba zaban c-peymayesh dfs graph ba zaban c++
graph-DFS
- 邻接表存储图，然后进行深度优先遍历及广度优先遍历。-DFS,adjacent matrix
1084(Square-Destroyer)(DFS)
- poj1084，采用位加速和记忆化DFS算法-poj1084, using bits acceleration and DFS
dfs
- dfs problem reaserch