搜索资源列表
ass4
- 数据结构作业4：以数偶的形式依次从键盘上输入一串数据。如：(A，B)为从起始结点（其数据场之值为一大写的英文字母 A ），到终止结点（其数据场之值为一大写的英文字母 B）的无向边。最后输入（Z，Z）表示输入结束。请用无向图的邻接多重表存储该无向图，并注意一定要使用动态存储结构。-Data Structure Assignment 4: The order of a few even in the form of a string of data input from the keyboard.
tude
- 对任意给定的图（顶点数和边数自定），建立它的邻接矩阵并输出，然后利用队列的五种基本运算（置空队列、进队、出队、取队头元素、判队空）实现图的广度优先搜索算法-For any given graph (vertices and the number of edges from the set), to establish its adjacency matrix and the output, then use the queue of five basic operations (blank qu
2(2)
- 最小生成树之Prim算法 Prim算法用于求无向图的最小生成树 设图G =（V，E），其生成树的顶点集合为U。 ①、把v0放入U。 ②、在所有u∈U，v∈V-U的边(u，v)∈E中找一条最小权值的边，加入生成树。 ③、把②找到的边的v加入U集合。如果U集合已有n个元素，则结束，否则继续执行②。 其算法的时间复杂度为O(n^2) Prim算法实现： （1）集合：设置一个数组set(i=0,1,..,n-1),初始值为 0,代表对
tt0703
- 搜索算法。无向图的邻接表存储，深度优先搜索-Undirected graph of adjacency table storage, depth-first search
graphoperation
- 根据从键盘输入的数据创建图（图的存储结构可采用邻接矩阵或邻接表），并对图进行深度优先搜索和广度优先搜索（实验类型：验证型） 1）问题描述：在主程序中提供下列菜单： 1…图的建立 2…深度优先遍历图 3…广度优先遍历图 0…结束 2）实验要求：图的存储可采用邻接表或邻接矩阵；定义下列过程： CreateGraph(): 按从键盘的数据建立图 DFSGrahp()：深度优先遍历图 BFSGrahp()：广度优先遍历图-According to dat
sort
- 给出一个有向图，采用邻接表存储方式，增加一个记录顶点入度的数据域，编写算法输出一个拓扑序列。-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.
PrimAlgorithm
- 数据结构——邻接矩阵表示图，普里姆算法程序实现最小生成树-Data structure- adjacency matrix graph, Prim algorithm for minimum spanning tree procedure
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
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
lisanshuxushiyan3
- 以偶对的形式输入一个无向简单图的边，建立该图的邻接矩阵，判断图是否连通（A）。并计算任意两个结点间的距离（B）。对不连通的图输出其各个连通支（C）。-Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph (A). And calculate any distance betwe
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
2
- 有向图的弗洛伊德算法，输入邻接矩阵 输出结果-Freud directed graph algorithms, the output of the input adjacency matrix
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
linjiejuzhen
- 8.3.1利用邻接矩阵的图广度优先遍历算法-8.3.1 Using the adjacency matrix of the graph breadth-first traversal algorithm
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
router
- 路由算法，对图进行最短路径选择，只需更改最大结点个数，邻接矩阵即可使用。-Routing algorithm, the shortest path to the graph selection, simply change the maximum number of nodes, the adjacency matrix can be used.
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