Graph Coloring Algorithm using Backtracking
Please include a summary of the change and which issue is fixed. Please also include relevant motivation and context. List any dependencies that are required for this change.
We have been given a graph and we are asked to color all vertices with the ‘M’ number of given colors, in such a way that no two adjacent vertices should have the same color.
Fixes: #(issue no.)
212
Type of change
[ x] Bug fix (non-breaking change which fixes an issue)
[✔️ ] New feature (non-breaking change which adds functionality)
[x ] This change requires a documentation update
Checklist:
[ ✔️] I have made this from my own
[✔️ ] I have taken help from some online resources
[✔️ ] My code follows the style guidelines of this project
[✔️ ] I have performed a self-review of my own code
[✔️ ] I have made corresponding changes to the documentation
Description
Graph Coloring Algorithm using Backtracking Please include a summary of the change and which issue is fixed. Please also include relevant motivation and context. List any dependencies that are required for this change. We have been given a graph and we are asked to color all vertices with the ‘M’ number of given colors, in such a way that no two adjacent vertices should have the same color. Fixes: #(issue no.)
212
Type of change
Checklist:
ATTACH SCREEN-SHOTS / DEPLOYMENT LINK