运筹程序.docVIP

Prim~~~~~~~~~~~~~~~~~~~~~~~~~~~ #include iostream.h #define INF 999999 //定义无穷大值 void Prim(int n, int **c) { int *lowcost; int *closest; bool *s; lowcost = new int[n]; closest = new int[n]; s = new bool[n]; s[1] = true; for(int i=2;i=n;i++) { lowcost[i] = c[1][i]; closest[i]=1; s[i] = false; } cout最小生成树为:; coutendl; for(i=1;in;i++) { int min = INF; int j=1; for(int k=2;k=n;