Description: 最小生成树的kruskal算法,我的数据结构课程设计的源代码，很好用。-the Kruskal minimum spanning tree algorithm, the data structure of curriculum design source code, with very good. Platform: |
Size: 7609 |
Author:胡冰 |
Hits:
Description: 最小生成树的kruskal算法,我的数据结构课程设计的源代码，很好用。-the Kruskal minimum spanning tree algorithm, the data structure of curriculum design source code, with very good. Platform: |
Size: 7168 |
Author:胡冰 |
Hits:
Description: 在boost基础上实现
对图的最小生成树实现，通过此算法可以找到此图中连接所有点的最小生成树。-the boost on the basis of the plan to achieve the minimum spanning tree, the algorithm can find this map connect all the points the minimum spanning tree. Platform: |
Size: 2048 |
Author: |
Hits:
Description: 最小生成树的kruskal算法
自己写的
要是再说有重复 我可就怒了-the Kruskal minimum spanning tree algorithm wrote it myself if I say that there is no duplication of anger on Platform: |
Size: 1024 |
Author:bwj |
Hits:
Description: 图论中最小生成树Kruskal算法 及画图程序 M-函数
格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图
例如
n=6 w=inf*ones(6)
w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3]
w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6
[a,b]=mintreek(n,w)
-Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5] w (2, [3,5]) = [5,3] w (3, [4,5,6]) = [5,6,4] w (4,6) = 2 w (5,6) = 6 [a, b] = mintreek (n, w) Platform: |
Size: 1024 |
Author:lluo |
Hits:
Description: 最小生成树kruskal算法用邻接矩阵做图-Kruskal minimum spanning tree algorithm to do with adjacency matrix graph Platform: |
Size: 1024 |
Author:yan yao |
Hits:
Description: 最小生成树－KRUSKAL算法，做了很长时间才做好的-Minimum Spanning Tree-KRUSKAL algorithm, so a long time to do a good job of Platform: |
Size: 1024 |
Author:zhouwei |
Hits:
Description: 最小生成树的代码实现。运用kruskal算法实现。-Minimum spanning tree of the code. The use of Kruskal algorithm. Platform: |
Size: 729088 |
Author:ahkoo |
Hits:
Description: 本程序为使用克鲁斯卡尔 (kruskal)算法构造最小生成树，首先使用链表建立连通图，交换权值以及头和尾，对权值进行排序，使用克鲁斯卡尔 (kruskal)算法构造最小生成树-This procedure for the use of Kruskal (kruskal) Minimum Spanning Tree Algorithm, the first to use linked lists to establish connectivity map, the right to exchange value, as well as head and tail, sort of weights, the use of Kruskal (kruskal) algorithm for the smallest structure Spanning Tree Platform: |
Size: 1024 |
Author:ruikobe |
Hits:
Description: 根据kruskal算法写成的求一棵树的最小生成树的程序。-According to Kruskal algorithm written in a tree for the minimum spanning tree procedure. Platform: |
Size: 1024 |
Author:hezj |
Hits:
Search - kruskal minimum tree