Runs the Bron-Kerbosch algorithm for kint64max iterations. In practice,
this is equivalent to running until completion or until the clique callback
returns BronKerboschAlgorithmStatus::STOP. If the method returned because
the search is finished, it will return COMPLETED; otherwise, it will return
INTERRUPTED and it can be resumed by calling this method again.
Runs at most 'max_num_iterations' iterations of the Bron-Kerbosch
algorithm. When this function returns INTERRUPTED, there is still work to
be done to process all the cliques in the graph. In such case the method
can be called again and it will resume the work where the previous call had
stopped. When it returns COMPLETED any subsequent call to the method will
resume the search from the beginning.
Runs at most 'max_num_iterations' iterations of the Bron-Kerbosch
algorithm, until the time limit is exceeded or until all cliques are
enumerated. When this function returns INTERRUPTED, there is still work to
be done to process all the cliques in the graph. In such case the method
can be called again and it will resume the work where the previous call had
stopped. When it returns COMPLETED any subsequent call to the method will
resume the search from the beginning.
Runs the Bron-Kerbosch algorithm for at most kint64max iterations, until
the time limit is excceded or until all cliques are enumerated. In
practice, running the algorithm for kint64max iterations is equivalent to
running until completion or until the other stopping conditions apply. When
this function returns INTERRUPTED, there is still work to be done to
process all the cliques in the graph. In such case the method can be called
again and it will resume the work where the previous call had stopped. When
it returns COMPLETED any subsequent call to the method will resume the
search from the beginning.
[[["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."],[[["The `BronKerboschAlgorithm` class in Google's OR-Tools provides an implementation of the Bron-Kerbosch algorithm for finding all maximal cliques in a graph."],["It offers flexible execution control with methods to run until completion (`Run`), for a specific number of iterations (`RunIterations`), or with a time limit (`RunWithTimeLimit`)."],["The algorithm utilizes callback functions for graph representation (`IsArcCallback`) and clique processing (`CliqueCallback`)."],["Execution can be paused and resumed using the `BronKerboschAlgorithmStatus` return values, allowing for controlled exploration of cliques."],["The algorithm is designed to handle large graphs efficiently, offering options for limiting computation time and iteration counts."]]],["The `BronKerboschAlgorithm` class is initialized with graph information and a clique callback. It offers methods to run the algorithm: `Run` executes until completion or a callback stop; `RunIterations` runs for a specified number of iterations, allowing resumption if interrupted; `RunWithTimeLimit` combines iteration limits with a time constraint. All `Run...` methods return a status indicating completion or interruption, allowing the search to be resumed.\n"]]