Bron kerbosch max cliques

[ArpitaHanjagi]

Algorithm: Bron–Kerbosch

Purpose: Finds all maximal cliques in an undirected graph.

Theory: Uses recursive backtracking with three sets:

R – currently growing clique

P – potential vertices to add

X – vertices already processed

Time Complexity: Exponential in worst case; optimal for sparse graphs.

Space Complexity: O(V + E) for adjacency list.

Input: Undirected graph as adjacency list.

Output: List of all maximal cliques.

[github-actions[bot]]

This PR is stale because it has been open 30 days with no activity. Remove stale label or comment or this will be closed in 7 days.

[github-actions[bot]]

This PR was closed because it has been stalled for 7 days with no activity.