forked from TheAlgorithms/Python
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathm_coloring_problem.py
More file actions
70 lines (61 loc) · 2.08 KB
/
m_coloring_problem.py
File metadata and controls
70 lines (61 loc) · 2.08 KB
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
def is_safe(
node: int, color: int, graph: list[list[int]], num_vertices: int, col: list[int]
) -> bool:
"""
Check if it is safe to assign a color to a node.
>>> is_safe(0, 1, [[0,1],[1,0]], 2, [0,1])
False
>>> is_safe(0, 2, [[0,1],[1,0]], 2, [0,1])
True
"""
return all(
not (graph[node][k] == 1 and col[k] == color) for k in range(num_vertices)
)
def solve(
node: int,
col: list[int],
max_colors: int,
num_vertices: int,
graph: list[list[int]],
) -> bool:
"""
Recursively try to color the graph using at most max_colors.
>>> solve(0, [0]*3, 3, 3, [[0,1,0],[1,0,1],[0,1,0]])
True
>>> solve(0, [0]*3, 2, 3, [[0,1,0],[1,0,1],[0,1,0]])
False
"""
if node == num_vertices:
return True
for c in range(1, max_colors + 1):
if is_safe(node, c, graph, num_vertices, col):
col[node] = c
if solve(node + 1, col, max_colors, num_vertices, graph):
return True
col[node] = 0
return False
def graph_coloring(graph: list[list[int]], max_colors: int, num_vertices: int) -> bool:
"""
Determine if the graph can be colored with at most max_colors.
>>> graph_coloring([[0,1,1],[1,0,1],[1,1,0]], 3, 3)
True
>>> graph_coloring([[0,1,1],[1,0,1],[1,1,0]], 2, 3)
False
"""
col = [0] * num_vertices
return solve(0, col, max_colors, num_vertices, graph)
if __name__ == "__main__":
print("Graph Coloring Problem")
num_vertices = int(input("Enter number of vertices: "))
num_edges = int(input("Enter number of edges: "))
print("Enter each edge as 'u v' (0-based indexing):")
graph = [[0] * num_vertices for _ in range(num_vertices)]
for _ in range(num_edges):
u, v = map(int, input().split())
graph[u][v] = 1
graph[v][u] = 1
max_colors = int(input("Enter maximum number of colors: "))
if graph_coloring(graph, max_colors, num_vertices):
print(f"The graph can be colored with {max_colors} colors.")
else:
print(f"The graph cannot be colored with {max_colors} colors.")