-
Notifications
You must be signed in to change notification settings - Fork 11
/
图着色问题.cpp
47 lines (43 loc) · 940 Bytes
/
图着色问题.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
#include<bits/stdc++.h>
using namespace std;
const int N = 5;
int arc[N][N]= {{0,1,0,0,0},{1,0,1,1,0},{0,1,0,0,1},{0,1,0,0,1},{0,0,1,1,0}};
int color[N] = {0};
int Ok(int i);
void ColorGraph( );
int main( )
{
ColorGraph( );
for (int i = 0; i < N; i++)
cout<<color[i]<<" ";
return 0;
}
void ColorGraph()
{
int k = 0;
int flag = 1;
while (flag == 1)
{
k++;
flag = 0;
for (int i = 0; i < N; i++)
{
if (color[i] == 0)
{
color[i] = k;
if (!Ok(i))
{
color[i] = 0;
flag = 1;
}
}
}
}
}
int Ok(int i) //判断顶点i的着色是否发生冲突
{
for (int j = 0; j < N; j++)
if (arc[i][j] == 1 && color[i] == color[j])
return 0;
return 1;
}