Files
ortools-clone/docs/cpp_graph/strongly__connected__components_8h_source.html

106 lines
44 KiB
HTML
Raw Normal View History

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>
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"/>
2019-06-13 15:36:14 +02:00
</head>
<body>
<div id="banner-container">
<div id="banner">
2021-09-20 15:57:27 +02:00
<span id="sfml">Google OR-Tools 9.1</span>
2019-06-13 15:36:14 +02:00
</div>
</div>
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;">
2019-08-12 09:16:03 -07:00
<h2>C++ Reference</h2>
2019-08-07 18:01:08 -07:00
<ul>
<li><a href="../cpp_algorithms/annotated.html">Algorithms</a></li>
2019-08-12 09:16:03 -07:00
<li><a href="../cpp_sat/annotated.html">CP-SAT</a></li>
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>
2019-06-13 15:36:14 +02:00
<div id="content">
2019-08-07 18:01:08 -07:00
<div align="center">
<h1 style="color: #145A32;">C++ Reference: Graph</h1>
</div>
2021-09-20 15:57:27 +02:00
<!-- Generated by Doxygen 1.8.15 -->
2020-09-01 16:00:33 +02:00
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
2021-09-20 15:57:27 +02:00
var searchBox = new SearchBox("searchBox", "search",false,'Search');
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">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<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">
2019-06-13 15:36:14 +02:00
</div>
2019-07-12 13:25:23 -07:00
</div>
2020-09-01 16:00:33 +02:00
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
2021-09-20 15:57:27 +02:00
$(document).ready(function(){initNavTree('strongly__connected__components_8h_source.html','');});
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>
2019-06-13 15:36:14 +02:00
<div class="header">
<div class="headertitle">
<div class="title">strongly_connected_components.h</div> </div>
</div><!--header-->
<div class="contents">
2021-09-20 15:57:27 +02:00
<a href="strongly__connected__components_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">// This code computes the strongly connected components of a directed graph,</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="comment">// and presents them sorted by reverse topological order.</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="comment">// It implements an efficient version of Tarjan&#39;s strongly connected components</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="comment">// algorithm published in: Tarjan, R. E. (1972), &quot;Depth-first search and linear</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="comment">// graph algorithms&quot;, SIAM Journal on Computing.</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="comment">// A description can also be found here:</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="comment">// http://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="comment">// SIMPLE EXAMPLE:</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160;<span clas
<div class="ttc" id="struct_scc_counter_output_html_aa1c5d9076a0daa336ed562752e6fd5a3"><div class="ttname"><a href="struct_scc_counter_output.html#aa1c5d9076a0daa336ed562752e6fd5a3">SccCounterOutput::number_of_components</a></div><div class="ttdeci">int number_of_components</div><div class="ttdef"><b>Definition:</b> <a href="strongly__connected__components_8h_source.html#l00084">strongly_connected_components.h:84</a></div></div>
<div class="ttc" id="class_strongly_connected_components_finder_html"><div class="ttname"><a href="class_strongly_connected_components_finder.html">StronglyConnectedComponentsFinder</a></div><div class="ttdef"><b>Definition:</b> <a href="strongly__connected__components_8h_source.html#l00104">strongly_connected_components.h:104</a></div></div>
<div class="ttc" id="struct_scc_counter_output_html_ac706b4714b4a833d82f355d3c06c18af"><div class="ttname"><a href="struct_scc_counter_output.html#ac706b4714b4a833d82f355d3c06c18af">SccCounterOutput::emplace_back</a></div><div class="ttdeci">void emplace_back(NodeIndex const *b, NodeIndex const *e)</div><div class="ttdef"><b>Definition:</b> <a href="strongly__connected__components_8h_source.html#l00085">strongly_connected_components.h:85</a></div></div>
<div class="ttc" id="struct_scc_counter_output_html"><div class="ttname"><a href="struct_scc_counter_output.html">SccCounterOutput</a></div><div class="ttdef"><b>Definition:</b> <a href="strongly__connected__components_8h_source.html#l00083">strongly_connected_components.h:83</a></div></div>
<div class="ttc" id="class_strongly_connected_components_finder_html_ae578e6662172f4c25bb8ad068a597ba5"><div class="ttname"><a href="class_strongly_connected_components_finder.html#ae578e6662172f4c25bb8ad068a597ba5">StronglyConnectedComponentsFinder::FindStronglyConnectedComponents</a></div><div class="ttdeci">void FindStronglyConnectedComponents(const NodeIndex num_nodes, const Graph &amp;graph, SccOutput *components)</div><div class="ttdef"><b>Definition:</b> <a href="strongly__connected__components_8h_source.html#l00106">strongly_connected_components.h:106</a></div></div>
<div class="ttc" id="namespaceutil_html_a2f76166dbe0c4055a1f256235ad00478"><div class="ttname"><a href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">util::Graph</a></div><div class="ttdeci">ListGraph Graph</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02361">graph.h:2361</a></div></div>
<div class="ttc" id="strongly__connected__components_8h_html_aafab5785b250e1013c13511ce478f36b"><div class="ttname"><a href="strongly__connected__components_8h.html#aafab5785b250e1013c13511ce478f36b">FindStronglyConnectedComponents</a></div><div class="ttdeci">void FindStronglyConnectedComponents(const NodeIndex num_nodes, const Graph &amp;graph, SccOutput *components)</div><div class="ttdef"><b>Definition:</b> <a href="strongly__connected__components_8h_source.html#l00212">strongly_connected_components.h:212</a></div></div>
<div class="ttc" id="class_strongly_connected_components_finder_html_a4db5c4e5c0437428c74f692ac4601af7"><div class="ttname"><a href="class_strongly_connected_components_finder.html#a4db5c4e5c0437428c74f692ac4601af7">StronglyConnectedComponentsFinder::NodeIsInCurrentDfsPath</a></div><div class="ttdeci">bool NodeIsInCurrentDfsPath(NodeIndex node) const</div><div class="ttdef"><b>Definition:</b> <a href="strongly__connected__components_8h_source.html#l00177">strongly_connected_components.h:177</a></div></div>
<div class="ttc" id="struct_scc_counter_output_html_af9593d4a5ff4274efaf429cb4f9e57cc"><div class="ttname"><a href="struct_scc_counter_output.html#af9593d4a5ff4274efaf429cb4f9e57cc">SccCounterOutput::size</a></div><div class="ttdeci">int size() const</div><div class="ttdef"><b>Definition:</b> <a href="strongly__connected__components_8h_source.html#l00090">strongly_connected_components.h:90</a></div></div>
2021-01-26 11:28:50 +01:00
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
2019-08-07 18:01:08 -07:00
</div>
2019-06-13 15:36:14 +02:00
</div>
<div id="footer-container">
<div id="footer">
</div>
</div>
</body>
</html>