文件名称:Kruskal
介绍说明--下载内容均来自于网络,请自行研究使用
设G=(V,E)是一个具有含权边的连通无向图。G的一颗生成树(V,T)是G的作为树的子图。如给该连通图加权并且各边的权和为最小值,那么(V,T)就称为最小耗费生成树或简称最小生成树。
Kruskal的算法概况如下:
对G的边以非降序权重排列。
对排序表中的每条边,如果现在把它放入T中的话不会形成回路,则把它加入到生成树T中,否则将它丢弃。-Let G = (V, E) is an edge with the right connectivity with undirected graph. G is a spanning tree (V, T) of G as a tree subgraph. As to the weighted connected graph and each edge of the right and the minimum value, then (V, T) is called a minimum cost spanning tree or simply the minimum spanning tree.
Kruskal s algorithm is summarized as follows:
Edges of G are arranged in non-descending weights.
Sort the table on each side, if we put it in the words of T does not form a loop, put it into the spanning tree T, otherwise discard it.
Kruskal的算法概况如下:
对G的边以非降序权重排列。
对排序表中的每条边,如果现在把它放入T中的话不会形成回路,则把它加入到生成树T中,否则将它丢弃。-Let G = (V, E) is an edge with the right connectivity with undirected graph. G is a spanning tree (V, T) of G as a tree subgraph. As to the weighted connected graph and each edge of the right and the minimum value, then (V, T) is called a minimum cost spanning tree or simply the minimum spanning tree.
Kruskal s algorithm is summarized as follows:
Edges of G are arranged in non-descending weights.
Sort the table on each side, if we put it in the words of T does not form a loop, put it into the spanning tree T, otherwise discard it.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Kruskal.doc