diff options
| author | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-11-16 01:24:14 +0100 |
|---|---|---|
| committer | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-11-16 01:24:14 +0100 |
| commit | 98567ec798aa8ca2cfbcb85c774dd470f30e30d4 (patch) | |
| tree | 5113d5cc24d1ad5f93810b6442ce584a36950dc8 /graph/bronKerbosch.cpp | |
| parent | ad3856a6b766087df0036de0b556f4700a6498c9 (diff) | |
| parent | 8d11c6c8213f46f0fa19826917c255edd5d43cb1 (diff) | |
mzuenni tests
Diffstat (limited to 'graph/bronKerbosch.cpp')
| -rw-r--r-- | graph/bronKerbosch.cpp | 24 |
1 files changed, 0 insertions, 24 deletions
diff --git a/graph/bronKerbosch.cpp b/graph/bronKerbosch.cpp deleted file mode 100644 index ceeb668..0000000 --- a/graph/bronKerbosch.cpp +++ /dev/null @@ -1,24 +0,0 @@ -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 = min(P._Find_first(), 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}, {}); -} |
