mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-17 14:58:10 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update backtracking/coloring.py

Browse Source 
Co-authored-by: Christian Clauss <cclauss@me.com>
This commit is contained in:
Hardik Pawar 2024-10-01 08:22:15 +05:30 committed by GitHub
parent 9da28b0ccc
commit 42c32e7c4e
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
backtracking/coloring.py
View File

@ -125,7 +125,7 @@ def util_color(
def color(graph: list[list[int]], max_colors: int) -> list[int]: 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 Attempt to color the graph with at most max_colors colors such that no two adjacent
vertices have the same color. vertices have the same color.
If it is possible, returns the list of color assignments; If it is possible, returns the list of color assignments;
otherwise, returns an empty list. otherwise, returns an empty list.