1. 用连通网来表示n个城市以及n个城市间可能设置的通信线路,其中网的顶点表示城市,边表示两诚实之间的线路,赋于边的权值表示相应的代价.最小生成树问题就是要构造连通网的最小代价生成树.
1. Used to represent the n-connected network of n cities and between cities and communication lines may be set, including vertex network, said the city, said the two sides of the line between honest, confers the right side of the value that the corresponding cost. Smallest tree problem is to construct minimum cost connected network spanning tree. (2010-06-07, DOS, 408KB, 下载3次)