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 Bron-Kerbosch algorithm in C, C++, java and python #1723

Closed
wants to merge 1 commit into from

Conversation

kumawatvinit
Copy link

πŸ› οΈ Issue (1687)

Issue no #1687

πŸ‘¨β€πŸ’» Changes proposed

Added Bron-Kerbosch algorithm in all languages as assigned

βœ”οΈ Check List (Check all the applicable boxes)

  • [βœ”οΈ] My code follows the code style of this project.
  • [βœ”οΈ] This PR does not contain plagiarized content.
  • [βœ”οΈ ] The title of my pull request is a short description of the requested changes.

πŸ“„ Note to reviewers

Used the following test case to test as it covers all aspects, test case from issue #1687 description.
image

πŸ“· Screenshots

C Code:

image

C++ Code:

image

Python Code:

image

Java Code:

image

@github-actions
Copy link

Thanks for your contribution we will soon check your PR @kumawatvinit :)

@Kumar-laxmi Kumar-laxmi added Graphs Algorithm for graphs C Program in C C++ Programs in C++ Python Programs in Python Java Programs in Java Under Review The PR is under review SSOC23 PR under Social Summer of Code labels Jul 18, 2023
@Kumar-laxmi Kumar-laxmi added Ready to Merge and removed Under Review The PR is under review labels Jul 27, 2023
@kumawatvinit
Copy link
Author

Please merge the PR asap as it is already ready to merge.

Copy link

Stale pull request message

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
C Program in C C++ Programs in C++ Graphs Algorithm for graphs Java Programs in Java no-pr-activity Python Programs in Python Ready to Merge SSOC23 PR under Social Summer of Code
Projects
None yet
Development

Successfully merging this pull request may close these issues.

5 participants