Search - Adjacency lists

Search - Adjacency lists - List

[Data structs] diwuci DL : 0: 1）掌握图的邻接矩阵、邻接表、十字链表、邻接多重链表存储结构表示及其创建算法的c语言实现； 2）掌握图的深度优先搜索遍历算法和图的广度优先搜索遍历算法及C语言实现； -1) The master plan of the adjacency matrix, adjacency table, Cross linked lists, adjacency list multiple storage structure and express language to create algorithms realize c 2) grasp the depth-first search graph traversal algorithm and the graph breadth-first search traversal algorithm and C language
Date : 2026-01-02 Size : 36kb User : ma
[Data structs] tu-matrix DL : 0: 图可以采用邻接矩阵、邻接表等多种方式来存储，本程序实现图的邻接矩阵存储-Chart can be used adjacency matrix, adjacency lists to store a variety of ways, this program graph adjacency matrix storage
Date : 2026-01-02 Size : 1kb User : youjing
[Data structs] XHstudent DL : 0: 1.对多个链表进行操作 2.回溯法求解0/1背包 3.分枝限界法求解0/1背包 4.回溯法求解n—皇后问题 5.图的操作（邻接表表示）-1. Operate on multiple lists 2. Backtracking method for solving 0/1 knapsack 3. Branch and bound method for solving 0/1 knapsack 4. Backtracking to solve n-queens problem 5. Graph operation (adjacency list representation)
Date : 2026-01-02 Size : 243kb User : 晓枫
[Data structs] ShortestPath DL : 0: 用邻接链表做的最短路径算法迪杰斯特拉算法可以实现大数据量的计算-Adjacency lists to do with the shortest path algorithm can count 法迪杰斯特拉 calculation of a large amount of data
Date : 2026-01-02 Size : 5.18mb User : 杨柳强
[Data structs] data-structure-Graph DL : 1: 本软件围绕无向图的应用这一主题，用图形化的界面实现了无向图的建立、显示邻接表、动态构造最小生成树（分别利用Prim算法和Kruscal算法）、查找最短路径等功能。具体功能：给定一个图，完成：（1）建立并显示出它的邻接链表（2）分别用普里姆算法和克鲁斯卡尔算法构造其最小生成树，随时显示其构造的过程（3）给出某一确定顶点到所有其他顶点的最短路径（4）给出每一对顶点之间的最短路径说明：程序开发时所用的文件和源码在文件夹“配套文件”中提供。另附说明文档。-This software around the theme of directed graph, use the graphical interface to achieve the establishment of an undirected graph, showing the adjacent table, the dynamic construction of minimum spanning tree (Prim algorithm and Kruscal algorithm), find the shortest path. Specific features: Given a graph, complete: (1) to establish and demonstrate its adjacency lists (2) the algorithm of Prim and Kruskal algorithm construct the minimum spanning tree, ready to show the process of its construction (3) gives the shortest path to determine a vertex to all other vertices (4) gives the shortest path between each pair of vertices Description: used in program development and source files in the folder "supporting documents". Attach a separate sheet document.
Date : 2026-01-02 Size : 2.91mb User : lsc
[Data structs] aaaa DL : 0: 1) 先任意创建一个图； 2) 图的DFS,BFS的递归和非递归算法的实现 3) 最小生成树（两个算法）的实现，求连通分量的实现 4) 要求用邻接矩阵、邻接表、十字链表多种结构存储实现-A) any first create a graph 2) DFS, BFS recursive and non recursive algorithm 3) The minimum spanning tree (algorithm) to achieve, find the connected components to achieve 4) request with adjacency matrix, adjacency list cross-linked lists a variety of structural storage implementation
Date : 2026-01-02 Size : 4kb User : liliaaa
[Data structs] ALGraph DL : 0: 邻接链表图的代码实现，VC++开发平台，C语言描述的数据结构。-Source implementation of the adjacency lists map, VC++ development platform, the C language to describe the data structure.
Date : 2026-01-02 Size : 205kb User : 李海锋
[Data structs] linjielianbiao DL : 0: 大学数据结构上机作业，C++语言写的邻接链表，练习邻接链表的工作机制。-Data structures, the use of adjacency lists
Date : 2026-01-02 Size : 1kb User : 党阳