Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - dfs recursive

Search list

[Windows Develop] DFS※Prim

Description: 用普里姆(Prim)算法构造最小生成树；图的DFS算法的非递归遍历函数。-with Primbetov (PRIM), the minimum spanning tree algorithm constructs; Map of the DFS non - recursive algorithm traversal function.
Platform: | Size: 3916 | Author: 贾德 | Hits:

[Other] fudfs

Description: 用dfs非递归算法遍历图。创 建图是用链表来实现。 -with scores of non - recursive algorithm traverse map. Map is created using chain is to be achieved.
Platform: | Size: 1136 | Author: 傅蓉蓉 | Hits:

[Mathimatics-Numerical algorithms] T12

Description: dfs的非递归算法-dfs non - recursive algorithm
Platform: | Size: 1394 | Author: 尹盛 | Hits:

[Other resource] dfs

Description: 数据结构里的dfs算法，包括递归与非递归。用vc6.0编写-data structure, the dfs algorithms, including recursive and non - recursive. Prepared with vc6.0
Platform: | Size: 1428 | Author: 叶芦芦 | Hits:

[Mathimatics-Numerical algorithms] T12

Description: dfs的非递归算法-dfs non- recursive algorithm
Platform: | Size: 1024 | Author: 尹盛 | Hits:

[Data structs] dfs

Description: 数据结构里的dfs算法，包括递归与非递归。用vc6.0编写-data structure, the dfs algorithms, including recursive and non- recursive. Prepared with vc6.0
Platform: | Size: 1024 | Author: 叶芦芦 | Hits:

[Windows Develop] DFS※Prim

Description: 用普里姆(Prim)算法构造最小生成树；图的DFS算法的非递归遍历函数。-with Primbetov (PRIM), the minimum spanning tree algorithm constructs; Map of the DFS non- recursive algorithm traversal function.
Platform: | Size: 4096 | Author: 贾德 | Hits:

[Other] fudfs

Description: 用dfs非递归算法遍历图。创 建图是用链表来实现。 -with scores of non- recursive algorithm traverse map. Map is created using chain is to be achieved.
Platform: | Size: 1024 | Author: 傅蓉蓉 | Hits:

[Data structs] 2615DFS

Description: zoj 2615的代码，DFS搜索。 由于数据量很大，采用非递归的DFS搜索。-zoj 2615 code, DFS english. Because a large amount of data, the use of non-recursive DFS english.
Platform: | Size: 2048 | Author: wzc | Hits:

[Data structs] dfs

Description: 用c++语言实现的dfs非递归算法 个人感觉不错仅供参考-With c++ Language realize the non-recursive algorithm dfs good personal feeling is for reference only
Platform: | Size: 1024 | Author: 王力 | Hits:

[Data structs] DFSfunction

Description: 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
Platform: | Size: 1024 | Author: sunshine | Hits:

[Data structs] DFS

Description: DFS算法的非递归函数 老师布置的，满分作业哦！-DFS algorithm of non-recursive function teacher layout, operating out of Oh!
Platform: | Size: 157696 | Author: 海瑞 | Hits:

[Windows Develop] shixiantudebianli

Description:  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。  DFS1(ALGraph *G,int v)：以非递归的方法从顶点v深度优先遍历图G。  BFS(ALGraph *G,int v)：从顶点v广度优先遍历图G。 - MatToList (MGraph g, ALGraph* & G): the adjacency matrix adjacency list g into G.  ListToMat (ALGraph* G, MGraph & g): the adjacent table adjacency matrix G into g.  DispMat (MGraph g): output adjacency matrix g.  DispAdj (ALGraph* G): output adjacency list G.  DFS (ALGraph* G, int v): to the method of recursive vertex v from the depth-first traversal graph G.  DFS1 (ALGraph* G, int v): non-recursive method to vertex v from the depth-first traversal graph G.  BFS (ALGraph* G, int v): vertex v from the breadth-first traversal graph G.
Platform: | Size: 3072 | Author: 小鬼 | Hits:

[Data structs] myproject

Description: 应用DFS，递归调用完成的图中环查找算法过程-Application of DFS, recursive calls to complete the plan process in Central search algorithm
Platform: | Size: 7168 | Author: zoyag | Hits:

[Data structs] CityRoad-report

Description: 城市道路问题的DFS用递归和非递归写的代码和一份解题报告-The issue of urban road with the DFS recursive and non-recursive code written report and a problem-solving
Platform: | Size: 6144 | Author: liangyi | Hits:

[Data structs] MY_DFS

Description: 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, returning to the most recent node it hasn t finished exploring. In a non-recursive implementation, all freshly expanded nodes are added to a stack for exploration.
Platform: | Size: 1024 | Author: synthia | Hits:

[CSharp] DFS

Description: DFS算法的非递归函数。DFS是求树的深度的深度优先算法-DFS algorithm of non-recursive function. DFS is seeking the depth of the tree depth-first algorithm
Platform: | Size: 336896 | Author: crystalever | Hits:

[Data structs] ZeroOne

Description: 求0，1序列的三种办法 第一种：递归深度搜索 第二种：栈结构深度搜索 第三张：神秘方法-Three methods to solve 0-1 sequence 1st: recursive DFS 2st: DFS on stack construction 3st: sprytical..
Platform: | Size: 1024 | Author: forgeneral | Hits:

[Data structs] Data-structure-course-design

Description: 上学期做的数据结构课程设计，走迷宫游戏，分别用了两种方法来实现： 第一种方法，链栈的存储结构，用递归的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 structure, with the recursive DFS to achieve The second method, back through the algorithm to find out all pathways, exhaustively method
Platform: | Size: 4096 | Author: 李国强 | Hits:

[Algorithm] dfs

Description: 深度优先搜寻算法C语言实现，采用递归函数-Degree first search algorithm implemented by C language,recursive
Platform: | Size: 419840 | Author: 曹魏 | Hits:
« 12 »

CodeBus www.codebus.net