Search - kruskal minimum tree

Search - kruskal minimum tree - List

[Other] Kruskal.cpp DL : 0: 在权值不同的图中寻找一个最小生成树的问题-different weights in the map to find a minimum spanning tree problem
Date : 2008-10-13 Size : 2.97kb User : 刘通学
[Other] Kruskal算法 DL : 0: kruskal算法来得到最小生成树的程序-Kruskal algorithm to be the minimum spanning tree procedures
Date : 2008-10-13 Size : 1kb User : yue
[Other] MaxSpanningTree DL : 0: 求最大生成树，实际上是以最小生成树的算法为基础进行改进，我采用的是kruskal算法，基本思路是对各个边的权进行排序，然后加入生成树，形成环的点跳过，直到生成最大生成树。JAVA的特点是输入输出比较便利，所以问题的关键在于用监控将图的初始化和树的生成衔接。-Spanning Tree for the largest, is actually the minimum spanning tree algorithm-based improvement, I used the Kruskal algorithm, the basic idea is to the right of each side in order, then joined the spanning tree, formed in Central Point skip until Spanning Tree greatest generation. Java is characterized easier to input and output, Therefore, the key is to use the plan to monitor the initialization and tree generation convergence.
Date : 2008-10-13 Size : 2.76kb User : 笑笑