Update m_coloring_problem.py

Author: sgindeed

backtracking/m_coloring_problem.py

@@ -1,5 +1,4 @@
-def is_safe(node: int, color: int, graph: list[list[int]], num_vertices: int,
-            col: list[int]) -> bool:
+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.
 
@@ -8,12 +7,10 @@ def is_safe(node: int, color: int, graph: list[list[int]], num_vertices: int,
     >>> 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))
+    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:
+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.
 
@@ -33,8 +30,7 @@ def solve(node: int, col: list[int], max_colors: int, num_vertices: int,
     return False
 
 
-def graph_coloring(graph: list[list[int]], max_colors: int,
-                   num_vertices: int) -> bool:
+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.
 
@@ -50,7 +46,7 @@ def graph_coloring(graph: list[list[int]], max_colors: int,
 if __name__ == "__main__":
     num_vertices = int(input())
     num_edges = int(input())
-    graph = [[0]*num_vertices for _ in range(num_vertices)]
+    graph = [[0] * num_vertices for _ in range(num_vertices)]
     for _ in range(num_edges):
         u, v = map(int, input().split())
         if 0 <= u < num_vertices and 0 <= v < num_vertices:
@@ -59,5 +55,4 @@ def graph_coloring(graph: list[list[int]], max_colors: int,
         else:
             raise ValueError("Edge indices out of range")
     max_colors = int(input())
-    col = [0]*num_vertices
-    print(solve(0, col, max_colors, num_vertices, graph))
+    print(graph_coloring(graph, max_colors, num_vertices))