<trclass="memdesc:"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Implements the Bron-Kerbosch algorithm for finding maximal cliques. <ahref="classoperations__research_1_1BronKerboschAlgorithm.html#details">More...</a><br/></td></tr>
<trclass="memdesc:namespaceoperations__research"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. <br/></td></tr>
<trclass="memdesc:af2d89e69d073dc3036a6de24710b416f"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Possible return values of the callback for reporting cliques. <ahref="namespaceoperations__research.html#af2d89e69d073dc3036a6de24710b416f">More...</a><br/></td></tr>
<trclass="memdesc:a708cf34b342e7d2ed89a3b73dbec4eae"><tdclass="mdescLeft"> </td><tdclass="mdescRight">The status value returned by BronKerboschAlgorithm::Run and BronKerboschAlgorithm::RunIterations. <ahref="namespaceoperations__research.html#a708cf34b342e7d2ed89a3b73dbec4eae">More...</a><br/></td></tr>
<trclass="memitem:a509097448ff5705cf3e64d889362bdec"><tdclass="memItemLeft"align="right"valign="top">void </td><tdclass="memItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#a509097448ff5705cf3e64d889362bdec">operations_research::FindCliques</a> (std::function< bool(int, int)> graph, int node_count, std::function< bool(const std::vector< int >&)> callback)</td></tr>
<trclass="memdesc:a509097448ff5705cf3e64d889362bdec"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Finds all maximal cliques, even of size 1, in the graph described by the graph callback. <ahref="namespaceoperations__research.html#a509097448ff5705cf3e64d889362bdec">More...</a><br/></td></tr>
<trclass="memitem:afe4b5a6c0e4019314f288e3f4307c114"><tdclass="memItemLeft"align="right"valign="top">void </td><tdclass="memItemRight"valign="bottom"><aclass="el"href="namespaceoperations__research.html#afe4b5a6c0e4019314f288e3f4307c114">operations_research::CoverArcsByCliques</a> (std::function< bool(int, int)> graph, int node_count, std::function< bool(const std::vector< int >&)> callback)</td></tr>
<trclass="memdesc:afe4b5a6c0e4019314f288e3f4307c114"><tdclass="mdescLeft"> </td><tdclass="mdescRight">Covers the maximum number of arcs of the graph with cliques. <ahref="namespaceoperations__research.html#afe4b5a6c0e4019314f288e3f4307c114">More...</a><br/></td></tr>