-
Notifications
You must be signed in to change notification settings - Fork 0
/
Bipartite.cpp
106 lines (92 loc) · 2.65 KB
/
Bipartite.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
#include <cmath>
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cassert>
#include <queue>
using namespace std;
#pragma region Graph DS
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> AdjList;
#pragma endregion
#define TRvii(c, it) for (vii::iterator it = c.begin(); it != c.end(); it++)
queue<int> q;
map<int, int> dist;
AdjList adjlist(8);
//const enum Color { Red, Blue };
bool IsBipartite (int s)
{
int color[8];
memset(color, -1, sizeof(color));
bool flag = true;
q.push(s);
dist[s] = 0;
color[s] = 1;
while (!q.empty()) {
int u = q.front();
q.pop();
//printf("Visit %d, Layer %d\n", u, dist[u]);
TRvii(adjlist[u], v) {
if (!dist.count(v->first) && color[v->first] == -1) { // if v is not visited before
color[v->first] = 1- color[u];
dist[v->first] = dist[u] + 1; //reachable from u
q.push(v->first); // enqueue v for next steps
}
if (dist.count(v->first) && color[v->first] == color[u]) {
flag = false;
return flag;
}
}
}
return flag;
}
int main()
{
//memset(moves, -1, sizeof(moves));
#pragma region Undirected graph
// Undirected graph
/*adjlist[0].push_back(make_pair(1, 0));
adjlist[1].push_back(make_pair(2, 0));
adjlist[1].push_back(make_pair(0, 0));
adjlist[1].push_back(make_pair(3, 0));
adjlist[2].push_back(make_pair(1, 0));
adjlist[2].push_back(make_pair(3, 0));
adjlist[3].push_back(make_pair(2, 0));
adjlist[3].push_back(make_pair(4, 0));
adjlist[4].push_back(make_pair(3, 0));
adjlist[5].push_back(make_pair(5, 0));
adjlist[6].push_back(make_pair(7, 0));
adjlist[7].push_back(make_pair(6, 0));*/
#pragma endregion
// Colorable graph
adjlist[0].push_back(make_pair(1, 0));
adjlist[0].push_back(make_pair(2, 0));
adjlist[1].push_back(make_pair(0, 0));
adjlist[2].push_back(make_pair(0, 0));
adjlist[2].push_back(make_pair(4, 0));
adjlist[1].push_back(make_pair(3, 0));
adjlist[3].push_back(make_pair(1, 0));
adjlist[3].push_back(make_pair(5, 0));
adjlist[4].push_back(make_pair(5, 0));
adjlist[4].push_back(make_pair(2, 0));
adjlist[5].push_back(make_pair(4, 0));
adjlist[5].push_back(make_pair(3, 0));
// non colorable graph
/*adjlist[0].push_back(make_pair(1, 0));
adjlist[0].push_back(make_pair(2, 0));
adjlist[1].push_back(make_pair(0, 0));
adjlist[2].push_back(make_pair(0, 0));
adjlist[2].push_back(make_pair(4, 0));
adjlist[1].push_back(make_pair(3, 0));
adjlist[3].push_back(make_pair(1, 0));
adjlist[3].push_back(make_pair(4, 0));
adjlist[4].push_back(make_pair(3, 0));
adjlist[4].push_back(make_pair(2, 0)); */
bool flag = IsBipartite(0);
cout << flag;
cin.get();
return 0;
}