Details
-
Improvement
-
Status: Resolved
-
Minor
-
Resolution: Fixed
-
None
-
None
-
None
Description
Hi all, I just implemented a simple version of graph coloring problem.
This implementation contains the chromatic number ( is the minimal number of colors needed to color each vertex such that no two adjacent vertices share the same color) and also the coloring algorithm.