搜索资源列表
shengchengshu
- 8.3.5利用邻接表图的深度优先生成树生成算法-8.3.5 adjacency list graph using depth-first spanning tree generation algorithm
GrapeDeep
- 图的深度优先遍历，数据结构的很重要的一个内容，也很有难度，与大家分享-Graph depth-first traversal of the data structure is an important content, but also very difficult to share with you
pic
- 对任意给定的图（顶点数和边数自定），建立它的邻接表并输出，然后利用堆栈的五种基本运算（清空堆栈、压栈、弹出、取栈顶元素、判栈空）实现图的深度优先搜索遍历和广度优先搜索遍历算法。 -For any given graph (vertices and edges from the set), to establish its adjacency list and output, and then use the stack of five basic operations (empty stac
Graph-DFS_WFS
- 深度优先遍历，宽度优先遍历. 程序从图文本中读取图的矩阵。 矩阵包括有向图或无向图-DFS and WFS for a graph
DFS_AND_BFS
- 图的深度优先和广度优先算法的实现和比较，自行输入节点顺序，然后使用不同的方式历遍-the implementation and comparison of Graph depth-first and breadth first algorithm
DSFTraver
- 图的深度优先搜索遍历，可以实现数据结构中关于图的遍历里面的深度优先搜索遍历-Depth-first search graph traversal can be achieved on the graph data structure traversal inside the depth-first search traversal
Without-the-adjlink-to-map
- 从键盘输入无向图G的顶点个数v及边的个数e。建立有v个顶点、e条边构成的无向图G，采用邻接矩阵表示。V个顶点的值由键盘输入，元素类型为字符型。e条边的信息也由键盘输入。分别调用图的深度优先搜索、广度优先搜索图并输出相应的遍历序列。-Input from the keyboard without the number of vertices to the graph G v and the number of edges e. Establishment of a v vertices, e ed
DFS
- java 数据结构 实现图的深度优先算法-Data structure of depth first search in java
DNF
- 实现无向图的深度优先遍历，同时输出遍历结果--Free graph of depth-first traversal, while the output traversal results
tudebianli
- 实现图的深度优先, 广度优先遍历算法，并输出原图结构及遍历结果。 分步实施： -To achieve the depth chart first, breadth-first traversal algorithm, and outputs the result through the structure and artwork. Step by step:
graph
- 图的深度优先与广度优先遍历源代码，可直接使用-Graph depth-first and breadth-first traversal
dfs3
- 图的深度优先搜索算法，图的存储采用数组来模拟邻接表。-Graph depth-first search algorithm, Figure storage array used to simulate the adjacency table.
Graph
- 此程序主要是实现图的深度优先遍历和广度优先遍历。-The procedure is to achieve the figure of the depth-first traversal and breadth-first traversal.
The-graph-traversing-algorithm
- 以邻接矩阵或邻接表为存储结构，以用户指定的顶点为起始点，实现无向连通图的深度优先及广度优先搜索遍历，并输出遍历的结点序列-The adjacency matrix or adjacency list for the storage structure to user-specified vertex as a starting point to achieve a connected undirected graph of the depth-first and breadth-first se
test2
- 数据结构 图的深度优先搜索遍历路径源代码-Data structure depth-first search through the source code path
database-Graph
- 一：实验目的： （1）掌握图的存储思想及其存储实现。 （2）掌握图的深度、广度优先遍历算法思想及其程序实现。 （3）掌握图的常见应用算法的思想及其程序实现。 （4）理解有向无环图、最短路径等算法 二：实验内容： 以下实验内容，1和2为必做内容，3为选做内容。 1.有向图 （1）键盘输入数据，建立一个有向图的邻接表，并输出该邻接表。 （2）在有向图的邻接表的基础上计算各顶点的度，并输出。 （3）以有向图的邻接表为基础实现并输出它的拓扑排序序
ART
- 计算机算法基础ART算法（计算连通图的深度优先生成树的DFN和L）用VC++代码实现-Computer algorithm based ART algorithm (calculated connected graph depth-first spanning tree of the DFN and L) with VC++ code
graph
- 图的深度优先搜索遍历算法分析及其应用.pdf-woyu buhuia
DFS
- DFS图的深度优先遍历！C++编写,数据结构-programing by c++
DFS
- 有向图或者无向图的深度优先遍历，给出遍历的节点序列-DFS for the directed or undirected graph ,which returns the ordered vertex set