搜索资源列表
undirectedgraphtraversing
- 此程序是学完数据结构课后，对无向图进行深度和广度遍历的c程序，vc6环境下测试通过。
123
- 在Borland C++ Builder 实现 图的深度和广度遍历
图的遍历演示
- 一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Descr iption many issues involving maps of algorithms are to traverse the map-bas
图的遍历
- 数据结构中关于图的遍历，任意建节点，深度优先和广度优先两种方法-data structure on the map traverse, arbitrary nodes built, the depth and breadth of priority priority two methods
图的遍历演示
- 一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Descr iption many issues involving maps of algorithms are to traverse the map-bas
linsang
- 很多涉及图上操作的算法都是以图的遍历操作为基础的，此程序演示出图的遍历的过程。通过邻接矩阵存储结构实现数据俄的输入，实现图的深度优先遍历和广度优先遍历过程的演示，对异常输入信息报错。-map of algorithms are plans to traverse the basis for the operation, this procedure demonstrated map out the ergodic process. Th
graphshguang
- 图的深度优先遍历和广度优先遍历，以邻接矩阵方式输入。（按照提示输入）！ -map the depth and breadth traversal priority priority traverse to the adjacency matrix input. (According to the prompt entry)!
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 m
diwuci
- 1）掌握图的邻接矩阵、邻接表、十字链表、邻接多重链表存储结构表示及其创建算法的c语言实现； 2）掌握图的深度优先搜索遍历算法和图的广度优先搜索遍历算法及C语言实现； -1) The master plan of the adjacency matrix, adjacency table, Cross linked lists, adjacency list multiple storage structure and expre
undirectedgraphtraversing
- 此程序是学完数据结构课后，对无向图进行深度和广度遍历的c程序，vc6环境下测试通过。-This procedure is finished the data structure after learning of undirected graph traversal for the depth and breadth of the c procedures, vc6 environment test.
123
- 在Borland C++ Builder 实现 图的深度和广度遍历-In Borland C++ Builder plans to achieve the depth and breadth of Ergodic
picture
- 实现图的遍历。对图的深度和广度的遍历，建立邻接矩阵与邻接表-The realization of graph traversal. To map the depth and breadth of the traverse, the establishment of adjacency matrix and adjacency list
GraphTraversal
- 图的遍历，实现图的深度和广度两种便利方式，方便快速。-Graph traversal, the realization of the depth and breadth of plans to facilitate the two way quickly and easily.
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)
sy10(1)
- 图的存储结构与遍历 （1）画出如图（1）所示无向图的邻接矩阵和邻接表，列出该图的广度优先遍历和深度优先遍历结果（选定A为出发点进行遍历）。 （2）画出如图（2）所示有向图的邻接矩阵和邻接表，列出该图的广度优先遍历和深度优先遍历结果（选定A为出发点进行遍历）(The storage structure of the graph and traversal (1) draw the adjacency matrix
图的深度和广度搜索
- 关于图的邻接矩阵的建立和广度和深度遍历结果显示(The establishment of the adjacency matrix of a graph and the result of the breadth and depth traversal)
图的遍历
- 构造图的邻接表，实现图的深度优先和广度优先算法。(Structure graph adjacency table, graph depth first and breadth-first algorithm.)