文件名称:Minimum_spanning_tree
介绍说明－－下载内容均来自于网络，请自行研究使用
最小生成树是一个有 n 个结点的连通图的生成树是原图的极小连通子图，且包含原图中的所有 n 个结点，并且有保持图联通的最少的边。
本程序生成一个最小生成树-Minimum spanning tree is a n-node connected graph of the minimal spanning tree is the original connected subgraph, and contains all the n original nodes, and there are plans to maintain at least the edge of Unicom. This procedure generates a minimum spanning tree
本程序生成一个最小生成树-Minimum spanning tree is a n-node connected graph of the minimal spanning tree is the original connected subgraph, and contains all the n original nodes, and there are plans to maintain at least the edge of Unicom. This procedure generates a minimum spanning tree
(系统自动生成,下载前可以参看下载内容)
下载文件列表
最小生成树.C