文件名称:Minimum-spanning-tree
介绍说明－－下载内容均来自于网络，请自行研究使用
Kruskal算法和Prim算法
任何只由G的边构成,并包含G的所有顶点的树称为G的生成树(G连通).
加权无向图G的生成树的代价是该生成树的所有边的代码(权)的和.
最小代价生成树是其所有生成树中代价最小的生成树.-Kruskal algorithm and Prim algorithm
Any edge of only by G, is composed of all the vertices containing G tree called G of the spanning tree (G connected).
The weighted no directed graph G is the price of spanning tree all the spanning tree right on the edge of the code () and.
The lowest cost spanning tree is in all its spanning tree minimum cost of the spanning tree.
任何只由G的边构成,并包含G的所有顶点的树称为G的生成树(G连通).
加权无向图G的生成树的代价是该生成树的所有边的代码(权)的和.
最小代价生成树是其所有生成树中代价最小的生成树.-Kruskal algorithm and Prim algorithm
Any edge of only by G, is composed of all the vertices containing G tree called G of the spanning tree (G connected).
The weighted no directed graph G is the price of spanning tree all the spanning tree right on the edge of the code () and.
The lowest cost spanning tree is in all its spanning tree minimum cost of the spanning tree.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
最小生成树.cpp