int main(){ int i; double weight; while(scanf("%d %d", &n, &numedge) == 2){ memset(sets, -1, sizeof(sets)); for(i = 0; i < numedge; i++){ scanf("%d %d %lf", &edge[i].u, &edge[i].v, &edge[i].w); } weight = mintree(); printf("Minimum cost tree = %f\n", weight); printf("Tree edges: \n"); for(i = 0; i < n-1; i++){ printf("%d %d %f\n", treeedge[i].u, treeedge[i].v, treeedge[i].w); } } return 0; }
float mintree(bbb*a) { if(a->l==0) return a->f; else return mintree(a->l); }