搜索资源列表
neibor_chat
- 这个程序提供了数据结构邻接表的一种实现方法，程序简洁易懂-This program provides an adjacency list data structure implementations, procedures, and easy to read
a
- 邻接表的创建 显示 图的建立以及求最短路径 floyd算法 -Adjacency table is created and displayed diagrams of the shortest path algorithm floyd
sxz
- 怎么判断一个采用邻接表结构的有向图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
130572
- 单源最短路径问题的动态规划算法 输入要求：结点数目n，图的邻接表结点的数据 输出要求： 第一行：原点s到终点t的最短路径长度 第二行：最短路径之一，如：6 5 3 1 0 第三行：最短路径之二，… -Single-source shortest path problem requires the dynamic programming algorithm input: the number of nodes
AdjGraph
- c++实现数据结构中图的邻接表存储以及基本操作-c++ data structures stored in the adjacency table and the basic operations
tu2
- 建立图的邻接表存储，并且要显示邻接表数据。-Establishment of the adjacency table storage, and adjacency table to display data.
DFSBFS
- 设计一个有向图，建立图的邻接矩阵或邻接表的存储结构，完成有向图的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
graph_C(1)
- 建立无向图的邻接矩阵存储；对已经建立的无向图进行深度优先和广度优先遍历操作。建立有向图的邻接表存储；对已经建立的有向图进行深度优先和广度优先遍历操作。 -Establishment of the adjacency matrix storage on the already established undirected graph depth first and breadth-first traversal operation. Establish a table to store th
tubianli
- 对图的邻接表表示进行深度优先遍历和广度优先遍历。-The adjacency list representation of the depth-first traversal and breadth-first traversal.
graph
- 以邻接矩阵或是邻接表作为存储结构建立一个无向图，进行深度或广度遍历，输出遍历序列-Adjacency matrix or adjacency list to store the structure as a undirected graph, the depth or breadth traversal, output traversal sequence
XHstudent
- 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
linjiebiaodetu
- 8.3.2利用邻接表的图广度优先遍历算法-8.3.2 Using the adjacency list of graph breadth-first traversal algorithm
shenduyouxian
- 8.3.2利用邻接表的图广度优先遍历算法-8.3.2 Using the adjacency list of graph breadth-first traversal algorithm
shengchengshu
- 8.3.5利用邻接表图的深度优先生成树生成算法-8.3.5 adjacency list graph using depth-first spanning tree generation algorithm
mproject
- （1）以邻接表作存储结构； （2）源点可任意指定；输出从源点到其余各顶点的最短路径； -The shortest path between vertex programming
XGraph2
- 能够建立有向图无向图的邻接矩阵和邻接表表示法，深度优先和广度优先搜索，能够存储和显示相应的搜索结果（深度优先或广度优先生成森林（或生成树）、深度优先或广度优先序列和编号）。以文件形式输入图的顶点和边，并显示相应的结果。-To build a directed graph undirected adjacency matrix and adjacency list representation, depth-first and breadth-first search, to store and
pic
- 对任意给定的图（顶点数和边数自定），建立它的邻接表并输出，然后利用堆栈的五种基本运算（清空堆栈、压栈、弹出、取栈顶元素、判栈空）实现图的深度优先搜索遍历和广度优先搜索遍历算法。 -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
juiegou
- 用邻接表保存中压配电网拓扑结构，，，配合实现配网编程-Adjacency table holds with medium voltage distribution network topology,,, with the programming of Distribution Network
BFSandDFSList
- 对数据结构中图一部分采用邻接表实现无向图的建立、深度优先遍历和广度优先遍历算法实现，成功运行，有测试数据-Part of the data structure used in the adjacent table to achieve the establishment of an undirected graph, depth-first traversal and breadth-first traversal algorithm, the successful operation, a t
PBFSandDfsList
- 数据结构中对有向图采用邻接表为存储结构实现对有向图的建立、深度优先遍历和广度优先遍历，同样有测试数据-Data structure of a directed graph with adjacency table for the storage structure to achieve the establishment of a directed graph, depth-first traversal and breadth-first traversal, the same test da