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

Introduce Bron-Kerbosch Algorithm #381

Closed
ZigRazor opened this issue Jan 8, 2024 · 0 comments · Fixed by #467
Closed

Introduce Bron-Kerbosch Algorithm #381

ZigRazor opened this issue Jan 8, 2024 · 0 comments · Fixed by #467
Labels
core something about core development Development of new Functionalities enhancement New feature or request hacktoberfest hacktoberfest issue Priority:Medium Priority Label for medium priority issue

Comments

@ZigRazor
Copy link
Owner

ZigRazor commented Jan 8, 2024

Please introduce Bron-Kerbosch algorithm to find all maximal cliques in an undirected graph.

@ZigRazor ZigRazor added enhancement New feature or request development Development of new Functionalities core something about core Priority:Medium Priority Label for medium priority issue labels Jan 8, 2024
@ZigRazor ZigRazor added this to the Algorithm Implementation milestone Jan 8, 2024
@danrr02 danrr02 mentioned this issue Oct 1, 2024
@ZigRazor ZigRazor linked a pull request Oct 2, 2024 that will close this issue
@ZigRazor ZigRazor added the hacktoberfest hacktoberfest issue label Oct 3, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
core something about core development Development of new Functionalities enhancement New feature or request hacktoberfest hacktoberfest issue Priority:Medium Priority Label for medium priority issue
Projects
None yet
Development

Successfully merging a pull request may close this issue.

1 participant