#include <iostream>
#include<queue>
#include<cstring>
using namespace std;
const int MAX=40;
int color[MAX];
int line[MAX][MAX];
int bfs(int s,int n){
int beg;
queue<int>q;
color[s]=1;
q.push(s);
while(!q.empty()){
beg=q.front();
q.pop();
for(int i=1;i<=n;i++){
if(line[beg][i]&&color[i]==-1){
q.push(i);
color[i]=!color[beg];
}
if(line[beg][i]&&color[beg]==color[i])
return 0;
}
}
return 1;
}
int main()
{
int n, m, a, b, i;
memset(color, -1, sizeof(color));
memset(line,0,sizeof line);
cin >> n >> m;
for(i = 0; i < m; i++) {
cin >> a >> b;
line[a][b] = line[b][a] = 1;
}
bool flag = false;
for(i = 1; i <= n; i++)
if(color[i] == -1 && !bfs(i, n)) {//遍历各个连通分支 没有被染色(图可能不是联通的,所以color[i]还是-1)
flag = true;
break;
}
if(flag)
cout << "Wrong" <<endl;
else
cout << "Correct" <<endl;
// }
return 0;
}
二分图判断
猜你喜欢
转载自blog.csdn.net/qq_41421433/article/details/82983657
今日推荐
周排行