POJ - 1251 Jungle Roads (最小生成树Kruskal、并查集)

题目:http://poj.org/problem?id=1251

题意:

n个村子,每个村子后面连接各自的邻村、路费,选出使得全部村子相连的最小通路

分析:

n个节点,村子之间的路费为边的权值,Kruskal算法求最小生成树

核心:

void Kruskal()
{
	memset(parent, -1, sizeof(parent));
	int num = 0, ans = 0, u, v;
	for(i = 0; i= n-1) break;
	}
	printf("%d\n", ans);
}


代码:


#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

#define MAXN 30
#define MAXM 100
#define MIN -1e+10
#define INF 0x7f7f7f7f

struct edge
{
	int u, v, w;
	bool operator < (const edge& p)const
	{
		return w=0; s = parent[s]);
	while(s != x)
	{
		temp = parent[x];
		parent[x] = s;
		x = temp;
	}
	return s;
}

void Union(int u, int v)
{
	int r1 = Find(u), r2 = Find(v);
	int temp = parent[r1] + parent[r2];
	if(parent[r1] > parent[r2])
	{
		parent[r1] = r2;
		parent[r2] = temp;
	}
	else 
	{
		parent[r2] = r1;
		parent[r1] = temp;
	}
}

void Kruskal()
{
	memset(parent, -1, sizeof(parent));
	int num = 0, ans = 0, u, v;
	for(i = 0; i= n-1) break;
	}
	printf("%d\n", ans);
}

int main()
{
	freopen("a.txt", "r", stdin);

	char s[2];
	int nt, w, u, v;
	while(~scanf("%d", &n) && n)
	{
		m = 0;
		for(i = 1; i


你可能感兴趣的:(图结构)