当前位置：
首页 资源下载
搜索资源 - graph adjacency list
搜索资源列表
-
0下载：
8.3.5利用邻接表图的深度优先生成树生成算法-8.3.5 adjacency list graph using depth-first spanning tree generation algorithm
-
-
2下载：
能够建立有向图无向图的邻接矩阵和邻接表表示法，深度优先和广度优先搜索，能够存储和显示相应的搜索结果（深度优先或广度优先生成森林（或生成树）、深度优先或广度优先序列和编号）。以文件形式输入图的顶点和边，并显示相应的结果。-To build a directed graph undirected adjacency matrix and adjacency list representation, depth-first and breadth-first search, to store and
-
-
0下载：
对任意给定的图（顶点数和边数自定），建立它的邻接表并输出，然后利用堆栈的五种基本运算（清空堆栈、压栈、弹出、取栈顶元素、判栈空）实现图的深度优先搜索遍历和广度优先搜索遍历算法。
-For any given graph (vertices and edges from the set), to establish its adjacency list and output, and then use the stack of five basic operations (empty stac
-
-
0下载：
1．定义图的数据结构。
2．编写函数，用邻接表实现图的存储结构，求图的顶点的度数。
3．编写函数，输出图的遍历序列。-1. Definition of graph data structure. 2. Write a function, with the adjacency list of the storage structure to achieve chart, find the vertex of degree. 3. Write a function, the output g
-
-
0下载：
编写程序以邻接矩阵或邻接表的方式存储指定连通图。然后分别用深度优先算法和广度优先算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。-Write a program to the adjacency matrix or adjacency list stored in a manner specified connected. Then were used to depth-first traversal algorithm and the breadth-first algorithm stor
-
-
0下载：
运用单链表和邻接矩阵实现图的表示、图的运算以及图的遍历-Used to achieve a single list and adjacency matrix graph representation, graph operations and graph traversal
-
-
0下载：
有关图的各种重要的操作，有图的邻接矩阵存储，链表存储，关键路径，最短路径，平衡二叉树等-The plan of the various important operation, has the adjacency matrix storage memory list, critical path, shortest path, balanced binary tree, etc.
-
-
0下载：
使用邻接表存储结构，编写一个程序，实现对有向图遍历操作。是用C++编写的程序源代码。-Storage structure using the adjacency list, write a program to achieve a directed graph traversal operations. Is a program written in C++ source code.
-
-
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
-
-
0下载：
线性规划 多段图 邻接表 最短路径-Multi-stage linear programming shortest path ,,,,,,,,,,,,,,,,,, adjacency list graph
-
-
0下载：
（1） 掌握图的邻接矩阵、邻接表、十字链表等不同存储形式的表示方法。
（2） 掌握图的两种不同遍历方法的基本思想并能编程实现。
（3） 掌握构造最小生成树的两种算法，即Prim 算法和Kruscal算法的思想，并能编程实现。
（4） 能够灵活运用图的相关算法解决相应的实际问题。
-(1) master the adjacency matrix, adjacency list, cross-linked forms of representation of different st
-
-
0下载：
用邻接表的方式建立有向，无向图，有向，无向网-Used to establish adjacency list, undirected graph, directed, undirected network
-
-
0下载：
使用图的深度遍历实现的邻接表存储结构和基本操作函数，在此基础上实现图的广度遍历算法-The use of graph traversal depth achieve adjacency list storage structure and basic operation function, on the basis of the realization of graph breadth traversal algorithm
-
-
0下载：
匈牙利算法，实现二分图问题的好途径，自己写的，是用邻接表来实现。-Hungarian algorithm for bipartite graph a good way to write your own adjacency list.
-
-
0下载：
已知图采用邻接表存储，写出深度优先搜索算法的非递归形式
对邻接表存储的图采用非递归的深度优先搜索
该程序只适合有向连通图，可以用邻接表这样的一个图进行测试-Figure adjacency list is stored to write a depth-first search algorithm non-recursive form of
Adjacency list stored in the diagram using non-recursive depth-first sea
-
-
0下载：
这个源代码包含了图的邻接矩阵和链表的两种存储方式、深度和广度的遍历以及prim
和kruskal最短路径两种算法。-The source code contains the adjacency matrix and list two storage mode, the breadth and depth of the traversal and prim
And kruskal shortest path of two algorithms.
-
-
0下载：
数据结构的邻接矩阵，邻接表，图的遍历等功能-Data structure of the adjacency matrix, adjacency list, and graph traversal
-
-
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
-
-
0下载：
Linked list graph, adjacency matrix using linked lists, linked list, Linked list graph, adjacency matrix using linked lists, linked list
-
-
0下载：
实验要求：（1）理解图顶点和边的存储方法：邻接矩阵和邻接表；（2）理解图的遍历算法，掌握其应用；（3）应用图的遍历算法判断图是否连通和两顶点间是否存在路径。-Experimental requirements: (1) to understand the storage method: Figure the vertices and edges adjacency matrix and adjacency list (2) to understand graph traversal algor
-
