Location:
Search - kuskal
Search list
Description: 该程序用贪心算法来求解最小生成树问题 采用贪婪准则：每次选择边权值最小边。如果该边加入后不构成环，则加入。-procedures with the greedy algorithm to solve the problem using the minimum spanning tree greedy guidelines : each side the right to choose the minimum value side. If the edge after the entry does not constitute a part, while accession.
Platform: |
Size: 2280 |
Author: 杨晨 |
Hits:
Description: 该程序用贪心算法来求解最小生成树问题 采用贪婪准则：每次选择边权值最小边。如果该边加入后不构成环，则加入。-procedures with the greedy algorithm to solve the problem using the minimum spanning tree greedy guidelines : each side the right to choose the minimum value side. If the edge after the entry does not constitute a part, while accession.
Platform: |
Size: 2048 |
Author: 杨晨 |
Hits:
Description: 寻找最小生成树的贪心算法，一个能可靠运行的VC++程序-a Kuskal project writed using vc 6.0
Platform: |
Size: 7168 |
Author: wangjingyu |
Hits: