搜索资源列表
disanti
- (1)自选存储结构，输入含n个顶点（用字符表示顶点名称）和e条边的图G； (2)指定任意顶点x为初始顶点，对图G作DFS遍历，输出DFS（深度优先）顶点序列(提示:使用栈实现DFS)； (3)指定任意顶点x为初始顶点，对图G作BFS（广度遍历），输出BFS顶点序列(提示:使用队列实现BFS)； (5)输入顶点x，查找图G:若存在含x的顶点，则删除该结点及与之相关连的边，并作DFS遍历(执行操作3)；否则输出信息“不存在x”； (6)判断图G是否是连通图，输出信息“YES”/“NO
tu
- 以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列。 -To the adjacent table for the storage structures, to achieve connectivity of undirected graph depth-first and breadth-first traversal. To user-specified node as a starting point, respective
3
- 设计一个有向图和一个无向图，任选一种存储结构，完成有向图和无向图的DFS（深度优先遍历）和BFS（广度优先遍历）的操作。-Design of a directed graph and an undirected graph, either type of storage structure, the completion of a directed graph and an undirected graph of the DFS (depth-first traversal) and BFS (
22
- 这是我平时做的一次作业，是用C++编写的一个程序，是关于图的遍历，实现对图的广度和深度遍历-This is what I usually do a job, is written in C++, a program on the graph traversal to realize the breadth and depth of the graph traversal
tudebianli
- 图的遍历包括深度优先搜索和广度优先搜索，大家可以看看。-Graph traversal, including depth-first search and breadth-first search, we can look at.
tu3
- 1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） 3 编写一个主函数，将上面函数连在一起，构成一个完整程序。 4 将实验源程序调试并运行。 -Create a storage structure of a given graph from the adjacency list and adjacency matrix
Traversing_Graph
- 树的邻接表表示和邻接矩阵表示，以及图的广度优先和深度优先遍历。-Tree adjacency list representation and adjacency matrix representation, and the graph breadth-first and depth-first traversal.
Graph
- 通过深度和广度遍历 实现对图各节点的遍历算法-Achieved by traversing the depth and breadth of the graph traversal algorithm for each node
tudebianli
- 图的深度遍历和广度遍历（以邻接表为存储结构）-The depth and breadth traversal graph traversal (in the adjacent table for the storage structure)
graph
- 无向图的建立以及深度优先和广度优先遍历并输出 -DFS and BFS search for a graph
graph
- 无向图的遍历搜索，可以实现非递归深度搜素和广度搜索。-Undirected graph traversal search, you can achieve a non-recursive depth the Su-search and breadth of the search.
s6
- 数据结构 在图G中求一条从顶点i到顶点s 的简单路径。 实验目的： 1、掌握图的各种存储结构，尤其熟练掌握邻接矩阵和邻接表存储结构； 2、熟练掌握图的深度优先遍历和广度优先遍历算法； 3、在遍历算法的基础上设计其他应用算法。 -Data structures and seek a graph G from vertex i to vertex s simple path. Experiment: a master chart of the various storage
bianli
- 这是图的深度优先遍历和广度优先遍历算法，可以改变结点数和边数-This is illustrated in the depth-first traversal and breadth-first traversal algorithm, you can change the number of nodes and edges
tu
- 1. 建立并显示图的邻接矩阵。 2. 建立并显示图的邻接表。 3. 实现图的深度优先和广度优先遍历。 4. 编写测试程序。 -(1) Establishment and display the adjacency matrix. (2) create and display the adjacency table. 3 to achieve depth-first and breadth-first traversal. 4. Preparation of test
deep_and_wide
- 图的深度和广度遍历代码，比较基础，适合初学者-Depth and breadth traversal code, more basic, for beginners
yubianli
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-his is a graph traversal demo source code is written in c language, we can refer to this algorithm
tudejianlijibianlifangfa
- 1．要求对于给定的图分别用邻接矩阵和邻接表来存储。 2．对于存储好的图进行深度和广度优先遍历。 3．完成图的各种操作。 - 1. Requirements for a given graph adjacency matrix and adjacency were used to store the table. 2. Good depth chart for storage and breadth-first traversal. 3. Complete dia
DFS_BFS
- 数据结构图论中，实现邻接矩阵的深度遍历和邻接矩阵广度遍历.-Data structure graph theory, the depth traversal and breadth to achieve adjacency matrix adjacency matrix traversal.
GrapgTraverse
- 数据结构，以邻接矩阵的方式建立图。对图进行深度遍历和广度遍历。-Data structure, the establishment of adjacency matrix approach. Depth traversal and breadth traversal.
sy10(1)
- 图的存储结构与遍历 （1）画出如图（1）所示无向图的邻接矩阵和邻接表，列出该图的广度优先遍历和深度优先遍历结果（选定A为出发点进行遍历）。 （2）画出如图（2）所示有向图的邻接矩阵和邻接表，列出该图的广度优先遍历和深度优先遍历结果（选定A为出发点进行遍历）(The storage structure of the graph and traversal (1) draw the adjacency matrix and adjacency list of the und