搜索资源列表
1
- 1.建立一个无向图的邻接表存储 2。对该图进行深度优先搜索,按顺序输出所访问的-1. The establishment of an undirected graph in adjacency list is stored 2. Depth-first search of the graph, according to the order of the output of the visit
Graph2vertexpathproblem
- 试基于图的深度优先搜索策略编写一程序,判断以邻接表方式存储的有向图中是否存在 由顶点Vi到Vj顶点的路径。 -Test graph-based depth-first search strategy for the preparation of a program to determine ways to adjacency list stored in the existence of a directed graph from vertex Vi to vertex Vj pat
GraphTravell
- 图基于邻接表的创建以及深度优先遍历和广度优先遍历-Graph based on adjacency list creation, as well as depth-first traversal and breadth-first traversal
4
- 用邻接表表示图的拓扑排序算法-failed to translate
ds_5
- 1.定义图的数据结构。 2.编写函数,用邻接表实现图的存储结构,求图的顶点的度数。 3.编写函数,输出图的遍历序列。-1. The definition of graph data structure. 2. Write a function, using adjacency list implementation diagram of the storage structure, find the vertex of degree. 3. Write a function, the o
dijkstra_b
- 单源最短路径,用于路权相等的情况,dijkstra优化为bfs,邻接表形式,复杂度O(m)-Single-source shortest path for the right of way case of a tie, dijkstra optimization bfs, adjacency list form, complexity of O (m)
ijkstra_binary_heap
- 单源最短路径,dijkstra算法+二分堆,邻接表形式,复杂度O(mlogm)-Single-source shortest path, dijkstra algorithm+ 2 sub-heap, adjacency list form, complexity of O (mlogm)
tu3
- 1 创建给定图的存储结构,从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历,给出遍历过程中的顶点序列。 3 求图的最小生成树,按构造顺序输出边的序列。(两种方法都要求!) 3 编写一个主函数,将上面函数连在一起,构成一个完整程序。 4 将实验源程序调试并运行。 -Create a storage structure of a given graph from the adjacency list and adjacency matrix
jsj
- 1 创建给定图的存储结构,从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历,给出遍历过程中的顶点序列。 3 求图的最小生成树,按构造顺序输出边的序列。(两种方法都要求!) -Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps
main
- Descr iption: 采用邻接表表示有向图,完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型,图中顶点序号按字符顺序排列,边的输入按照边的顶点序号从小到大的顺序排列,如下图的边的输入顺序为0 1,0 2,0 3,1 2,1 3,2 4,3 4共七条边,邻接表的边结点采用头插法。本输入样例中所用的图如下所示: Input Format: 第一行输入两个值,第一个是图中顶点的个数,第二个是图中边的条数 第二行输入各顶点的信息,即输入每个顶点字
7-2-1
- 图的基本运算,包括邻接矩阵,邻接表存储。还有图的深度优先,广度优先算法,老师写的-Map basic operations, including the adjacency matrix, adjacency list is stored. There are also a depth-first, breadth-first algorithm, the teacher wrote
basicoperationformap
- 包括了图的大部分基本算法,每一种算法都以邻接矩阵与邻接表两种形式给出,算法包括建图,图的遍历(如DFS和BFS),最小生成树,从某个源点到蓁各顶点的最短路径等-Includes most of the basic graph algorithms, each algorithm is to adjacency matrix and adjacency list is given in two forms, algorithms, including the construction of map
gragh
- 程序功能:1.建立无向非连通图的邻接表存储结构,要求顶点个数不少于15个。 2.用DFS及BFS对此邻接表进行遍历,打印出两种遍历的顶点访问顺序。 3.给定图中任意两个顶点v1和v2及整数k,判断是否存在从v1到v2的路径长度 为k的简单路径,若有打印出路径上的顶点序列(要求路径上不含回路)。 (该功能未能实现)-graph
linjiebiao
- 用VC++环境和邻接表存储结构实现图论中的简单路劲-Implementation diagram of the simple Road King
graph
- 数据结构。用C语言描写。定义图,邻接表,确定节点在图中的位置,建立邻接表,邻接矩阵等-Data structure. Using C language descr iption.
Adjacencylist
- 邻接表表示的深优.zip 邻接表表示的广优.zip-Adjacency table that the deep superior. Zip adjacency list that wide priority. Zip
map
- 1)建立图的邻接表 (2)实现邻接表表示图的深度方向周游 -1) to establish the adjacency list (2) adjacency table that map to achieve the depth direction of travel
zuixiaoshengchengshu
- 图(邻接表存储) 的遍历-图(邻接表存储) 的遍历
3041
- poj 第3041_Asteroids题,最小顶点覆盖 网络流 最小割 邻接表-poj first 3041_Asteroids problem, minimum vertex cover network flow minimum cut adjacency list
Topology
- 1用邻接表作为图的存储结构; 2用非递归的方法实现拓扑排序;-A map with the adjacency table as the storage structure two ways to achieve a non-recursive topological sorting