Description: 用dfs非递归算法遍历图。创 建图是用链表来实现。 -with scores of non - recursive algorithm traverse map. Map is created using chain is to be achieved. Platform: |
Size: 1136 |
Author:傅蓉蓉 |
Hits:
Description: 数据结构里的dfs算法，包括递归与非递归。用vc6.0编写-data structure, the dfs algorithms, including recursive and non - recursive. Prepared with vc6.0 Platform: |
Size: 1428 |
Author:叶芦芦 |
Hits:
Description: 用dfs非递归算法遍历图。创 建图是用链表来实现。 -with scores of non- recursive algorithm traverse map. Map is created using chain is to be achieved. Platform: |
Size: 1024 |
Author:傅蓉蓉 |
Hits:
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:
Description: 用c++语言实现的dfs非递归算法 个人感觉不错仅供参考-With c++ Language realize the non-recursive algorithm dfs good personal feeling is for reference only Platform: |
Size: 1024 |
Author:王力 |
Hits:
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:
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:
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:
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:
Description: 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 Platform: |
Size: 4096 |
Author:liliaaa |
Hits:
Description: 图的深度及广度遍历
首先创建一个无向图,顶点用一个一维数组存储,弧用一个二维数组存储,不相邻顶点之间设置无限大。深度遍历时设置顶点的布尔函数，访问过的顶点布尔值为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 with a two-dimensional array to store non-adjacent vertices between the infinite set. Boolean function, set deep traversal vertices visited vertex boolean value true recursive call DFS function. Breadth traversal, combined with the queue storage traversal. Platform: |
Size: 8192 |
Author:周天行 |
Hits:
Description: 用DFS解八皇后,这个是递归算法跟非递归算法(Using DFS to solve eight queens, this is a recursive algorithm with non recursive algorithm) Platform: |
Size: 107520 |
Author:void_maker69
|
Hits:
Search - DFS non recursive