Search - DFS non recursive

Search - DFS non recursive - List

[Data structs] dfs DL : 0: 数据结构里的dfs算法，包括递归与非递归。用vc6.0编写-data structure, the dfs algorithms, including recursive and non- recursive. Prepared with vc6.0
Date : 2025-12-24 Size : 1kb User : 叶芦芦
[Data structs] 2615DFS DL : 2: zoj 2615的代码，DFS搜索。由于数据量很大，采用非递归的DFS搜索。-zoj 2615 code, DFS english. Because a large amount of data, the use of non-recursive DFS english.
Date : 2025-12-24 Size : 2kb User : wzc
[Data structs] dfs DL : 0: 用c++语言实现的dfs非递归算法个人感觉不错仅供参考-With c++ Language realize the non-recursive algorithm dfs good personal feeling is for reference only
Date : 2025-12-24 Size : 1kb User : 王力
[Data structs] DFSfunction DL : 0: 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
Date : 2025-12-24 Size : 1kb User : sunshine
[Data structs] DFS DL : 0: DFS算法的非递归函数老师布置的，满分作业哦！-DFS algorithm of non-recursive function teacher layout, operating out of Oh!
Date : 2025-12-24 Size : 154kb User : 海瑞
[Data structs] CityRoad-report DL : 0: 城市道路问题的DFS用递归和非递归写的代码和一份解题报告-The issue of urban road with the DFS recursive and non-recursive code written report and a problem-solving
Date : 2025-12-24 Size : 6kb User : liangyi
[Data structs] MY_DFS DL : 0: 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.
Date : 2025-12-24 Size : 1kb User : synthia
[Data structs] DFS_non_recursive DL : 0: （数据结构）DFS深度优先，通过非递归算法来实现-The DFS of non-recursive algorithm (data structures)
Date : 2025-12-24 Size : 16kb User : Wu Biqian
[Data structs] aaaa DL : 0: 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 components to achieve 4) request with adjacency matrix, adjacency list cross-linked lists a variety of structural storage implementation
Date : 2025-12-24 Size : 4kb User : liliaaa
[Data structs] Desktop DL : 0: 用DFS解八皇后,这个是递归算法跟非递归算法(Using DFS to solve eight queens, this is a recursive algorithm with non recursive algorithm)
Date : 2025-12-24 Size : 105kb User : void_maker69