[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["\u003cp\u003eThis documentation details maximal clique algorithms based on the Bron-Kerbosch algorithm for finding all cliques within an undirected graph.\u003c/p\u003e\n"],["\u003cp\u003eThe algorithms are derived from research by Bron and Kerbosch, published in their paper "Algorithm 457: finding all cliques of an undirected graph".\u003c/p\u003e\n"],["\u003cp\u003eA primary class for utilizing these algorithms is the \u003ccode\u003eBronKerboschAlgorithm\u003c/code\u003e.\u003c/p\u003e\n"]]],["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"],null,[]]
