搜索资源列表
DFS※Prim
- 用普里姆(Prim)算法构造最小生成树；图的DFS算法的非递归遍历函数。-with Primbetov (PRIM), the minimum spanning tree algorithm constructs; Map of the DFS non - recursive algorithm traversal function.
fudfs
- 用dfs非递归算法遍历图。创 建图是用链表来实现。 -with scores of non - recursive algorithm traverse map. Map is created using chain is to be achieved.
T12
- dfs的非递归算法-dfs non - recursive algorithm
dfs
- 数据结构里的dfs算法，包括递归与非递归。用vc6.0编写-data structure, the dfs algorithms, including recursive and non - recursive. Prepared with vc6.0
DFSfunction
- DFS非递归函数 函数功能：图的dfs的非递归算法(用堆栈实现) 输入：图的邻接矩阵 输出：dfs序列 -DFS non-recursive function function function: dfs map non-recursive algorithm (using the stack to achieve) Input: adjacency matrix graph output: dfs sequence
DFS
- DFS算法的非递归函数 老师布置的，满分作业哦！-DFS algorithm of non-recursive function teacher layout, operating out of Oh!
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。 =
myproject
- 应用DFS，递归调用完成的图中环查找算法过程-Application of DFS, recursive calls to complete the plan process in Central search algorithm
CityRoad-report
- 城市道路问题的DFS用递归和非递归写的代码和一份解题报告-The issue of urban road with the DFS recursive and non-recursive code written report and a problem-solving
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. Then the search backtracks, retur
DFS
- DFS算法的非递归函数。DFS是求树的深度的深度优先算法-DFS algorithm of non-recursive function. DFS is seeking the depth of the tree depth-first algorithm
ZeroOne
- 求0，1序列的三种办法 第一种：递归深度搜索 第二种：栈结构深度搜索 第三张：神秘方法-Three methods to solve 0-1 sequence 1st: recursive DFS 2st: DFS on stack construction 3st: sprytical..
Data-structure-course-design
- 上学期做的数据结构课程设计，走迷宫游戏，分别用了两种方法来实现： 第一种方法，链栈的存储结构，用递归的dfs来实现 第二种方法，回溯法求出所有通路，穷举求解法-On the data structure of the semester curriculum design, mazes game, respectively for the two methods to realize: The first method, chain stack the storage structur
DFS_non_recursive
- （数据结构）DFS深度优先，通过非递归算法来实现-The DFS of non-recursive algorithm (data structures)
aaaa
- 1) 先任意创建一个图； 2) 图的DFS,BFS的递归和非递归算法的实现 3) 最小生成树（两个算法）的实现，求连通分量的实现 4) 要求用邻接矩阵、邻接表、十字链表多种结构存储实现-A) any first create a graph 2) DFS, BFS recursive and non recursive algorithm 3) The minimum spanning tree (algorithm) to achieve, find the connected
bianli
- 图的深度及广度遍历 首先创建一个无向图,顶点用一个一维数组存储,弧用一个二维数组存储,不相邻顶点之间设置无限大。深度遍历时设置顶点的布尔函数，访问过的顶点布尔值为true，递归调用DFS函数。广度遍历时，结合队列的存储方式，进行遍历。-Figure traverse the depth and breadth of First create a non-directed graph, vertex with a one-dimensional array to store the arc w
2
- 建立图的邻接表DFS：深度优先遍历的递归算法 BFS：广度优先遍历-Establish the adjacency table DFS: depth-first traversal of the recursive algorithm BFS: breadth-first traversal
1
- 用邻接矩阵表示的图的类型 DFS：深度优先遍历的递归算法BFS：广度优先遍历判断从顶点vi到顶点vj是否可达-Adjacency matrix type DFS: depth-first traversal of the recursive algorithm BFS: breadth-first traversal of the judgment from the vertex vi to vertex vj is reachable
dfs
- 深度优先搜寻算法C语言实现，采用递归函数-Degree first search algorithm implemented by C language,recursive
Graph-traversal
- 采用图的邻接矩阵或邻接表实现最短路径问题中图的存储，采用递归程序实现图的深度优先搜索（DFS）-Using adjacency matrix or adjacency list shortest path problem in memory map, using a recursive program implements graph depth-first search