Search - adjacency list graph

Search - adjacency list graph - List

[Other] shengdubianli DL : 0: 1.首先选定图的类别（有向图、无向图），再选定图的存储结构，根据输入的顶点或者边建立图；并把相应的邻接表或者邻接矩阵输出； 2.根据已有的邻接矩阵或邻接表用递归方法编写深度优先搜索遍历算法，并输出遍历结果； -1. First of all selected map type (directed graph, undirected graph), re-selected map storage structure, under the Importation of the establishment of the vertex or edge map and the corresponding adjacency list or adjacency matrix output 2. According to Some adjacency matrix or adjacency list prepared by the recursive depth-first search method traversal algorithm, and output traversal results
Date : 2026-01-10 Size : 1kb User : 异元
[Other] data_structure DL : 0: 广工--数据结构的课程设计郑纬民教授版图的十字链表实现图的邻接表实现 -Canton Public Works- data structure of the curriculum design Professor Zheng Weimin territory Cross linked lists to achieve the realization of graph adjacency list
Date : 2026-01-10 Size : 58kb User : 谢昀
[Other] shujujiegou DL : 0: 本程序主要实现以下有关的基本操作：（1）基本定义（2）创建图的邻接链表储存（3）图的邻接链表显示（4）图的邻接矩阵显示（5）图的邻接矩阵转化为邻接链表。-This procedure mainly realize the following basic steps: (1) basic definitions (2) create a graph adjacency list storage (3) graph adjacency list shows (4) graph adjacency matrix display (5) map adjacency matrix conversion for the adjacency list.
Date : 2026-01-10 Size : 1kb User : caojunchao
[Other] hj DL : 0: 图的算法实现（1）将图的信息建立文件；（2）从文件读入图的信息，建立邻接矩阵和邻接表；（3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。 -Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm.
Date : 2026-01-10 Size : 103kb User : 陈阳
[Other] tree DL : 0: 用树的应用模拟铁路查询功能。掌握图的邻接表的定义及应用,能够熟练使用邻接表。加强对map容器的理解，能够熟练使用map容器，复习集合和字典的相关知识。理解最短路径问题，并使用Dijkstra算法解决最短路径问题。掌握线形表的使用，并理解优先队列解决问题的过程。利用栈解决需要逆向输出的问题。 -Application of simulation using the tree railway inquiry function. Master graph adjacency list of definitions and applications, able to skillfully use the adjacency list. Enhance the understanding of map containers, able to skillfully use the map container, collection and review of the relevant knowledge dictionary. Understanding of the shortest path problem, and use the Dijkstra shortest path algorithm to solve the problem. To master the use of linear form, and understand the priority queue problem-solving process. Use the stack to resolve the issue of the need to reverse the output.
Date : 2026-01-10 Size : 2kb User : sunfuquan
[Other] graph DL : 0: 图的邻接链表及遍历及基本操作，节点的插入删除等基本操作，适合初级算法学习者-Adjacency list graph and traversal and basic operations, insertion node to delete such basic operations, suitable for primary algorithm learners
Date : 2026-01-10 Size : 155kb User : cscaoshang
[Other] yuio DL : 1: * 函数功能: 深度优先遍历邻接链表表示的图 * 输入参数: Graph_A G 邻接链表表示的图 -* Function: depth-first traversal of the graph adjacency list that* input parameters: Graph_A G said adjacency list of graph
Date : 2026-01-10 Size : 37kb User : 王超
[Other] cycles DL : 0: Write a program to decide if a graph has a cycle or not. The given graph can be a directed or undirected graph, which is indicated at the time of reading the input (0 for directed graph and 1 for undirected graphs). The input is given as an adjacency list.
Date : 2026-01-10 Size : 1kb User : jazz
[Other] EdgeDisjointCycles DL : 0: Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a program that reads in a vertex number and lists the number of edge disjoint cycles that start and end at this vertex. The output should also list the edges in each of the cycle discovered. Input will be the adjacency matrix preceded by a 0 or 1 representing Directed or Undirected graphs respectively.
Date : 2026-01-10 Size : 1kb User : jazz
[Other] Dijkstra DL : 0: 该问题为单元最短路经问题，求出一个有向图中两点之间权值最小的路径。 Dijkstra算法要求有向图中没有权值为负的边，有向图的信息由一个邻接表来表示，另外对每个顶点都设置一个属性d[v]，描述从源点到v的最短路经上权值的上界。算法中设置一个顶点集合S，反复选择具有最短路经估计的顶点u∈V-S,并将u加入S中，算法中还用到了顶点的最小优先队列，排序关键字为顶点的d值。-The issue of the shortest path problem as a unit, find a directed graph between two points of the path of minimum weight. Dijkstra algorithm requires no power to map the edge value is negative, the information to the map by an adjacency list to represent an additional set of each vertex is an attribute d [v], described from the source point to the most short-circuit v on the right by the upper bound value. Algorithm to set up a vertex set S, repeatedly choose the shortest path with the vertex is estimated u ∈ VS, will u join the S, the algorithm is also used in the vertex of the smallest priority queues, sorting for the vertex of the d keyword value.
Date : 2026-01-10 Size : 6kb User : 晶
[Other] disanti DL : 0: (1)自选存储结构，输入含n个顶点（用字符表示顶点名称）和e条边的图G； (2)指定任意顶点x为初始顶点，对图G作DFS遍历，输出DFS（深度优先）顶点序列(提示:使用栈实现DFS)； (3)指定任意顶点x为初始顶点，对图G作BFS（广度遍历），输出BFS顶点序列(提示:使用队列实现BFS)； (5)输入顶点x，查找图G:若存在含x的顶点，则删除该结点及与之相关连的边，并作DFS遍历(执行操作3)；否则输出信息“不存在x”； (6)判断图G是否是连通图，输出信息“YES”/“NO”； (7)如果选用的存储结构是邻接矩阵，则用邻接矩阵的信息生成图G的邻接表-(1) on-demand storage structure, input containing n vertices (with characters in the name of that vertex) and e edges of the graph G (2) specify arbitrary vertex x as the initial vertex of the graph G for the DFS traversal, output DFS (depth-first) vertex sequence (Hint: Use the stack to achieve DFS) (3) specify arbitrary vertex x as the initial vertex of the graph G for the BFS (breadth traversal), the output sequence of BFS vertex (hint: the realization of the use of queue BFS) (5) input vertex x, find graph G: If there is a vertex with x, then the deletion of the nodes and edges associated with them, and DFS traversal (3 steps) Otherwise output "does not exist x" (6) to determine whether graph G is a connected graph, output "YES"/"NO" (7) If I choose the storage structure is the adjacency matrix, the adjacency matrix of the information used to generate the adjacency list graph G
Date : 2026-01-10 Size : 3kb User : 涂舒
[Other] 4-creatDG DL : 0: 1、图的存储结构的定义和图的创建图的种类有：有向图、无向图、有向网、无向网。图的存储结构可采用：邻接矩阵、邻接表。要求：分别给出邻接矩阵和邻接表在某一种图上的创建算法 -1, Figure storage structure definition and diagram types to create plans are: a directed graph, undirected graph, directed networks, undirected networks. Map storage structure can be used: adjacency matrix, adjacency list. Requirements: respectively, the adjacency matrix and adjacency list are given a certain kind of graph creation algorithm
Date : 2026-01-10 Size : 1kb User : wanglin
[Other] 4-createNDN DL : 0: 解决如何表示图中顶点之间的关系。在教材中给出了邻接矩阵、邻接表、邻接多重表、十字链表四种存储结构，不同的存储结构有不同的应用范围（要求熟练掌握前两种存储结构）。-To resolve how to represent the relationship between the graph vertices. In the textbooks given adjacency matrix, adjacency list, adjacency of multiple tables, cross-linked list storage structure of four different storage structures have a different scope of application (which requires proficiency in the first two storage structures).
Date : 2026-01-10 Size : 1kb User : wanglin
[Other] tu3 DL : 0: 1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） 3 编写一个主函数，将上面函数连在一起，构成一个完整程序。 4 将实验源程序调试并运行。 -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 created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!) 3 to prepare a main function, the above function together to form a complete program. 4 source debugging and running the experiment.
Date : 2026-01-10 Size : 2kb User : 王欣
[Other] Traversing_Graph DL : 0: 树的邻接表表示和邻接矩阵表示，以及图的广度优先和深度优先遍历。-Tree adjacency list representation and adjacency matrix representation, and the graph breadth-first and depth-first traversal.
Date : 2026-01-10 Size : 294kb User : 董玉玺
[Other] directed_network DL : 0: 以邻接矩阵的方式确定有向网，完成： A．建立并显示出它的邻接链表； B．以非递归方式进行深度优先遍历，显示遍历的结果，（并随时显示栈的入出情况）； C．对该图进行拓补排序，显示拓补排序的结果，并随时显示入度域的变化情况； D．给出某一确定顶点到所有其他顶点的最短路径-Adjacency matrix to determine a directed network, the completion of: A. To establish and demonstrate its adjacency list B. Non-recursive approach to depth-first traversal, display the results of traversal, (and to keep out of the situation into the show stack) C. Sort of the graph topology, showing topology sort results and shows changes over time into the degree of changes in the domain D. Given a vertex to all other vertices to determine the shortest path
Date : 2026-01-10 Size : 3kb User : li
[Other] prefix1 DL : 0: Linked list graph, adjacency matrix using linked lists, linked list, Linked list graph, adjacency matrix using linked lists, linked list
Date : 2026-01-10 Size : 1kb User : Superman
[Other] tu DL : 0: （1）键盘输入数据，建立一个有向图的邻接表。（2）输出该邻接表。（3）建立一个无向图的十字链表。（4）在有向图的邻接表的基础上计算各顶点的度，并输出。（5）采用邻接表存储实现无向图的深度优先遍历。。（6）采用邻接表存储实现无向图的广度优先遍历。（7）以有向图的邻接表为基础实现并输出它的拓扑排序序列（8）采用邻接矩阵存储实现无向图的最小生成树的PRIM算法。（9）在主函数中设计一个简单的菜单，分别调试上述算法。-(1) keyboard input data, the establishment of a directed graph adjacency list. (2) the output of the adjacent table. (3) the establishment of an undirected graph Cross Chain. (4) to the adjacent table based on the calculation of each vertex of the degree, and outputs. (5) The adjacent table stores the depth-first traversal of undirected graph. . (6) adjacent table storage undirected graph breadth-first traversal. (7) to the adjacent table based to achieve adjacency matrix storage and output topological sorting sequence (8) PRIM algorithm undirected minimum spanning tree. (9) to design a simple menu in the main function, respectively commissioning of the above algorithm.
Date : 2026-01-10 Size : 6kb User : BidyBai
[Other] s6 DL : 0: 数据结构在图G中求一条从顶点i到顶点s 的简单路径。实验目的： 1、掌握图的各种存储结构，尤其熟练掌握邻接矩阵和邻接表存储结构； 2、熟练掌握图的深度优先遍历和广度优先遍历算法； 3、在遍历算法的基础上设计其他应用算法。 -Data structures and seek a graph G from vertex i to vertex s simple path. Experiment: a master chart of the various storage structures, especially proficient adjacency matrix and adjacency list storage structure 2, master graph depth-first traversal and breadth-first traversal algorithm 3, the traversal algorithm based on the design of other applications algorithms.
Date : 2026-01-10 Size : 1kb User : hank
[Other] Graph-Alothrim DL : 0: 利用邻接链表的形式存储图，并进行深度优先访问。-Using adjacency list is stored in the form of maps, and depth-first visit.
Date : 2026-01-10 Size : 2kb User : yaserjiang

« 12 »