mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-27 17:06:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2024-09-30 15:08:59 +00:00
parent 4de67b014c
commit 92449bfb32
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
backtracking/coloring.py
View File

@ -1,6 +1,6 @@
"""
Graph Coloring (also called the "m coloring problem") is the problem of
assigning at most 'm' colors to the vertices of a graph such that
Graph Coloring (also called the "m coloring problem") is the problem of
assigning at most 'm' colors to the vertices of a graph such that
no two adjacent vertices share the same color.
Wikipedia: https://en.wikipedia.org/wiki/Graph_coloring
@ -119,7 +119,7 @@ def util_color(
def color(graph: list[list[int]], max_colors: int) -> list[int]:
"""
Attempts to color the graph with at most max_colors colors such that no two adjacent
Attempts to color the graph with at most max_colors colors such that no two adjacent
vertices have the same color. If it is possible, returns the list of color assignments;
otherwise, returns an empty list.