Welsh Powell Algorithm for Graph coloring

[sanskritip]

Feature ✅

Description

Welsh Powell is used to implement graph labeling/coloring; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints.

Example

The program will basically take a graph input and return the color assignments for every node.

Checklist:

• I have read the project guidelines.
• I have checked all the existing projects, before submitting a new project issue.
• This issue will be meaningful for the project.
• I will contribute more in future

Implementation using C.

[sanskritip]

I'd like to work on this using C.

[Nishitk-20]

I would like to do it in cpp

[pratik-choudhari]

@Nishitk-20 C and c++ are not distinguished in this repo.

[Nishitk-20]

@pratik-choudhari
yes I saw, no problem

[SanidhayaAgarwal]

Hello, @sanskritip

I'm excited to participate in Hacktoberfest and contribute to this repository. Please consider me for any relevant tasks or issues. I look forward to collaborating with the community.

Thank you!

[SanidhayaAgarwal]

Hello, @sanskritip

I'm excited to participate in Hacktoberfest and contribute to this repository. Please consider me for any relevant tasks or issues. I look forward to collaborating with the community.

Thank you!