Fixes #53 - Githubissues

DSC-Banasthali-Vidyapith / Code-Crossroad

This project contains the carefully compiled Data Structures & Algorithm questions asked by the companies that visit Banasthali Vidyapith on-campus.

MIT License

55 stars 78 forks source link

Fixes #53 #62

Closed Karnika06 closed 3 years ago

Karnika06 commented 3 years ago

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.

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 .

Karnika06 commented 3 years ago

Okay. Will do it soon

Karnika06 commented 3 years ago

@sakshigoel19 I have created a new PR with a new branch and made the requested changes and also added the readme.md file. Please review it.

sakshigoel19 commented 3 years ago

Sure @Karnika06 , then you can close this pull request.