搜索资源列表
asdfasxa32
- 掌握图的邻接矩阵的存储结构；实现图的两种遍历：深度优先遍历和广度优先遍历。-master plan adjacency matrix storage structure; Implementation plans of the two traverse : depth-first traversal and breadth traversal priority.
哈工大软件基础实验报告
- 这个报告中包括哈工大计算机软件基础课3个上机实践的源代码，调试过程及实验结果截图。3个实践分别为顺序存储的线性表维护子系统的实现，二叉树的前序遍历程序的实现和二叉排序树维护子系统实现。
图基本操作
- 介绍了图的C++基本操作，建立，遍历，两种遍历方法，采用邻接矩阵建立图
236548
- 基本能够实现图的遍历，其中内有实验报告和具体程序实现！-Basic graph traversal can be achieved, of which there are experimental reports and the specific procedures to achieve!
123
- 图的遍历，广度优先与深度优先两种程序源代码-Graph traversal, breadth-first and depth-first source code in two
tudebianli
- 这个是图的遍历演示源程序代码，是用c语言写的，大家可以参考一下这个算法-This is a graph traversal demo source code is written in c language, we can refer to this algorithm
AboutGraph
- 1. 掌握图的基本存储方法； 2. 掌握有关图的操作算法并用高级语言实现； 3. 熟练掌握图的两种搜索路径的遍历方法。-1. To master plan the basic storage methods 2. Information on the plans and the operation of algorithms to achieve high-level language 3. The master plan of the traverse path of the
chengshijiaotongbianlitu
- 城市交通遍历图，1、由数据文件生成邻接表，2、输出图邻接表，3、度优先遍历图，4广度优先遍历图-Urban traffic traverse map, 1, data files generated by the adjacent table, 2, the output graph adjacency list, 3, priority ergodic map, Figure 4, breadth-first traversal
code
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-sheet for the storage structure, to achieve connected undirected graph depth-first and breadth-first traversal. To user-specified node as a starting point, r
2007112110443991
- 图的遍历 课设报告 绝对可用 图的遍历 课设报告 绝对可用 图的遍历 课设报告 绝对可用-Graph traversal class-based traversal of the report is absolutely free lesson plans based traversal of the report is absolutely free lesson plans available map-based report on the absolute class-based re
graph
- 用邻接矩阵法建一无向连通图（顶点信息为字符），分别用dfs（深度优先搜索）和bfs(广度优先搜索)遍历，输出图中顶点信息并验证。-Adjacency matrix to build an undirected connected graph (vertex information for characters), respectively dfs (depth-first search), and bfs (breadth-first search) traversal, the output
01259361tubianlideyanshi
- 图的遍历的演示（c 语言 数据结构课程设计题） /*定义图*/ typedef struct{ int V[M] int R[M][M] int vexnum }Graph /*创建图*/ void creatgraph(Graph *g,int n) { int i,j,r1,r2 g->vexnum=n /*顶点用i表示*/ for(i=1 i<=n i++) { g->V[i]=i } /*初始化R*/ for(i=1 i<=n i++) for(j=1 j<
1
- 给定一个有向图，实现图的深度优先, 广度优先遍历算法，拓扑有序序列，并输出相关结果。 功能要求：输入图的基本信息，并建立图存储结构（有相应提示），输出遍历序列，然后进行拓扑排序，并测试该图是否为有向无环图，并输出拓扑序列-Given a directed graph, realize the depth chart first, breadth-first traversal algorithm, topology and orderly sequence, and outputs the
tudebianliguochegn
- 图邻接矩阵_邻接表的建立 图的遍历课程设计-_ Adjacency list graph adjacency matrix graph traversal establishment of curriculum design
graph-theory-and-program-designe
- 详细的介绍了图论的各种概念如：分叉树，最短路径，遍历等以及相应的程序设计-A detailed descr iption of the various concepts of graph theory such as: the bifurcation tree, shortest path, traverse, and the corresponding program design
bianli
- 图的深度及广度遍历 首先创建一个无向图,顶点用一个一维数组存储,弧用一个二维数组存储,不相邻顶点之间设置无限大。深度遍历时设置顶点的布尔函数，访问过的顶点布尔值为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 w
tu
- 实验要求：（1）理解图顶点和边的存储方法：邻接矩阵和邻接表；（2）理解图的遍历算法，掌握其应用；（3）应用图的遍历算法判断图是否连通和两顶点间是否存在路径。-Experimental requirements: (1) to understand the storage method: Figure the vertices and edges adjacency matrix and adjacency list (2) to understand graph traversal algor
加强图
- 图 深度优先搜索遍历和 邻接矩阵，闫蔚敏版，简单易懂，适合平时交作业(Graph depth first search and adjacency matrix, Yan Yumin version, simple, suitable for everyday homework)
图的深度和广度搜索
- 关于图的邻接矩阵的建立和广度和深度遍历结果显示(The establishment of the adjacency matrix of a graph and the result of the breadth and depth traversal)