C++ Reference: cliques
Note: This documentation is automatically generated.
Maximal clique algorithms, based on the Bron-Kerbosch algorithm. See
http://en.wikipedia.org/wiki/Bron-Kerbosch_algorithm and C. Bron and J. Kerbosch, Joep, "Algorithm 457: finding all cliques of an undirected graph", CACM 16 (9): 575-577, 1973.
http://dl.acm.org/citation.cfm?id=362367&bnc=1.
Keywords: undirected graph, clique, clique cover, Bron, Kerbosch.
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[[["This documentation details maximal clique algorithms based on the Bron-Kerbosch algorithm for finding all cliques within an undirected graph."],["The algorithms are derived from research by Bron and Kerbosch, published in their paper \"Algorithm 457: finding all cliques of an undirected graph\"."],["A primary class for utilizing these algorithms is the `BronKerboschAlgorithm`."]]],["The core content details C++ implementations of maximal clique algorithms, specifically those based on the Bron-Kerbosch algorithm. It references the original algorithm publication by Bron and Kerbosch in 1973. Key terms include undirected graph, clique, and clique cover. The documentation lists one class: `BronKerboschAlgorithm`, which is central to finding cliques within graphs. The content also links to external resources, such as Wikipedia and the original paper.\n"]]
