搜索资源列表
sting7.doc
- 图的邻接矩阵、邻接表、十字链表、邻接多重链表存储结构表示及其创建算法的c语言实现 图的深度优先搜索遍历算法和图的广度优先搜索遍历算法及C语言实现-the adjacency matrix, the adjacent table, Cross Chain, Listless multiple adjacent storage structure and said the creation algorithm in C Language map of the depth-first traversa
diwuci
- 1）掌握图的邻接矩阵、邻接表、十字链表、邻接多重链表存储结构表示及其创建算法的c语言实现； 2）掌握图的深度优先搜索遍历算法和图的广度优先搜索遍历算法及C语言实现；
undirectedgraphtraversing
- 此程序是学完数据结构课后，对无向图进行深度和广度遍历的c程序，vc6环境下测试通过。
123
- 在Borland C++ Builder 实现 图的深度和广度遍历
图的遍历演示
- 一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Descr iption many issues involving maps of algorithms are to traverse the map-based. A written test procedures,
picture
- 实现图的遍历。对图的深度和广度的遍历，建立邻接矩阵与邻接表-The realization of graph traversal. To map the depth and breadth of the traverse, the establishment of adjacency matrix and adjacency list
graphsearch
- 包含图的深度优先探索遍历和广度优先探索遍历，能从图中的任一顶点出发访问图中所有顶点-Includes plans to explore the depth-first traversal and breadth-first traversal to explore, from the graph the starting point of any visit to Figure 1 for all vertices
tudebianli
- 图的遍历和生成树求解实现（邻接矩阵、邻接表 ―图的深度广度遍历算法的实现和最小生成树PRIM和KRUSCAL算法的实现） -Graph Traversal and Spanning Tree Solution implementation (adjacency matrix, adjacency list- map the depth of breadth traversal algorithm and implementation of the minimum spanning tree al
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
GraphTraversal
- 图的遍历，实现图的深度和广度两种便利方式，方便快速。-Graph traversal, the realization of the depth and breadth of plans to facilitate the two way quickly and easily.
graph.yangxu
- 熟悉图的存储方式，实现图的邻接矩阵或者邻接表的存储方式下的基本运算，特别是深度遍历和广度遍历；掌握以图为基础的一些常用算法，如最小生成树、拓扑排序、最短路径等。-Familiar with the map of storage practices, and achieve adjacency matrix or adjacency list is stored under the basic operations, especially in the depth and breadth trav
traversinggraph
- 图的遍历的实现，文字界面，包含深度遍历和广度遍历两种情况-Graph traversal implementation, the text interface, including the depth and breadth traversal traverse both cases ~ ~
AdjacencyMultilist
- 这是个图的深度和广度遍历算法，主要是巩固数据结构的内容，对人启发非常大-This is a graph traversal algorithm for the depth and breadth of the main contents of the consolidation of data structure, inspired by a very large human
Graph
- 数据结构，用C++实现图的深度和广度遍历，能运行。-Realize graph traversal by C++.
deep_and_wide
- 图的深度和广度遍历代码，比较基础，适合初学者-Depth and breadth traversal code, more basic, for beginners
图的遍历
- 图的构建以及实现图的深度遍历和广度遍历!!!!!!!!(tudegoujianyijishixiantudeshendubianliheguangdubianli)
Graph_Operation
- 采用邻接表方法实现图的存储，进而对图进行深度和广度遍历(The adjacency table method is used to store the graph, and then the depth and breadth of the graph are traversed.)
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
图的遍历
- 构造图的邻接表，实现图的深度优先和广度优先算法。(Structure graph adjacency table, graph depth first and breadth-first algorithm.)
图的遍历。
- 7、无向图，根据任意一个初始顶点，输出图的深度优先搜索遍历路径和广度优先搜索遍历路径。