最小生成树
Kruskal算法
/*
HDU 1102 Constructing Roads
题意:有n个乡村,修路,然后保证每两条路之间连接。
如果A和B连接,那么A和B直接连接或者中间还有一个乡村,间接连接。
已经有一些路了,你的任务是找出来一路径连接所有乡村。
输入:i到j的长度,注意去重边
最小生成树,,,
*/
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N = 10005;
struct edge
{
int u,v,w;
}e[N];
int n,f[N];
//将边降序排序
void quicksort(int left,int right)
{
int i,j;
struct edge t;
if(left > right)
return;
i = left;
j = right;
while(i!=j)
{
//注意顺序
//先从右边找
while(e[j].w >= e[left].w && i < j)
j--;
//从左边找
while(e[i].w <= e[left].w && i < j)
i++;
if(i<j)
{
t = e[i];
e[i]= e[j];
e[j] = t;
//swap(e[i],e[j]);
}
}
//基准归位
t = e[left];
e[left]= e[i];
e[i] = t;
//swap(e[left],e[i]);
quicksort(left, i-1);
quicksort(i+1, right);
return;
}
void Init()
{
for(int i = 1;i <= n;i++)
f[i] = i;
}
int getf(int u)
{
if(f[u] == u)
return u;
else
{
f[u] = getf(f[u]);
return f[u];
}
}
void merge(int u,int v)
{
int t1 = getf(u);
int t2 = getf(v);
if(t1 != t2)
{
f[t2] = t1;
}
}
int main()
{
while(~scanf("%d",&n))
{
memset(e,0,sizeof(e));
int x,num = 1;
for(int i = 1;i <= n;i++)
for(int j = 1;j <= n;j++)
{
scanf("%d",&x);
if(i >= j)
continue;
e[num].u = i;
e[num].v = j;
e[num].w = x;
num++;
}
quicksort(1,num-1);
Init();//并查集优化
int q,t1,t2;
scanf("%d",&q);
for(int i = 0;i < q;i++)
{
scanf("%d%d",&t1,&t2);
merge(t1,t2);//合并已有的道路
}
int counter = 0,sum = 0;
//Kruskal算法核心
for(int i=1;i<num;i++)
{
if(getf(e[i].u)!=getf(e[i].v))//未连通
{
merge(e[i].u,e[i].v);
sum+=e[i].w;
}
}
printf("%d\n",sum);
}
return 0;
}
/*
3
0 990 692
990 0 179
692 179 0
1
1 2
*/
Prim算法
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int INF = 99999999;
const int N = 1005;
int e[N][N],dis[N],book[N]={0};
int main()
{
int n;
while(~scanf("%d",&n))
{
for(int i = 1;i <= n;i++)
for(int j = 1;j <= n;j++)
scanf("%d",&e[i][j]);
int q;
scanf("%d",&q);
int t1,t2;
for(int i = 1;i <= q;i++)
{
scanf("%d%d",&t1,&t2);
e[t1][t2] = e[t2][t1] = 0;
}
//初始化dis数组
for(int i = 1;i <= n;i++)
dis[i] = e[1][i];
memset(book,0,sizeof(book));
int counter = 0,sum = 0;
//Prim算法核心
//将1号顶点加入生成树
book[1] = 1;
counter++;
int u,v,minn;
while(counter < n)
{
minn = INF;
for(int i = 1;i <= n;i++)
{
if(!book[i] && dis[i] < minn)
{
minn = dis[i];
u = i;
}
}
book[u] = 1;
counter++;
sum += dis[u];
for(int v = 1;v <= n;v++)
{
if(!book[v] && dis[v] > e[u][v])
dis[v] = e[u][v];
}
}
printf("%d\n",sum);
}
return 0;
}