Bron–Kerbosch Algorithm in C, C++, Python and Java

[Kumar-laxmi]

Is your feature request related to a problem? Please describe. Yes, my feature request is related to a problem. I would like to implement Bron–Kerbosch algorithm using C, C++, Python and Java languages.

The Bron–Kerbosch algorithm is an enumeration algorithm for finding maximal cliques in an undirected graph. It lists all subsets of vertices with the two properties that each pair of vertices in one of the listed subsets is connected by an edge, and no listed subset can have any additional vertices added to it while preserving its complete connectivity.

Additional context

[Abhinavcode13]

Please assign me @Kumar-laxmi

[tarunvyshnav777]

Kindly assign me @Kumar-laxmi

[kumawatvinit]

Please assign this issue to me

[derphalesh]

@Kumar-laxmi please assign the issue to me will complete it within 4-5 days

[Kumar-laxmi]

Assigned! @kumawatvinit : C, C++, Java & Python

[Abhinavcode13]

Bro @Kumar-laxmi i mentioned it

[shivam0277]

i would like to work on this issue please it to me .

[Ashish1100]

Hi @kumar-laxmi, I will be happy to work on this algorithm in Python and this is an approach to solve the very algorithm:

Firstly, I will create a function called bron_kerbosch() that takes three arguments: the graph, the set of vertices in the clique so far, and the set of vertices that cannot be in the clique.

Secondly, iterate over the set of vertices that can be in the clique.

Fourth, for each vertex, generate a new clique by adding the vertex to the current clique and then recursively calling the bron_kerbosch() function on the new clique.

Fifth, the function then returns the list of all maximal cliques that it found. Create a main function that creates a graph and then calls the bron_kerbosch() function on the graph.

Lastly, The bron_kerbosch() function then prints out all of the maximal cliques in the graph.

** I am also working on C, C++ and Java Kindly, assign me the issue.

[github-actions[bot]]

Stale issue message