We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents 353e2c1 + 690b98d commit 8d7e896Copy full SHA for 8d7e896
.gitignore
README.md
@@ -1,4 +1,4 @@
1
# Graph Coloring Problem
2
This project consists in the implementation of algorithms to solve the NP-hard problem of Minimum Graph Coloring.
3
4
-It'll contain an heuristic algorithm along with an exact algorithm.
+An heuristic algorithm along with an exact algorithm will be implemented.
0 commit comments