prim算法和克鲁斯卡尔算法

<span style="font-family: Arial, Helvetica, sans-serif;">int map[2001][2001], low[2001], visit[2001];</span>

int prim(int n)
{
	int min, cost = 0, i, j, pos;
	pos = 1;
	for(i = 1; i <= n; i++)
	visit[i] = 0, low[i] = map[pos][i];
	visit[pos] = 1;
	for(i = 1; i < n; i++)
	{
		min = 1<<30;
		for(j = 1; j <= n; j++)
		if(!visit[j] && low[j] != -1 && min > low[j]) pos = j, min = low[j];
		visit[pos] = 1;
		cost += min;
		for(j = 1; j <= n; j++)
		if(map[pos][j] != -1 && low[j] > map[pos][j]) low[j] = map[pos][j];
	}
	return cost;
}

克鲁斯卡尔

struct edge
{
	int u, v, w;
}e[maxn];
int f[110];

bool cmp(edge a, edge b)
{
	return a.w < b.w;
}
int find(int x)
{
	if(x != f[x])
		return f[x] = find(f[x]);
	return f[x];
}

int MST()
{
	int sum = 0;
	for(int i = 0; i < m; i++)
	{
		int x = find(e[i].u);
		int y = find(e[i].v);
		if(x != y)
		{
			sum += e[i].w;
			f[x] = y;
		}
	}
	return sum;
}