无向图染色问题 DFS 剪枝 回溯

#include<bits/stdc++.h>
using namespace std;
int known[101][101];
int p[101][101];
int n,m;
int res=INT_MAX;
void dfs(int x,int total){
	if(total>=res)
		return;
	if(x==n+1){
		res=min(total,res);
		return;
	}
	for(int i=1;i<=total;i++){
		int k=0;
		while(p[i][k]&&!known[x][p[i][k]])
			k++;
		if(p[i][k]==0){
			p[i][k]=x;
			dfs(x+1,total);
			p[i][k]=0;
		}
	}
	p[total+1][0]=x;
	dfs(x+1,total+1);
	p[total+1][0]=0;
}
int main()
{
	memset(known,0,sizeof(known));
	memset(p,0,sizeof(p));
	//vector<int> known[101];
	scanf("%d%d",&n,&m);
	for(int i=0;i<m;i++){
		int a,b;
		scanf("%d%d",&a,&b);
		known[a][b]=known[b][a]=1;
	}
	dfs(1,1);
	cout<<res<<endl;
	return 0;
}