搜索资源列表
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
- A program to find the depth first search on a given graph.It contains a source code, input file and an output file.
Graph-DFS_WFS
- 深度优先遍历，宽度优先遍历. 程序从图文本中读取图的矩阵。 矩阵包括有向图或无向图-DFS and WFS for a graph
DFS
- Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking.
dfs
- 先深搜索算法，图论的基础算法，用于遍历图中各点，图用点边集表示，以文件方式读入-First deep-search algorithm, graph theory based algorithm for traversing the graph, Figure with a set of edges that point to papers read
graph
- 用图里面dfs方法编写的素数环程序。在vc++6.0中编译通过，是一个DOS的窗口-Figure prepared using methods which dfs prime ring procedures. In vc++6.0 in the compiler, is a DOS window
DFS
- 有向图或者无向图的深度优先遍历，给出遍历的节点序列-DFS for the directed or undirected graph ,which returns the ordered vertex set
Graph-traversal
- 图的遍历示例。包括深度优先和广度优先。控制台程序。-Graph traversal.DFS and BFS.
DFS.cpp
- This code do depth first search algorithm. Adjacency matrix symbolize every edge in the graph, for example adj[i][j]=1 is an edge from i to j, i and j are vertices.
Graph-traversal
- 以邻接多重表为存储结构，实现无向连通图的深度优先和广度优先遍历。-This paper is to solve the traversal of the graph using DFS BFS
Graph-DFS-BFS
- graph traversal using bfs and dfs strategy
Graph
- some source codes of good algorithms as DFS, BFS etc in graph theory.
dfs
- dfs code for graph mining
graph
- 输出图对应的邻接矩阵以及DFS和BFS结果-The output diagram corresponds to the adjacency matrix as well as the DFS and BFS results
a
- 深度遍历求图的关节点，手写C。抛砖引玉。 减治法。算法课作业。-DFS GRAPH A point
graph-DFS
- 邻接表存储图，然后进行深度优先遍历及广度优先遍历。-DFS,adjacent matrix
Graph
- Graph with adjacency list with dfs and bfs traversal functions
DFS
- 1、用邻接表存储下图： 2、完成对以上图的深度优先搜索，设出发顶点是V1。 -1, with the adjacent table stores the following figure: 2, complete the above graph depth-first search, set the starting vertex is V1.
DFS
- 深度优先搜索属于图算法的一种,英文缩写为DFS即Depth First Search.其过程简要来说是对每一个可能的分支路径深入到不能再深入为止,而且每个节点只能访问一次.-DFS Depth First Search is a kind of graph algorithm, English abbreviation for DFS is the Depth First Search. The process is briefly branch of every possible path c
DFS-BFS
- 2014年北京大学暑假公开课算法讲解课件之搜索，讲解详细，分析透彻-2014 Peking University summer open class algorithm courseware on the graph theory, explain the detailed, thorough analysis