Search - adjacency list graph

Search - adjacency list graph - List

[CSharp] graph DL : 0: 以邻接表为存储结构实现无向图的深度遍历和图的广度遍历。-Adjacency list storage structure undirected depth traversal of Figure and Figure breadth traversal.
Date : 2026-01-10 Size : 405kb User : 星辰
[CSharp] tu DL : 0: 分别写出用邻接矩阵和邻接表做图的存储结构，并分别实施广度优先遍历和深度优先遍历。-Write down made graph adjacency matrix and adjacency list storage structure, and implement the depth-first traversal and breadth-first traversal
Date : 2026-01-10 Size : 2kb User : 梁有艺
[CSharp] Adjacency-matrix DL : 0: 分别以邻接矩阵和邻接表的存储结构建立图。分别对图进行深度优先遍历和广度优先遍历。求图中边的数目。求顶点0到图中其余每个顶点的最短路径-Respectively adjacency matrix and adjacency list storage structure created map. Respectively graph depth-first traversal and breadth-first traversal. In the figure, the number of edges. Find graph vertex 0 to each of the remaining vertices of the shortest path
Date : 2026-01-10 Size : 3kb User : yokko
[CSharp] Graph DL : 0: 基于Virtual C++的数据结构中图的应用，能实现从文件输入有向图和无向图易邻接表和邻接矩阵的形式在屏幕输出，同时能实现无向图的深度遍历输出和广度遍历输出；kruskal算法和Prim算法实现最小生成树的创建；Dijkstra算法实现最短路径的计算；以及最小偏心距的计算。-Application of data structure of Virtual in C++ based on graph, can be achieved the file input directed graphs and undirected graph adjacency list and the adjacency matrix is easy to form on the screen output, at the same time, can realize the undirected graph depth first traversal and breadth traversal output output Kruskal algorithm and Prim algorithm to achieve the creation of the Oki Nariki Dijkstra algorithm the shortest path calculation and the calculation of minimum eccentricity.
Date : 2026-01-10 Size : 1.03mb User : 易新宇
[CSharp] include DL : 0: 1）编程递归实现0-1背包问题并回溯求出问题的解向量（即X[N]的值）和多段图的最短路经问题的动态规划算法。 2）图的数据结构采用邻接表。 3）要求用文件装入5个多段图数据，编写从文件到邻接表的函数。 4）验证算法的时间复杂性。 5）0-1背包问题的实验数据见实验二的背包问题数据。 -1) programming recursive implementation of the 0-1 knapsack problem and backtracking to solve the problem of the solution vector (i.e. X[N] value) and the shortest path problem of multi segment graph by the dynamic programming algorithm. 2) the data structure of the graph uses the adjacency list. 3) the requirement to load the file into 5 multi- section data, write the function the file to the adjacency list. 4) the time complexity of the algorithm is verified. 5) the experimental data of the 0-1 knapsack problem is found in the experimental data of two knapsack problem.
Date : 2026-01-10 Size : 12kb User : 陈倩