Update m_coloring_problem.py

Author: sgindeed

backtracking/m_coloring_problem.py

@@ -1,4 +1,10 @@
-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.
 
@@ -7,10 +13,18 @@ def is_safe(node: int, color: int, graph: list[list[int]], num_vertices: int, co
     >>> 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.
 
@@ -30,7 +44,9 @@ def solve(node: int, col: list[int], max_colors: int, num_vertices: int, graph:
     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.