题意:有个人想要建设一条可以通往全岛的路,问最短距离
这道题其实用prim和kruscal都可以做,但是用prim会跑的快一些
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<vector>
#include<set>
#include<algorithm>
#include<map>
using namespace std;
#define Max 30
#define inf 0xfffffff
int n, ans;
int map[Max][Max], dis[Max];
int min(int a, int b)
{
return a < b ? a : b;
}
void prim()
{
int i, j, now, min_node, min_edge;
for(i = 1; i <= n; i ++)
dis[i] = inf;
now = 1;
ans = 0;
for(i = 1; i < n; i ++)
{
dis[now]=-1;
min_edge=inf;
for(j = 1; j <= n; j ++)
if(now != j && dis[j] >= 0)
{
dis[j] = min(dis[j], map[now][j]);
if(dis[j] < min_edge)
{
min_edge = dis[j];
min_node = j;
}
}
now = min_node;
ans += min_edge;
}
}
int main()
{
int i, j, num, edge;
char u, v;
while(scanf("%d", &n) && n != 0)
{
for(i = 1; i <= n; i ++)
for(j = 1; j <= n; j ++)
map[i][j] = inf;
for(i = 1; i < n; i ++)
{
scanf(" %c%d", &u, &num); // 这里或用cin,代替scanf("%c %d", &u, &num); getchar()。
while(num --)
{
scanf(" %c%d", &v, &edge); // 同上。
map[u-'A'+1][v-'A'+1] = edge;
map[v-'A'+1][u-'A'+1] = edge;
}
}
prim();
printf("%d\n", ans);
}
return 0;
}