Search - adjacency list graph

Search - adjacency list graph - List

[Data structs] Diagram DL : 0: 图的操作,包括,图的基本存储方法,有关图的操作算法并用C语言编程实现,图的搜索路径的遍历方法,以邻接矩阵和邻接表的方式存储连通图。然后分别用优先深度算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。深度优先遍历的递归算法（1）深度优先遍历算法（2）邻接表表示的深度优先搜索算法（3）邻接矩阵表示的深度优先搜索算法.-plan of operation, including, map the basic storage methods, the operation of the map algorithm and C language programming. map of the search path traversal methods to the adjacency matrix and adjacency list of storage connected graph. Then, using the priority traversal algorithm depth of the matrix adjacent to the storage map and the adjacent forms storage plans. Depth-first traversal of the recursive algorithm (1) depth-first traversal algorithm (2) adjoining table depth-first search algorithm ( 3) adjacency matrix of depth-first search algorithm.
Date : 2026-01-10 Size : 1kb User : 林静
[Data structs] SavageAndMonksProblem DL : 0: 野人和修道士问题。（要求用图的邻接表的存储结构实现）题目：假设有N个修道士和N个野人准备渡河，为了防止野人侵犯修道士，要耱无论在何处，修道士的人数不得少于野人的个数（除非修道士个数为0）他们两个都会划船-Savage and monks problems. (Required to use the adjacency list graph storage structure) Title: The assumption that N and N of monks prepare a wild man to cross the river in order to prevent the savage violations of monks, it is necessary to耱wherever, the number of monks should not be less than Savage
Date : 2026-01-10 Size : 26kb User : 常雅敏
[Data structs] ljb DL : 0: 用邻接表实现个图的存储，在VISUAL C++环境中实现-Realize using adjacency list of graph storage, in VISUAL C++ Environment
Date : 2026-01-10 Size : 1kb User : pallas
[Data structs] tu DL : 0: 图的建立，图的广度优先遍历，深度优先遍历，邻接表等，c语言-Chart the establishment of the breadth-first graph traversal, depth-first traversal, such as adjacency list, c language
Date : 2026-01-10 Size : 4kb User : 杨飞
[Data structs] graph DL : 1: 实现了图的主要操作:（1）分别用邻接矩阵和邻接表实现图的基本操作（包括图的广度和深度优先搜索）；(2）判断该图是否连通，输出该图的连通分量数目；（3）输出一个每一个连通分量的最小生成树。-The main achievement of the plan steps: (1), respectively, with adjacency matrix and adjacency list to achieve the basic map operations (including map the breadth and depth-first search) (2) to determine whether the connectivity of the graph, the output of the graph the number of connected components (3) the output of a connected component of every minimum spanning tree.
Date : 2026-01-10 Size : 20kb User : 李雅芳
[Data structs] tu-table DL : 0: 图可以采用邻接矩阵、邻接表等多种方式存储，本程序实现图的邻接表存储-Chart can be used adjacency matrix, adjacency list a variety of ways, such as storage, this procedure realize Graph Adjacency List Storage
Date : 2026-01-10 Size : 1kb User : youjing
[Data structs] datastructure DL : 0: 设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函数输入数据进行测试-Design category adjacency list, realize undirected graph of the depth-first traversal non-recursive, non-directed graph breadth-first traversal, and the design of the main function of the input data for testing
Date : 2026-01-10 Size : 1.32mb User : lindaoming
[Data structs] Graph DL : 0: 依靠链表结构实现的图像(Graph)类抽象数据结构-graph ADT implemented by an Adjacency List structure
Date : 2026-01-10 Size : 14kb User : unknown9218
[Data structs] graph DL : 0: 图：调试图的邻接链表存储的程序，解决下列问题：根据教科书P157页的G2图（无向图），输入数据运行程序；再适当修改程序使它适用于G1图（有向图），输入数据运行程序。-Adjacency list graph debug stored procedures, to address the following issues: According to the textbook page G2 Fig P157 (undirected graph), input data to run programs modify the program so that it no longer appropriate for G1 plan (directed graph), input data run the program.
Date : 2026-01-10 Size : 105kb User : 奈奈
[Data structs] graph DL : 0: 有向图的邻接表存储的实现，包括有向图的各种操作-Directed graph adjacency list storage implementation, including a variety of operations to the map
Date : 2026-01-10 Size : 4kb User : 房春英
[Data structs] GraphTravell DL : 0: 图基于邻接表的创建以及深度优先遍历和广度优先遍历-Graph based on adjacency list creation, as well as depth-first traversal and breadth-first traversal
Date : 2026-01-10 Size : 234kb User : 欧阳云飞
[Data structs] graph.yangxu DL : 0: 熟悉图的存储方式，实现图的邻接矩阵或者邻接表的存储方式下的基本运算，特别是深度遍历和广度遍历；掌握以图为基础的一些常用算法，如最小生成树、拓扑排序、最短路径等。-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 traversal traverse to attempt to grasp the basis of some commonly used algorithms, such as minimum spanning tree, topological sorting, shortest path and so on.
Date : 2026-01-10 Size : 248kb User : 胡顶豪
[Data structs] shenduyouxiansousuo(linjiebiao) DL : 0: 图的遍历，用邻接表实现图的深度优先搜索建的工程实现-Graph traversal, with the adjacency list graph depth-first search to achieve the construction of the project implementation
Date : 2026-01-10 Size : 313kb User : 刘月
[Data structs] graph DL : 0: 可以实现深度和广度的查询，同样也可以图计算出它的邻接矩阵和邻接表-Can achieve the depth and breadth of the inquiry, as it can map to calculate the adjacency matrix and adjacency list
Date : 2026-01-10 Size : 309kb User : 小鱼
[Data structs] graph DL : 0: 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 information, and construct two storage mode 3, the output two storage methods, and converted to see the results of the correct 4 in the adjacency list graph traversal based on the operation of 5, prepared for the minimal spanning tree algorithm, and validated 6, the preparation of the shortest path algorithm, and validate the input graph
Date : 2026-01-10 Size : 5kb User : mehope
[Data structs] graph DL : 0: 有向图采用邻接表存储 DFS和BFS方法遍历为方便表示,结点数小于10 用V0-V9表示不同的结点的-Directed graph using adjacency list method of storing DFS and BFS traversal for the convenience that the number of nodes is less than 10 with V0-V9 for different node
Date : 2026-01-10 Size : 2kb User : 刘少东
[Data structs] graph DL : 0: 以邻接矩阵或是邻接表作为存储结构建立一个无向图，进行深度或广度遍历，输出遍历序列-Adjacency matrix or adjacency list to store the structure as a undirected graph, the depth or breadth traversal, output traversal sequence
Date : 2026-01-10 Size : 14kb User : 孙亚云
[Data structs] shengchengshu DL : 0: 8.3.5利用邻接表图的深度优先生成树生成算法-8.3.5 adjacency list graph using depth-first spanning tree generation algorithm
Date : 2026-01-10 Size : 1kb User : 大无
[Data structs] graph DL : 0: 用邻接表的方式建立一个图，可以对这个图进行删除边，增加边，删除增加节点，和深度广度优先搜索-With the adjacency list of ways to build a map, you can delete the edges of this graph, increasing side, remove the added nodes, and depth of breadth-first search
Date : 2026-01-10 Size : 175kb User : jaychou
[Data structs] yy5 DL : 0: 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 sequence.
Date : 2026-01-10 Size : 173kb User : 武朝阳

« 12 3 4 »