最小生成树（minimum spanning tree）.docVIP

最小生成树（minimum spanning tree） # includes stdio.h # includes string.h # define max 9999999 int main () { int map [101] [101], i, j, x, y, z, n, m, k; int min, len, f [101], mark [101], flags; while (scanf (% d% d m n), (m) { memset (mark, 0, sizeof (mark); for (i = 1, the = n; i + +) for (j = 1; j = n; j + +) map [] [j] = max. for (i = 1, the = m; i + +) { scanf (% d% d% d x y z); if (z - map [x] [y]) (map [x] [y] = map [y] [x] = y;} } for (i = 2; the = n; i + +) f [i] = map [1] []; f (1) = 0; len = 0; for (i = 1, the = n; i + +) { min = max. for (j = 1; j = n; j + +) { if (! mark [j] f [j] min) {min = f [j]; k = j;} } if (min = max) break; len + = f [k]; mark [k] = 1. for (j = 1; j = n; j + +) { if (! mark [j] f [j] map [k] [j]) f [j] = [k] [j] map. } } flag = 0; for (i = 1, the = n; i + +) if (f [i] = max (flag = 1); break;} if (flag) printf (? \ n ); else printf (% d \ n, len); } } # includes stdio.h # includes string.h # define size 105 # define init 99.9999 int count; int graph [size] [size]; long sum; void prim (int villige) { int i, j; int min, locate. int dist [size]; sum = 0; bool visited [size]; memset (visited, 0, sizeof (visited)); memset (dist, init, sizeof (dist). for (i = 1, the = villige; i + +) dist [i] = graph [1] []; visited [i] = true; count = 1; for (j = 2, j = villige; j + +) { min = init. for (i = 2; the = villige; i + +) { if (! visited [] [i] min dist) { min = dist []; if = 1. } } if (min! = init) { visited [local] = true; sum + = min; count + +; for (i = 1, the = villige; i + +) { if (! visited [] [local] [graph]. = 0 dist [] [local] [graph]) dist [i] = graph [locate] [i]. } } else return; } } int main () { int road, villige; int i, j; weight; while (scanf (% d% d road villige). = - eof road) { count = 0; for (i = 0; i = villige; i + +) { for (j = 0, j = villige; j + +) if (i = = 2) graph [the] [j] = 0. else graph [the] [j] = init. } while (road) { scanf (% d% d% d, , j., weight); graph [the] [j] =