SYITwin的博客

最小生成树之prim算法（转载出处）边赋以权值的图称为网或带权图，带权图的生成树也是带权的，生成树T各边的权值总和称为该树的权。   最小生成树（MST）：权值最小的生成树。   生成树和最小生成树的应用：要连通n个城市需要n－1条边线路。可以把边上的权值解释为线路的造价。则最小生成树表示使其造价最小的生成树。   构造网的最小生成树必须解决下面两个问题：    1、尽可能选取...

输入图的邻接矩阵，求最小生成树的总权值(多组数据）InputThe input includes several cases. For each case, the first line contains the number of farms, N (3 <= N <= 100). The following lines contain the N x N conectivi...

输入图的邻接矩阵，求最小生成树的总权值(多组数据）InputThe input includes several cases. For each case, the first line contains the number of farms, N (3 <= N <= 100). The following lines contain the N x N conectivi...