-
Notifications
You must be signed in to change notification settings - Fork 18.7k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[FEATURE REQUEST] <Java Implementation of Graph Coloring Problem> #4722
Comments
I want to do this problem |
@amaan14999 Hello, if no one is working on this I can implement it! |
This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions. |
Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions! |
What would you like to Propose?
Proposal: Addition of Graph Coloring Problem algorithm under, https://github.com/TheAlgorithms/Java/tree/master/src/main/java/com/thealgorithms/greedyalgorithms
Filename: GraphColoring.java
Overview
The graph coloring problem asks to assign colors to the vertices of a graph in such a way that no two adjacent vertices share the same color. The objective is often to color the graph with as few colors as possible.
More Details
https://en.wikipedia.org/wiki/Graph_coloring
Issue details
The greedy coloring algorithm is a straightforward approach to solve this problem. Here's a basic outline of the greedy algorithm:
For each subsequent vertex, look at its neighbors and determine what colors have already been assigned. Assign the smallest possible color that hasn't been used by its neighbors.
Pseudo Code:
Additional Information
No response
The text was updated successfully, but these errors were encountered: