当前位置：
首页 资源下载
搜索资源 - graph adjacency list
搜索资源列表
-
0下载：
学习数据结构时编写的有关二叉树基本运算实现，有向图和邻接矩阵，邻接表的转换，输出某矩阵转置矩阵的三元组以及两矩阵进行运算后结果用三元组表示，在学习VC程序设计写了一个简单的机场不同型号车辆的收费系统。-Learning data structures to prepare basic operations on binary tree realization of a directed graph and the adjacency matrix, adjacency list of the c
-
-
0下载：
1、 图的存储结构的定义和图的创建
图的种类有：有向图、无向图、有向网、无向网。
图的存储结构可采用：邻接矩阵、邻接表。
要求：分别给出邻接矩阵和邻接表在某一种图上的创建算法
-1, Figure storage structure definition and diagram types to create plans are: a directed graph, undirected graph, directed networks, undirected networks.
-
-
0下载：
建立有向图的邻接表. 图的信息从键盘输入。-create the adjacency list of a directed graph. Input the information of the graph through keyborad.
-
-
0下载：
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
-
-
1下载：
试基于图的深度优先搜索策略编写一程序，判断以邻接表方式存储的有向图中是否存在
由顶点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
-
-
1下载：
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
-
-
0下载：
1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。
2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。
3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！）
3 编写一个主函数，将上面函数连在一起，构成一个完整程序。
4 将实验源程序调试并运行。
-Create a storage structure of a given graph from the adjacency list and adjacency matrix
-
-
0下载：
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
-
-
0下载：
包括了图的大部分基本算法，每一种算法都以邻接矩阵与邻接表两种形式给出，算法包括建图，图的遍历（如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
-
-
0下载：
树的邻接表表示和邻接矩阵表示，以及图的广度优先和深度优先遍历。-Tree adjacency list representation and adjacency matrix representation, and the graph breadth-first and depth-first traversal.
-
-
0下载：
以邻接矩阵的方式确定有向网，完成：
A．建立并显示出它的邻接链表；
B．以非递归方式进行深度优先遍历，显示遍历的结果，（并随时显示栈的入出情况）；
C．对该图进行拓补排序，显示拓补排序的结果，并随时显示入度域的变化情况；
D．给出某一确定顶点到所有其他顶点的最短路径-Adjacency matrix to determine a directed network, the completion of: A. To establish and demonstrate its adj
-
-
4下载：
《数据结构》课程设计
建立并显示出有向图的邻接链表；
对该图进行拓扑排序，显示拓扑排序的结果，并随时显示入度域的变化情况；
给出它的关键路径（要求：显示出VE,VL,E,L,L-E的结果）。-" Data Structure" Course Design has established and demonstrated to the adjacency list the topological sort graph shows the results of top
-
-
0下载：
图的遍历，用邻接表实现图的深度优先搜索建的工程实现-Graph traversal, with the adjacency list graph depth-first search to achieve the construction of the project implementation
-
-
0下载：
图邻接矩阵_邻接表的建立
图的遍历课程设计-_ Adjacency list graph adjacency matrix graph traversal establishment of curriculum design
-
-
0下载：
给出一个有向图，采用邻接表存储方式，增加一个记录顶点入度的数据域，编写算法输出一个拓扑序列。-A directed graph given by adjacency list is stored, a record increase in the degree of vertex data into the field, the preparation of a topological algorithm output sequence.
-
-
0下载：
怎么判断一个采用邻接表结构的有向图G是否为强连通图? 强连通块划分代码实现-Adjacency list used to determine how the structure of a directed graph G is a strongly connected graph? Strongly connected block of code division
-
-
0下载：
设计一个有向图，建立图的邻接矩阵或邻接表的存储结构，完成有向图的DFS（深度优先遍历）和BFS（广度优先遍历）的操作-Design of a directed graph, the establishment of the adjacency matrix or adjacency list of the storage structure, complete directed graph DFS (depth-first traversal) and BFS (breadth-first tr
-
-
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 pr
-
-
0下载：
8.3.2利用邻接表的图广度优先遍历算法-8.3.2 Using the adjacency list of graph breadth-first traversal algorithm
-
-
0下载：
8.3.2利用邻接表的图广度优先遍历算法-8.3.2 Using the adjacency list of graph breadth-first traversal algorithm
-
