Details
-
Improvement
-
Status: Resolved
-
Minor
-
Resolution: Fixed
-
None
-
None
-
None
Description
Here is an little enhancement for graph coloring problem. I implemented an bruteforce algorithm that uses the backtracking technique to find the exact solution for the m-coloring problem (m is the maximum number of usable colors).