最小生成树之PRIM算法

#include<stdio.h>#include<stdlib.h>const int maxn=110,inf=1000000000;int a[maxn][maxn],d[maxn],p[maxn];int main(){int i,j,k,m,n,ans;while(scanf("%d",&n)!=EOF){ans=0;for(i=1;i<=n;i++)for(j=1;j<=n;j++)a[i][j]=0;for(i=1;i<=n;i++){d[i]=inf;p[i]=0;}for(i=1;i<=n;i++)for(j=1;j<=n;j++)scanf("%d",&a[i][j]);d[1]=0;int min;for(i=1;i<=n;i++){min=inf;for(j=1;j<=n;j++)if(!p[j] && d[j]<min){k=j;min=d[j];}p[k]=1;ans+=d[k];for(j=1;j<=n;j++)if(!p[j] && d[j]>a[j][k])d[j]=a[j][k];}printf("%d\n",ans);}system("pause");return 0;}