搜索资源列表
xuehaiwuya
- 算法有关于树的遍历的，还有图的搜索等等的数据结构相关算法-algorithm on the traversal of the tree, and there are also search the data structure correlation algorithm
t(OK)
- 该程序实现了图的先序、后序遍历和拓扑排序等，而且是界面输出。-the program to achieve the plan's first sequence, after the preorder and topological sorting, but it is the output interface.
有向图从邻接矩阵转换为邻接表后的dfs
- 有向图从邻接矩阵转换为邻接表后再深度优先遍历-a graph from the adjacency matrix conversion of the adjacent#$#!142996#!#$read IntelCPU serial number. Rar!#$#read Intel CPU serial number. Rar read Intel CPU serial number. Read rar Intel CPU serial number. rar
fudfs
- 用dfs非递归算法遍历图。创 建图是用链表来实现。 -with scores of non - recursive algorithm traverse map. Map is created using chain is to be achieved.
graphOrderdemo
- 在VC++.NET下实现关于图的的有关算发,包括遍历,插入,删除等-in VC.NET on the map to achieve the operator of the hair, including traversal, insertion, deletion, etc.
shengdubianli
- 1.首先选定图的类别（有向图、无向图），再选定图的存储结构，根据输入的顶点或者边建立图；并把相应的邻接表或者邻接矩阵输出； 2.根据已有的邻接矩阵或邻接表用递归方法编写深度优先搜索遍历算法，并输出遍历结果；
5
- 图的遍历中，因为图的任一顶点都可能与其余的顶点相邻接，所以在访问了某个顶点之后，可能沿着某条路径搜索之后又回到该顶点上。为了避免同一顶点被访问多次，在遍历图的过程中必须记下每个已访问过的顶点。深度优先搜索从图的某个顶v点出发,访问此顶点，然后依次从v的未被访问的邻接点出发深度优先遍历图。遍历图的过程实质上是对每个顶点查找其邻接点的过程。其耗费的时间则取决于所采用的存储结构。
c
- 实现图的临接矩阵，邻接表，广度优先遍历和深度优先遍历。
v
- 图的遍历问题 简单的小程序 大家来
123
- 在Borland C++ Builder 实现 图的深度和广度遍历
MGraph
- 实现的是以邻接矩阵存储图，并能将矩阵打印，同时实现了图的深度遍历
DFS1
- 用DFS算法遍历图-with DFS traversal algorithm map
datastructure
- 设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函数输入数据进行测试
algo & data structures graphs
- 图的遍历:图是由顶点集合(vertex)及顶点间的关系集合组成的一种数据结构:Graph＝( V, E ).使用拓扑排序的算法.-traverse the map : The map is set by the vertex (Vertex) and the relationship between peak set consisting of a data structure : Graph = (V, E). The use of topological sorting algorithm.
graph
- 图的遍历 能实现深度 广度遍历 还有文挡-Graph traversal to realize the depth of breadth traversal also text block
Graph
- 本程序实现图的深度优先和广度优先遍历，本程序调试无误，可在vc6.0环境中编译成功！-This procedure to achieve graph depth-first and breadth-first traversal, the program debugging accurate, can be successfully compiled vc6.0 environment!
Graph
- 图的存储结构和遍历，用图结构解决具体问题-Figure of storage structures and traversal, using graph structure to solve a specific problem
Graph
- 图中查找元素，广度优先遍历，深度优先遍历-Find a map element, breadth-first traversal, depth-first traversal
Fianl
- 实现了图的广度搜索遍历，同时匹配变量及算法的显示，利用窗口分割的策略显示不同部分的协同，利用文档文件实现子窗口的数据交互。-To achieve the breadth of search traversal of the diagram, while matching variables and the algorithm showed that the use of split window display different parts of the strategy together,
graph
- 利用VB可以进行任意图的遍历，显示绝对OK啦-The use of VB graph traversal can be