搜索资源列表
graphy
- C++ 关于图的广度优先 深度优先 遍历的一些代码 很不错-C++ on the graph breadth-first depth-first traversal of some of the code is very nice
UnDirectGraph
- 本程序实现了《数据结构》课本中无向图的基本算法,包括图的构造、图的深度、广度优先遍历算法、用Prim、Kruskal算法构造最小生成树以及分别用Dijkstra、Floyd算法求源点到所有顶点、图中任意两点间的最短路径,并给出具体的路径 -This procedure achieved a " data structure" textbooks undirected graph the basic algorithm,
tu
- 图的遍历 从图中某一顶点出发遍历图中其余顶点,且使每一个顶点仅被访问一次。通常有两条遍历图的路径:深度优先搜索和广度优先搜索。 -Graph traversal
1
- 给定一个有向图,实现图的深度优先, 广度优先遍历算法,拓扑有序序列,并输出相关结果。 功能要求:输入图的基本信息,并建立图存储结构(有相应提示),输出遍历序列,然后进行拓扑排序,并测试该图是否为有向无环图,并输出拓扑序列-Given a directed graph, realize the depth chart first, breadth-first traversal algorithm, topology and orde
rrrrrrr
- 以邻接多重表为存储结构,实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点,分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-table storage structure, connectivity undirected graph depth first and breadth-first traversal. User-specified node as a starti
tubianliyanshi
- 以邻接多重表为存储结构,实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点,分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-table storage structure, connectivity undirected graph depth first and breadth-first traversal. User-specified node as a starti
tu121312
- 实现图的深度优先, 广度优先遍历算法,并输出原图结构及遍历结果。 初步完成总体设计,搭好框架; 最低要求:两种遍历都要实现,写出画图的思路; -Implementation of Depth-first, breadth-first traversal algorithm, and outputs the original image structure and the traversal result. Completed t
tudebianli
- 实现图的深度优先, 广度优先遍历算法,并输出原图结构及遍历结果。 初步完成总体设计,搭好框架; 最低要求:两种遍历都要实现,写出画图的思路; 进一步要求:画出图的结构,有兴趣的同学可以进一步改进图的效果。 -Implementation of Depth-first, breadth-first traversal algorithm, and outputs the original image structure and
Graph
- 基于数据结构(c语言)图的遍历,包括深度优先遍历和广度优先遍历。-Based on data structures (c language) graph traversal, including the depth-first traversal and breadth-first traversal.
graph
- 无向图的建立以及深度优先和广度优先遍历并输出 -DFS and BFS search for a graph
Graph
- 该程序是用MFC实现的图的相关的运算,其中包括了图的深度有限遍历,广度优先遍历,最短路径等基本运算。-The program is MFC implementation of graph-related operations, including the depth chart limited traversal, breadth-first traversal, shortest path, and other basic opera
bianli
- 用邻接矩阵确定图 输出深度优先遍历和广度优先遍历的结果-Map with the adjacency matrix to determine the depth first traversal and breadth of the output first traversal of the results
test
- 图的遍历演示,深度优先及广度优先,采用C++编译环境-tu de hianli
graph
- 图子系统实验,定义了图的存储结构,以及队列操作。包括邻接矩阵,深度优先遍历,以及广度优先遍历-Figure subsystem test, defines the memory structure map and queue operations. Including the adjacency matrix, depth-first traversal and breadth-first traversal
Graphtraversal
- 输入给定的有向图或无向图实现深度优先遍历和广度优先遍历-Graph Traversal
612109301
- 要求采用邻接矩阵作为无向图的存储结构,邻接表作为有向图的存储结构,完成无向图和有向图的建立,并对建立好的图进行深度和广度优先遍历。具体实现要求: 1. 通过键盘输入图的顶点和边信息,分别构造一个无向图的邻接矩阵和一个有向图的邻接表。 2. 分别对建立好的两个图进行深度和广度优先遍历,输出相应的遍历序列。 3. 统计两个图的连通分量的个数。 -Require the use of adjacency matrix as t
DFSBFS
- 设计一个有向图,建立图的邻接矩阵或邻接表的存储结构,完成有向图的DFS(深度优先遍历)和BFS(广度优先遍历)的操作-Design of a directed graph, the establishment of the adjacency matrix or adjacency list of the storage structure, complete directed graph DFS (depth-first traver
tubianli
- 对图的邻接表表示进行深度优先遍历和广度优先遍历。-The adjacency list representation of the depth-first traversal and breadth-first traversal.
linjiejuzhen
- 8.3.1利用邻接矩阵的图广度优先遍历算法-8.3.1 Using the adjacency matrix of the graph breadth-first traversal algorithm
linjiebiaodetu
- 8.3.2利用邻接表的图广度优先遍历算法-8.3.2 Using the adjacency list of graph breadth-first traversal algorithm