搜索资源列表
tubianliyanshi
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-table storage structure, connectivity undirected graph depth first and breadth-first traversal. User-specified node as a starting point, respectively, under
shenduyouxiansousuo(linjiebiao)
- 图的遍历，用邻接表实现图的深度优先搜索建的工程实现-Graph traversal, with the adjacency list graph depth-first search to achieve the construction of the project implementation
tudebianliguochegn
- 图邻接矩阵_邻接表的建立 图的遍历课程设计-_ Adjacency list graph adjacency matrix graph traversal establishment of curriculum design
tudebianli
- 图的深度遍历和广度遍历（以邻接表为存储结构）-The depth and breadth traversal graph traversal (in the adjacent table for the storage structure)
graph
- 1、在文本文件中按照一定的格式存储图的数据 2、从文件中读入该信息，并且构造两种存储方式 3、输出两种存储方式，并进行转化，看是否得到了正确的结果 4、在邻接表的基础上实现图的遍历操作 5、编写图的最小生成树算法，并进行验证 6、编写最短路径算法，并对输入的图进行验证 -1, in a text file format according to certain data stored in Figure 2, read from the file of the infor
linjiebiaodetu
- 8.3.2利用邻接表的图广度优先遍历算法-8.3.2 Using the adjacency list of graph breadth-first traversal algorithm
shenduyouxian
- 8.3.2利用邻接表的图广度优先遍历算法-8.3.2 Using the adjacency list of graph breadth-first traversal algorithm
BFSandDFSList
- 对数据结构中图一部分采用邻接表实现无向图的建立、深度优先遍历和广度优先遍历算法实现，成功运行，有测试数据-Part of the data structure used in the adjacent table to achieve the establishment of an undirected graph, depth-first traversal and breadth-first traversal algorithm, the successful operation, a t
092880-4
- 图的相关操作，涉及到邻接矩阵，邻接表，深度优先、广度优先遍历等等。-Graph related operations, involving adjacency matrix, adjacency table, depth first, breadth-first traversal and so on.
Graph
- 运用单链表和邻接矩阵实现图的表示、图的运算以及图的遍历-Used to achieve a single list and adjacency matrix graph representation, graph operations and graph traversal
tudebianli
- 使用邻接表存储结构，编写一个程序，实现对有向图遍历操作。是用C++编写的程序源代码。-Storage structure using the adjacency list, write a program to achieve a directed graph traversal operations. Is a program written in C++ source code.
tudecaozuo
- 有向图,无向图基本操作,包括: 1、邻接矩阵 2、邻接表 3、深度优先遍历 4、广度优先遍历 5、最小生成树 6、拓扑排序 7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-Directed graph, undirected graph, basic operations, including: 1, 2 adjacency matrix, adjacency table 3, 4 depth-first traversal, breadth-f
yy5
- 1．定义图的数据结构。 2．编写函数，用邻接表实现图的存储结构，求图的顶点的度数。 3．编写函数，输出图的遍历序列。 -1. Define the graph data structure. 2. Write functions to achieve with the adjacency list graph storage structure, find the vertex degree. 3. Write function, the output graph traversal
CSharp---DFS-BFS
- 实现图的交互输入，可创建邻接表，还可进行深度优先遍历广度优先遍历，拓扑排序等-To achieve interactive map input, you can create adjacency table, but also for the breadth-first traversal depth-first traversal, topological sorting
The-graph-traversing-algorithm
- 以邻接矩阵或邻接表为存储结构，以用户指定的顶点为起始点，实现无向连通图的深度优先及广度优先搜索遍历，并输出遍历的结点序列-The adjacency matrix or adjacency list for the storage structure to user-specified vertex as a starting point to achieve a connected undirected graph of the depth-first and breadth-first se
graph
- 图的非递归深度优先遍历，建图是以邻接表为基础的-graph search
source_code
- 1.排序算法：快排，插入排序，选择排序，冒泡排序，堆排，归并排序 2.无向图：建立邻接表，并深度遍历 3.二叉树：建树，插入叶子节点并删除，计算深度及高度，前序中序后序遍历，以及用栈实现的非递归遍历 4.二叉排序树：建树并插入、删除结点 5.通讯录：有主界面，能添加，删除查找相应的数据-1.sort:quicksort select sort,insert sort,heap sort.etc. 2.graph:create with the adjacent list,an
Bfs-Dfs
- 在C环境中使用Bfs，Dfs的遍历算法创建邻接表建立图。-C environment Bfs Dfs traversal algorithm to create an adjacency table to create the diagram.
Graph
- 使用邻接表作为存储结构构造图，并完成图的建立，深度遍历，广度遍历-Structural map as a storage structure with the adjacency list, and complete the establishment of the Figure, deep traversal, breadth traversal
Graph-traversal
- 以邻接多重表为存储结构，实现无向连通图的深度优先和广度优先遍历。-This paper is to solve the traversal of the graph using DFS BFS