The Wayback Machine - https://web.archive.org/web/20210605234245/https://github.com/TheAlgorithms/Java/pull/2226
Skip to content
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

Added "Minimum number of colors to color graph" with Bitmask solution #2226

Open
wants to merge 2 commits into
base: master
Choose a base branch
from

Conversation

@Yhtiyar
Copy link

@Yhtiyar Yhtiyar commented May 28, 2021

Describe your change:

  • Add an algorithm?
  • Fix a bug or typo in an existing algorithm?
  • Documentation change?

Problem:

Find minimal number of colors to color nodes of the given graph,
so there will be no connected nodes that are colored in the same color

Solution:

Dynamic programming on bitmask.

References

Checklist:

  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized.
  • I know that pull requests will not be merged if they fail the automated tests.
  • This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
  • All new Java files are placed inside an existing directory.
  • All filenames are in all uppercase characters with no spaces or dashes.
  • All functions and variable names follow Java naming conventions.
@Yhtiyar Yhtiyar changed the title Added "Minimum number of colors to color node" with Bitmask solution Added "Minimum number of colors to color graph" with Bitmask solution May 28, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Linked issues

Successfully merging this pull request may close these issues.

None yet

1 participant