 Bron–Kerbosch algorithm

The Bron–Kerbosch algorithm is a classic recursive backtracking algorithm used to find all maximal cliques in an undirected graph. A **maximal clique** is a subset of vertices such that every two vertices in the subset are adjacent (forming a complete subgraph) and cannot be extended by including one more adjacent vertex. ### Key Concepts: - **Clique**: A subset of vertices that forms a complete graph. In a clique, every pair of vertices is connected by an edge.