摘要： #include #include #include #define INF 0x3f3f3f3fusing namespace std;int grid[505][505],dist[505],visit[505],n;int prime(){ int num=1,k,i,ans=0,minc; memset (visit,0,sizeof(visit)); for (i = 1; i <= n; i++) dist[i] = grid[1][i]; visit[1]=1; dist[1]=0; while(num++<n) { ... 阅读全文

摘要： prim或kruscal都可以#include #include #include #include #define INF 0x3f3f3f3fusing namespace std;char g[2005][8];int grid[2005][2005],dist[2005],visit[2005],n;int dis(int i,int j){ int count=0,k; for(k=0;k<7;k++) if(g[i][k]!=g[j][k]) count++; return count;}int prime(){ int num=... 阅读全文