This project implements a graph coloring algorithm to demonstrate the NP-Completeness of the COL problem. The algorithm is designed to solve the problem in polynomial time, efficiently coloring the ...

You can create a release to package software, along with release notes and links to binary files, for other people to use. Learn more about releases in our docs.