always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
99f7c8ae5942baea044ffe0677f8d2bb806cc4fd
ortools-clone/docs/cpp_graph/cliques_8h_source.html

114 lines
100 KiB
HTML
Raw Normal View History

add more C++ doc
2019-06-13 15:36:14 +02:00
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<title>OR-Tools</title>
<meta http-equiv="Content-Type" content="text/html;"/>
<meta charset="utf-8"/>
<!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
Update generated doc
2020-09-01 16:00:33 +02:00
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
add more C++ doc
2019-06-13 15:36:14 +02:00
</head>
<body>
<div id="banner-container">
<div id="banner">
docs: Update to v9.2
2021-12-14 13:41:01 +01:00
<span id="sfml">Google OR-Tools 9.2</span>
add more C++ doc
2019-06-13 15:36:14 +02:00
</div>
</div>
revamp refman generation
2019-08-07 18:01:08 -07:00
<div id="content" style="width: 100%; overflow: hidden;">
<div style="margin-left: 15px; margin-top: 5px; float: left; color: #145A32;">
update doc
2019-08-12 09:16:03 -07:00
<h2>C++ Reference</h2>
revamp refman generation
2019-08-07 18:01:08 -07:00
<ul>
<li><a href="../cpp_algorithms/annotated.html">Algorithms</a></li>
update doc
2019-08-12 09:16:03 -07:00
<li><a href="../cpp_sat/annotated.html">CP-SAT</a></li>
revamp refman generation
2019-08-07 18:01:08 -07:00
<li><a href="../cpp_graph/annotated.html">Graph</a></li>
<li><a href="../cpp_routing/annotated.html">Routing</a></li>
<li><a href="../cpp_linear/annotated.html">Linear solver</a></li>
</ul>
</div>
add more C++ doc
2019-06-13 15:36:14 +02:00
<div id="content">
revamp refman generation
2019-08-07 18:01:08 -07:00
<div align="center">
<h1 style="color: #145A32;">C++ Reference: Graph</h1>
</div>
regenerate doc
2022-01-16 18:02:36 +01:00
<!-- Generated by Doxygen 1.8.15 -->
Update generated doc
2020-09-01 16:00:33 +02:00
<script type="text/javascript">
regenerate doc
2022-01-16 18:02:36 +01:00
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
Update generated doc
2020-09-01 16:00:33 +02:00
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
regenerate doc
2022-01-16 18:02:36 +01:00
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
Update generated doc
2020-09-01 16:00:33 +02:00
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
regenerate doc
2022-01-16 18:02:36 +01:00
/* @license-end */</script>
Update generated doc
2020-09-01 16:00:33 +02:00
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
add more C++ doc
2019-06-13 15:36:14 +02:00
</div>
polish cpp doc
2019-07-12 13:25:23 -07:00
</div>
Update generated doc
2020-09-01 16:00:33 +02:00
<script type="text/javascript">
regenerate doc
2022-01-16 18:02:36 +01:00
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('cliques_8h_source.html','');});
Update generated doc
2020-09-01 16:00:33 +02:00
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
add more C++ doc
2019-06-13 15:36:14 +02:00
<div class="header">
regenerate doc
2022-01-16 18:02:36 +01:00
<div class="headertitle">
<div class="title">cliques.h</div> </div>
add more C++ doc
2019-06-13 15:36:14 +02:00
</div><!--header-->
<div class="contents">
regenerate doc
2022-01-16 18:02:36 +01:00
<a href="cliques_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span>&#160;<span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment">// Licensed under the Apache License, Version 2.0 (the &quot;License&quot;);</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span>&#160;<span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span>&#160;<span class="comment">// distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span>&#160;<span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span>&#160;<span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160;</div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="comment">// Maximal clique algorithms, based on the Bron-Kerbosch algorithm.</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;<span class="comment">// See http://en.wikipedia.org/wiki/Bron-Kerbosch_algorithm</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="comment">// and</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="comment">// C. Bron and J. Kerbosch, Joep, &quot;Algorithm 457: finding all cliques of an</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="comment">// undirected graph&quot;, CACM 16 (9): 575-577, 1973.</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="comment">// http://dl.acm.org/citation.cfm?id=362367&amp;bnc=1.</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="comment">// Keywords: undirected graph, clique, clique cover, Bron, Kerbosch.</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160;</div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="preprocessor">#ifndef OR_TOOLS_GRAPH_CLIQUES_H_</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160;<span class="preprocessor">#define OR_TOOLS_GRAPH_CLIQUES_H_</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160;</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160;<span class=
<div class="ttc" id="namespaceoperations__research_html_a7ffcae041a5d746371436101400cdb6b"><div class="ttname"><a href="namespaceoperations__research.html#a7ffcae041a5d746371436101400cdb6b">operations_research::NodeIndex</a></div><div class="ttdeci">int32_t NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00193">ebert_graph.h:193</a></div></div>
<div class="ttc" id="classoperations__research_1_1_bron_kerbosch_algorithm_html_ab7e6d525ff89ae730a1c917f3dccc3f0"><div class="ttname"><a href="classoperations__research_1_1_bron_kerbosch_algorithm.html#ab7e6d525ff89ae730a1c917f3dccc3f0">operations_research::BronKerboschAlgorithm::IsArcCallback</a></div><div class="ttdeci">std::function&lt; bool(NodeIndex, NodeIndex)&gt; IsArcCallback</div><div class="ttdef"><b>Definition:</b> <a href="cliques_8h_source.html#l00152">cliques.h:152</a></div></div>
<div class="ttc" id="classoperations__research_1_1_bron_kerbosch_algorithm_html_a4eb3c164e162e27f2d6ca3dd0b7355d4"><div class="ttname"><a href="classoperations__research_1_1_bron_kerbosch_algorithm.html#a4eb3c164e162e27f2d6ca3dd0b7355d4">operations_research::BronKerboschAlgorithm::RunWithTimeLimit</a></div><div class="ttdeci">BronKerboschAlgorithmStatus RunWithTimeLimit(int64_t max_num_iterations, TimeLimit *time_limit)</div><div class="ttdef"><b>Definition:</b> <a href="cliques_8h_source.html#l00511">cliques.h:511</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_a509097448ff5705cf3e64d889362bdec"><div class="ttname"><a href="namespaceoperations__research.html#a509097448ff5705cf3e64d889362bdec">operations_research::FindCliques</a></div><div class="ttdeci">void FindCliques(std::function&lt; bool(int, int)&gt; graph, int node_count, std::function&lt; bool(const std::vector&lt; int &gt; &amp;)&gt; callback)</div></div>
<div class="ttc" id="namespaceoperations__research_html_abd4e546b0e3afb0208c7a44ee6ab4ea8a8f7afecbc8fbc4cd0f50a57d1172482e"><div class="ttname"><a href="namespaceoperations__research.html#abd4e546b0e3afb0208c7a44ee6ab4ea8a8f7afecbc8fbc4cd0f50a57d1172482e">operations_research::BronKerboschAlgorithmStatus::COMPLETED</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_abd4e546b0e3afb0208c7a44ee6ab4ea8"><div class="ttname"><a href="namespaceoperations__research.html#abd4e546b0e3afb0208c7a44ee6ab4ea8">operations_research::BronKerboschAlgorithmStatus</a></div><div class="ttdeci">BronKerboschAlgorithmStatus</div><div class="ttdef"><b>Definition:</b> <a href="cliques_8h_source.html#l00070">cliques.h:70</a></div></div>
<div class="ttc" id="classoperations__research_1_1_bron_kerbosch_algorithm_html_a2f5f0a127dbe36c5518b68872efd8ad1"><div class="ttname"><a href="classoperations__research_1_1_bron_kerbosch_algorithm.html#a2f5f0a127dbe36c5518b68872efd8ad1">operations_research::BronKerboschAlgorithm::RunIterations</a></div><div class="ttdeci">BronKerboschAlgorithmStatus RunIterations(int64_t max_num_iterations)</div><div class="ttdef"><b>Definition:</b> <a href="cliques_8h_source.html#l00549">cliques.h:549</a></div></div>
<div class="ttc" id="classoperations__research_1_1_bron_kerbosch_algorithm_html_a14ad57c326955d7c5be67f0e444ff9eb"><div class="ttname"><a href="classoperations__research_1_1_bron_kerbosch_algorithm.html#a14ad57c326955d7c5be67f0e444ff9eb">operations_research::BronKerboschAlgorithm::Run</a></div><div class="ttdeci">BronKerboschAlgorithmStatus Run()</div><div class="ttdef"><b>Definition:</b> <a href="cliques_8h_source.html#l00556">cliques.h:556</a></div></div>
<div class="ttc" id="classoperations__research_1_1_bron_kerbosch_algorithm_html"><div class="ttname"><a href="classoperations__research_1_1_bron_kerbosch_algorithm.html">operations_research::BronKerboschAlgorithm</a></div><div class="ttdef"><b>Definition:</b> <a href="cliques_8h_source.html#l00146">cliques.h:146</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_abd4e546b0e3afb0208c7a44ee6ab4ea8a658f2cadfdf09b6046246e9314f7cd43"><div class="ttname"><a href="namespaceoperations__research.html#abd4e546b0e3afb0208c7a44ee6ab4ea8a658f2cadfdf09b6046246e9314f7cd43">operations_research::BronKerboschAlgorithmStatus::INTERRUPTED</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_ae6df4b4cb7c39ca06812199bbee9119ca2f453cfe638e57e27bb0c9512436111e"><div class="ttname"><a href="namespaceoperations__research.html#ae6df4b4cb7c39ca06812199bbee9119ca2f453cfe638e57e27bb0c9512436111e">operations_research::CliqueResponse::CONTINUE</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_afe4b5a6c0e4019314f288e3f4307c114"><div class="ttname"><a href="namespaceoperations__research.html#afe4b5a6c0e4019314f288e3f4307c114">operations_research::CoverArcsByCliques</a></div><div class="ttdeci">void CoverArcsByCliques(std::function&lt; bool(int, int)&gt; graph, int node_count, std::function&lt; bool(const std::vector&lt; int &gt; &amp;)&gt; callback)</div></div>
<div class="ttc" id="namespaceoperations__research_html_ae6df4b4cb7c39ca06812199bbee9119ca615a46af313786fc4e349f34118be111"><div class="ttname"><a href="namespaceoperations__research.html#ae6df4b4cb7c39ca06812199bbee9119ca615a46af313786fc4e349f34118be111">operations_research::CliqueResponse::STOP</a></div></div>
<div class="ttc" id="classoperations__research_1_1_bron_kerbosch_algorithm_html_aff90108523eb5a8ec3549adc67355aa1"><div class="ttname"><a href="classoperations__research_1_1_bron_kerbosch_algorithm.html#aff90108523eb5a8ec3549adc67355aa1">operations_research::BronKerboschAlgorithm::CliqueCallback</a></div><div class="ttdeci">std::function&lt; CliqueResponse(const std::vector&lt; NodeIndex &gt; &amp;)&gt; CliqueCallback</div><div class="ttdef"><b>Definition:</b> <a href="cliques_8h_source.html#l00162">cliques.h:162</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_ae6df4b4cb7c39ca06812199bbee9119c"><div class="ttname"><a href="namespaceoperations__research.html#ae6df4b4cb7c39ca06812199bbee9119c">operations_research::CliqueResponse</a></div><div class="ttdeci">CliqueResponse</div><div class="ttdef"><b>Definition:</b> <a href="cliques_8h_source.html#l00060">cliques.h:60</a></div></div>
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00043">christofides.h:43</a></div></div>
<div class="ttc" id="classoperations__research_1_1_bron_kerbosch_algorithm_html_a8594a59f12eedf7ed0d8f8d2e56ca751"><div class="ttname"><a href="classoperations__research_1_1_bron_kerbosch_algorithm.html#a8594a59f12eedf7ed0d8f8d2e56ca751">operations_research::BronKerboschAlgorithm::RunWithTimeLimit</a></div><div class="ttdeci">BronKerboschAlgorithmStatus RunWithTimeLimit(TimeLimit *time_limit)</div><div class="ttdef"><b>Definition:</b> <a href="cliques_8h_source.html#l00206">cliques.h:206</a></div></div>
Bump version 8.1 -> 8.2
2021-01-26 11:28:50 +01:00
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
revamp refman generation
2019-08-07 18:01:08 -07:00
</div>
add more C++ doc
2019-06-13 15:36:14 +02:00
</div>
<div id="footer-container">
<div id="footer">
</div>
</div>
</body>
</html>
Reference in New Issue Copy Permalink