搜索资源列表
-
0下载：
1． 利用克鲁斯卡尔算法求网的最小生成树。
2． 利用普里姆算法求网的最小生成树。
3． 要求输出各条边及它们的权值。-1. Using Kruskal algorithm for the minimum spanning tree network. 2. Use of the the prim algorithm for the minimum spanning tree. 3. Output edge and their weights.
-
-
0下载：
通信网中图论部分PRIM算法生成最小生成树的matlab程序-Communication network center theory of some PRIM algorithm to generate minimum spanning tree of the matlab program
-
-
0下载：
Prim算法
用Prim算法从u0出发构造网g的最小代价生成树-Prim Algorithm Prim algorithm constructed starting from u0 minimum cost spanning tree network g
-
-
0下载：
In computer science, Prim s algorithm is a greedy algorithm that finds a minimum spanning tree for a connected weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight o
-
-
0下载：
丛林中的路，利用最小生成树的prim（普利姆）算法，找最小值-Jungle road, using the minimum spanning tree prim (premium) algorithm, to find the minimum value
-
-
0下载：
小生成树其实是最小权重生成树的简称。一个有n个结点的连通图的生成树是原图的极小连通子图，且包含原图中的所有n个结点，并且有保持图连通的最少的边。最小生成树可以用kruskal（克鲁斯卡尔）算法或Prim（普里姆）算法求出。(The young adult tree is actually the abbreviation of the minimum power regeneration. The spanning tree of a connected graph with n nodes i
-
-
0下载：
1、定义邻接矩阵存储的图类Graph_Matrix .
2、实验验证如下算法的正确性、各种功能及指标：
1）创建一个邻接矩阵存储的图；
2）返回图中指定边的权值；
3）查找图中某顶点的第一个邻接顶点、某顶点关于另一个顶点的下一个邻接顶点序号；
3、4）图的深度优先遍历；
5）基于普里姆算法求最小支撑树。【选作】(1. Define the graph class Graph_Matrix which is stored by the adjacency matrix.
2. The
-
