diff options
| author | mzuenni <michi.zuendorf@gmail.com> | 2022-06-27 17:19:28 +0200 |
|---|---|---|
| committer | mzuenni <michi.zuendorf@gmail.com> | 2022-06-27 17:19:28 +0200 |
| commit | 5ab8a5088b729a9953b8dff1b2a985dc8fb2098b (patch) | |
| tree | ed40d6936c0e9eee40ba62751cbf99ecddbaddc2 /graph/bronKerbosch.cpp | |
| parent | adabbad9c51cf7cd3874bfde8eac1fbcf84fec10 (diff) | |
updated tcr
Diffstat (limited to 'graph/bronKerbosch.cpp')
| -rw-r--r-- | graph/bronKerbosch.cpp | 24 |
1 files changed, 24 insertions, 0 deletions
diff --git a/graph/bronKerbosch.cpp b/graph/bronKerbosch.cpp new file mode 100644 index 0000000..caf2421 --- /dev/null +++ b/graph/bronKerbosch.cpp @@ -0,0 +1,24 @@ +using bits = bitset<64>; +vector<bits> adj, cliques; + +void addEdge(int a, int b) { + if (a != b) adj[a][b] = adj[b][a] = 1; +} + +void bronKerboschRec(bits R, bits P, bits X) { + if (!P.any() && !X.any()) { + cliques.push_back(R); + } else { + int q = (P | X)._Find_first(); + bits cands = P & ~adj[q]; + for (int i = 0; i < sz(adj); i++) if (cands[i]){ + R[i] = 1; + bronKerboschRec(P & adj[i], X & adj[i], R); + R[i] = P[i] = 0; + X[i] = 1; +}}} + +void bronKerbosch() { + cliques.clear(); + bronKerboschRec({}, {(1ull << sz(adj)) - 1}, {}); +} |
