Description: 给出一个连通带权的无向图，找出该图的最小生成树。并带有问题的详细描述及测试数据。-Given a connected weighted undirected graph, find the minimum spanning tree graph. With a detailed description of the problem and the test data. Platform: |
Size: 173056 |
Author:张蕾 |
Hits:
Description: 数据库结构课本中二叉树中求最小代价生成树-Textbooks in the binary tree database structure in order to minimize the cost of spanning tree Platform: |
Size: 1024 |
Author:yahoo |
Hits:
Description: 在图形中若于个边(edge)上加上一些值，此数值称为比重( weight ) 。而此图形称为比重图形(Weight Graph ) ，若weight是成本( cost )或距离( distance ) ，则称此图形为网路( Network )。根据Spanning Tree的定义，知一个图形可有许多不同spanning tree ，在network中找出一个具有最小成本( Cost )的Spanning tree ，则此Spanning tree称为最小成本生成树。-If in the graph in a side (edge) to add some value, this value as the proportion (weight). This graph is called the proportion of graphics (Weight Graph), if the weight is the cost (cost) or distance (distance), said the graphics for the network (Network). Spanning Tree in accordance with the definition of a graph to know there are many different spanning tree, in the network to find a minimum cost (Cost) of the Spanning tree, then the minimum cost Spanning tree known as the spanning tree.
Platform: |
Size: 3072 |
Author:lll |
Hits:
Description: 1． 利用克鲁斯卡尔算法求网的最小生成树。
2． 利用普里姆算法求网的最小生成树。
3． 要求输出各条边及它们的权值。-1. Using Kruskal algorithm for the minimum spanning tree network. 2. Use of the the prim algorithm for the minimum spanning tree. 3. Output edge and their weights. Platform: |
Size: 635904 |
Author:陆小果 |
Hits:
Search - minimumspanningtree