Added Graph coloring problem code i.e. to determine all the different ways in which graph can be colored using at most m colors. I have used Backtracking for this problem.
Also added Graph_Coloring_problem.md file.
Details:
Graph represented by its adjacency matrix.
Colors are represented by the integers 1,2,...,m.
I have used C++ language for this problem.
This problems issue number is #53 .
Description:
Added Graph coloring problem code i.e. to determine all the different ways in which graph can be colored using at most m colors. I have used Backtracking for this problem. Also added Graph_Coloring_problem.md file.
Details:
I have used C++ language for this problem. This problems issue number is #53 .