复健计划(6)图论的简单模板

复健计划(6)图论的简单模板

图论题看题建图很重要，之后就简单题来说就是模板的事了，总结一下常用的模板，复习下原理.

一、最短路

题目 bzoj 2200/acwing 342 noip 2009 最优贸易

1、Dijkstra(堆优化) 适用于无负权边

#include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <cstring>

using namespace std;

const int N=100010,M=1000010;

int idx,e[M],head[N],ne[M],ver[M];
int n,m;
int d[N];
bool v[N];

priority_queue< pair<int,int> > q; //default:大根堆 ,first = d[], second = number

void add(int x,int y,int z){  //建图注意，++idx是head=0，否则是idx++，head=-1 
	e[++idx]=z;
	ne[idx]=head[x];
	head[x]=idx;
	ver[idx]=y;
}

void dij(){
	memset(d,0x3f,sizeof(d));
	memset(v,0,sizeof(v));
	d[1]=0;
	
	q.push(make_pair(0,1));
	while(q.size()){
		int x=q.top().second;
		q.pop();
		if(v[x]) continue;
		v[x]=1;
		
		for(int i=head[x];i;i=ne[i]){
			int y=ver[i],z=e[i];
			if(d[y]>d[x]+z){
				d[y]=d[x]+z;
				q.push(make_pair(-d[y],y)); //*
			}
		}
	} 
}

int main(){
	int a,b,c;
	scanf("%d%d",&n,&m);
	
	for(int i=1;i<=m;i++){
		scanf("%d%d%d",&a,&b,&c);
		add(a,b,c);
	}
	
	dij();
	
	//for(int i=1;i<=n;i++)
		printf("%d\n",d[n]);
	
	return 0;
} 

2、spfa 可用于有负权边的图

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>

using namespace std;

const int N=100010,M=1000010;

int idx,e[M],ver[M],ne[M],head[N];
int n,m;
int d[N];
bool v[N];
queue <int> q;  //number

void add(int x,int y,int z){   //建图注意，++idx是head=0，否则是idx++，head=-1 
	e[++idx]=z;
	ver[idx]=y;
	ne[idx]=head[x];
	head[x]=idx;
}

void spfa(){
	memset(d,0x3f,sizeof(d));
	memset(v,0,sizeof(v));
	d[1]=0;
	v[1]=1;
	q.push(1);
	while(q.size()){
		int x=q.front();
		q.pop();
		v[x]=0;//*
		for(int i=head[x];i;i=ne[i]){
			int y=ver[i],z=e[i];
			if(d[y]>d[x]+z){
				d[y]=d[x]+z;
				if(!v[y]) q.push(y),v[y]=1;
			}
		}
	}
}

int main(){
	
	int a,b,c;
	
	scanf("%d%d",&n,&m);
	
	for(int i=1;i<=m;i++){
		scanf("%d%d%d",&a,&b,&c);
		add(a,b,c);
	}
	
	spfa();
	
	//for(int i=1;i<=n;i++)
		printf("%d\n",d[n]);
	
	return 0;
}

二、spfa判断负环

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>

using namespace std;

const int N=100010,M=1000010;

int idx,e[M],ver[M],ne[M],head[N];
int cnt[N]; 
int n,m;
int d[N];
bool v[N],flag=false;
queue <int> q;  //number

void add(int x,int y,int z){   //建图注意，++idx是head=0，否则是idx++，head=-1 
	e[++idx]=z;
	ver[idx]=y;
	ne[idx]=head[x];
	head[x]=idx;
}

void spfa(){
	memset(d,0x3f,sizeof(d));
	memset(v,0,sizeof(v));
	
	d[1]=0;
	v[1]=1;
	
	for(int i=1;i<=n;i++) v[i]=1,q.push(i);  //*
	
	while(q.size()){
		int x=q.front();
		q.pop();
		v[x]=0;//*
		for(int i=head[x];i;i=ne[i]){
			int y=ver[i],z=e[i];
			if(d[y]>d[x]+z){
				d[y]=d[x]+z;
				cnt[y]=cnt[x]+1;
				if(cnt[y]>=n){
					flag=true;
					return ;
				}
				if(!v[y]) q.push(y),v[y]=1;
			}
		}
	}
}

int main(){
	
	int a,b,c;
	
	scanf("%d%d",&n,&m);
	
	for(int i=1;i<=m;i++){
		scanf("%d%d%d",&a,&b,&c);
		add(a,b,c);
	}
	
	spfa();
	
	if(flag)
		printf("Yes\n");
	else cout<<"No"<<endl;
	
	return 0;
}

