poj1789 prim最小生成树

#include<iostream>
const int inf=0x3f3f3f3f;
using namespace std;
char str[2010][8] = { '\0' };
int  dist[2010][2010] = { 0 },N=0;
int weigh(int m, int n)
{
	int i = 0,w=0;
	for (i = 0; i < 7; i++)
	{
		if (str[m][i] != str[n][i])
		{
			w++;
		}
	}
	return w;
}
int prim()
{
	int s = 1;       //源点（最初的源点为1）  
	int m = 1;       //记录最小生成树的顶点数  
	bool u[2010];   //记录某顶点是否属于最小生成树  
	int w = 0;       //最小生成树的总权值  
	int minlength=0;     //每个新源点到其它点的最短路  
	int flag_point;
	int low_dis[2010];  //各个源点s到其它点的最短路  
	memset(low_dis, inf, sizeof(low_dis));
	memset(u, false, sizeof(u));
	u[s] = true;
	while (1)
	{
		if (m == N)      //当最小生成树的顶点数等于原图的顶点数时，说明最小生成树查找完毕  
			break;
		w = inf;
		for (int j = 2; j <= N; j++)
		{
			if (!u[j] && low_dis[j]>dist[s][j])
				low_dis[j] = dist[s][j];
			if (!u[j] && w>low_dis[j])
			{
				w = low_dis[j];
				flag_point = j;      //记录最小权边中不属于最小生成树的点j  
			}
		}
		s = flag_point;       //顶点j与旧源点合并  
		u[s] = true;          //j点并入最小生成树（相当于从图上删除j点，让新源点接替所有j点具备的特征）  
		minlength +=w;      //当前最小生成树的总权值  
		m++;
	}
	return minlength;
}
int main()
{
	int i=0,j=0;
	while (1)
	{
		cin >> N;
		if (N == 0) break;
		for (i = 1; i <= N; i++)
			cin >> str[i];
		for (i = 1; i <= N; i++)
		{
			for (j = i + 1; j <= N; j++)
			{
				dist[i][j] = dist[j][i] = weigh(i, j);
			}
		}
		cout << "The highest possible quality is 1/" << prim() <<"."<<endl;
	}
	return 0;
}