-
Notifications
You must be signed in to change notification settings - Fork 1
/
mcolor.py
55 lines (41 loc) · 1.14 KB
/
mcolor.py
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
from queue import Queue
class node:
def __init__(self, color):
self.color = color
self.neighbors = set()
def canPaint(nodes,v,m):
maxColor =1
visited = [0 for i in range(v)]
for i in range(v):
if visited[i] == 1:
continue
visited[i] = 1
q = Queue()
q.put(i)
while not q.empty():
u =q.get()
for j in nodes[u].neighbors:
if nodes[j].color == nodes[u].color:
nodes[j].color+=1
maxColor = max(maxColor,nodes[j].color,nodes[u].color)
if maxColor > m:
print(maxColor)
return False
if visited[j] == 0:
visited[j] = 1
q.put(j)
return True
graph = [ [ 0, 1, 1, 1 ],
[ 1, 0, 1, 0 ],
[ 0, 1, 0, 1 ],
[ 1, 0, 1, 0 ] ]
v = 4
m = 3
nodes = []
for i in range(v):
nodes.append(node(1))
for i in range(v):
for j in range(v):
if graph[i][j] == 1:
nodes[i].neighbors.add(j)
print(canPaint(nodes,v, m))