三、最小生成树

题目：acwing 346 poj 2728

1、Kruskal

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int N=100010;

struct node{
	int x,y,z;
};
node edge[N*5];
int fa[N];
int n,m,ans,cnt;

bool cmp(node a,node b){
	return a.z<b.z;
}

int find(int x){
	if(fa[x]!=x) fa[x]=find(fa[x]);
	return fa[x];
}

int main(){
	
	cin>>n>>m;
	
	for(int i=1;i<=m;i++)
		scanf("%d%d%d",&edge[i].x,&edge[i].y,&edge[i].z);
	
	sort(edge+1,edge+m+1,cmp);
	
	for(int i=1;i<=n;i++) fa[i]=i;
	
	for(int i=1;i<=m;i++){
		int x=find(edge[i].x);
		int y=find(edge[i].y);
		if(x==y) continue;
		fa[x]=y;
		cnt++;
		ans+=edge[i].z;
		
	}
	if(cnt<n-1) cout<<"impossible"<<endl;
	else
	cout<<ans<<endl;
	
	return 0;
}

2、Prim

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int N=3010;

int a[N][N],m,n,d[N];
int ans;
bool v[N];

void prim(){
	
	memset(d,0x3f,sizeof(d));
	memset(v,0,sizeof(v));

	d[1]=0;
	
	for(int i=1;i<n;i++){
		int x=0;
		for(int j=1;j<=n;j++)
			if(!v[j]&&(x==0 || d[j]<d[x])) x=j;
			
		v[x]=1;
		
		for(int y=1;y<=n;y++){
			if(!v[y]) d[y]=min(d[y],a[x][y]);
		}
 	}
	
}

int main(){
	
	cin>>n>>m;
	
	memset(a,0x3f,sizeof(a));
	
	for(int i=1;i<=n;i++) a[i][i]=0;
	
	for(int i=1;i<=m;i++){
		int x,y,z;
		cin>>x>>y>>z;
		a[x][y]=a[y][x]=min(a[x][y],z);
	}
	
	prim();
	
	for(int i=1;i<=n;i++) 
		if(d[i]==0x3f3f3f3f){
			cout<<"impossible"<<endl;
			return 0;
		}
		else ans+=d[i];
	
	cout<<ans<<endl;
	
	return 0;
} 

四、二分图

1、染色法判断二分图

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int N=100010;

int idx,ver[N*2],head[N],ne[N*2];
int n,m;
bool flag=true;
int v[N];

void add(int x,int y){
	ver[++idx]=y;
	ne[idx]=head[x];
	head[x]=idx;
}

int dfs(int x,int c){
	v[x]=c;
	for(int i=head[x];i;i=ne[i]){
		if(!v[ver[i]]){
			if(!dfs(ver[i],3-c)) return false;
		}
		else if(v[ver[i]]==c) return false;
	}
	return true;
}

int main(){
	
	cin>>n>>m;
	
	for(int i=1;i<=m;i++){
		int x,y;
		scanf("%d%d",&x,&y);
		add(x,y);
		add(y,x);
	}
	
	for(int i=1;i<=n;i++){
		if(!v[i])
			if(!dfs(i,1)) {
			flag=false;
			break;
		}
	}
	
	if(flag) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	
	return 0;
} 

2、匈牙利算法 二分图最大匹配

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int N=510,M=100010;

int idx,ver[M],head[N],ne[M];
int n1,n2,m;
bool st[N];
int match[N];

void add(int x,int y){
	ver[++idx]=y;
	ne[idx]=head[x];
	head[x]=idx;
}

bool dfs(int x){
	for(int i=head[x];i;i=ne[i]){
		int y=ver[i];
		if(!st[y]){
			st[y]=1;
			if(!match[y]||dfs(match[y])){
				match[y]=x;
				return true;
			}
		}
	}
	return false;
}

int main(){
	
	cin>>n1>>n2>>m;
	
	for(int i=1;i<=m;i++){
		int x,y;
		scanf("%d%d",&x,&y);
		add(x,y);
	}
	
	int ans=0;
	
	for(int i=1;i<=n1;i++){
		memset(st,0,sizeof(st));
		if(dfs(i)) ans++;
	}
	cout<<ans<<endl;
	return 0;
}