POJ T1251 Jungle Roads

                               POJ T1251 Jungle Roads

---

题解：

  点数比较少，A-Z，26个字母，Kruskal和Prim都可以。只需要注意下字符串的输入就可以了。

  鄙人给出两个方法的代码，但是接收字符串的方式不一样，Kruskal是单个接收，Prim是懒人%s

 

Kruskal写法

#include<cstdio>
#include<algorithm>
#define maxn 27
#define maxm 80
using namespace std;

int f[maxn],n,sum,cnt,cntb;

struct Edge{
	int u,v,cost;
}edge[maxm];

bool cmp(Edge a,Edge b){
	return a.cost < b.cost;
}

void init(){
	sum = 0;
	cnt = cntb = 0;
	for(int i = 0; i < 27 ;i++)
	    f[i] = i;
}

int getf(int r){
	return f[r] == r ? r : f[r] = getf(f[r]);
}

bool merge(int u,int v){
	int rootu = getf(u);
	int rootv = getf(v);
	if(rootu != rootv){
		f[rootv] = rootu;
		return true;
	}
	return false;
}

void Kruskal(){
	sort(edge,edge+cnt,cmp);
	for(int i = 0; i < cnt; i++){
		if(merge(edge[i].u,edge[i].v)){
			sum += edge[i].cost;
			cntb++;
		}
		if(cntb == n-1) break;
	}
}

int main(){
	char ch,ch1;
	int t,c;
	while(scanf("%d",&n),n){
		init();
		for(int i = 0; i < n - 1;i++){
			//getchar();
			scanf("\n%c",&ch);
			scanf("%d",&t);
			while(t--){
				scanf(" %c %d",&ch1,&c);
				edge[cnt].u = ch - 'A';
				edge[cnt].v = ch1 - 'A';
				edge[cnt++].cost = c;
			}
		}
		Kruskal();
		printf("%d\n",sum);
	}
	return 0;
}

---

Prim写法

#include<cstdio>
#include<algorithm>
#define maxn 30
#define INF 0x3f3f3f3f
using namespace std;

int map[maxn][maxn];
int dis[maxn],n,sum;
bool vis[maxn];

void init(){
	sum = 0;
	for(int i = 0; i < n; i++){
		dis[i] = INF;
		vis[i] = false;
		for(int j = 0; j <= i; j++)
		    i == j ? map[i][j] = INF : map[i][j] = map[j][i] = INF;
	}
}

void Prim(int s){
	dis[s] = 0;
	for(int i = 0; i < n ; i++){
		int p = -1 , minn = INF;
		for(int j = 0; j < n; j++){
			if(!vis[j] && minn > dis[j]){
				p = j;
				minn = dis[j];
			}
		}
		vis[p] = true;
		sum += dis[p];
		for(int j = 0; j < n ;j++){
			if(!vis[j] && dis[j] > map[p][j])
			    dis[j] = map[p][j];
		}
	}
}

int main(){
	char ch[2],ch1[2];
	int t,u,v,c;
	while(scanf("%d",&n),n){
		init();
		for(int i = 0; i < n - 1; i++){
			scanf("%s",ch);
			scanf("%d",&t);
		    u = ch[0] - 'A';
		    while(t--){
			    scanf("%s%d",ch1,&c);
			    v = ch1[0] - 'A';
			    map[u][v] = min(map[u][v],c);
			    map[v][u] = map[u][v];
		    }
		}
		Prim(0);
		printf("%d\n",sum);
	}
	return 0;
}