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

144 lines
106 KiB
HTML
Raw Normal View History

2020-01-31 17:22:59 +01: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"/>
2020-01-31 17:22:59 +01: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>
2020-01-31 17:22:59 +01:00
</div>
</div>
<div id="content" style="width: 100%; overflow: hidden;">
<div style="margin-left: 15px; margin-top: 5px; float: left; color: #145A32;">
<h2>C++ Reference</h2>
<ul>
<li><a href="../cpp_algorithms/annotated.html">Algorithms</a></li>
<li><a href="../cpp_sat/annotated.html">CP-SAT</a></li>
<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>
<div id="content">
<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">
2020-01-31 17:22:59 +01:00
</div>
</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('util_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>
2020-01-31 17:22:59 +01:00
<div class="header">
<div class="headertitle">
<div class="title">util.h</div> </div>
</div><!--header-->
<div class="contents">
2021-09-20 15:57:27 +02:00
<a href="util_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">// A collections of utilities for the Graph classes in ./graph.h.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;</div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;<span class="preprocessor">#ifndef UTIL_GRAPH_UTIL_H_</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="preprocessor">#define UTIL_GRAPH_UTIL_H_</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;</div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="preprocessor">#include &lt;algorithm&gt;</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="preprocessor">#include &lt;cstdint&gt;</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="preprocessor">#include &lt;map&gt;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="preprocessor">#include &lt;memory&gt;</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160;<span class="preprocessor">#include &lt;set&gt;</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="preprocessor">#include &lt;string&gt;</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160;<span class="preprocessor">#include &lt;vector&gt;</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="preprocessor">#include &quot;absl/container/flat_hash_map.h&quot;</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160;<span class="preproces
<div class="ttc" id="classutil_1_1_list_graph_html_ad7db584fc1fe14ce9296131fda625994"><div class="ttname"><a href="classutil_1_1_list_graph.html#ad7db584fc1fe14ce9296131fda625994">util::ListGraph::OutgoingArcs</a></div><div class="ttdeci">BeginEndWrapper&lt; OutgoingArcIterator &gt; OutgoingArcs(NodeIndexType node) const</div></div>
<div class="ttc" id="namespaceutil_html_ad7986b01cf61a31c09a27b4a97db6a83"><div class="ttname"><a href="namespaceutil.html#ad7986b01cf61a31c09a27b4a97db6a83">util::IsValidPermutation</a></div><div class="ttdeci">bool IsValidPermutation(const std::vector&lt; int &gt; &amp;v)</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00145">util.h:145</a></div></div>
<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="classutil_1_1_list_graph_html_aceb0938bcb2e8e5f37986d4cf8e3a955"><div class="ttname"><a href="classutil_1_1_list_graph.html#aceb0938bcb2e8e5f37986d4cf8e3a955">util::ListGraph::Head</a></div><div class="ttdeci">NodeIndexType Head(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01118">graph.h:1118</a></div></div>
<div class="ttc" id="namespaceutil_html"><div class="ttname"><a href="namespaceutil.html">util</a></div><div class="ttdef"><b>Definition:</b> <a href="connected__components_8h_source.html#l00056">connected_components.h:56</a></div></div>
<div class="ttc" id="namespaceutil_html_a95c44a2c444a459f0866bd5607537314"><div class="ttname"><a href="namespaceutil.html#a95c44a2c444a459f0866bd5607537314">util::RemoveSelfArcsAndDuplicateArcs</a></div><div class="ttdeci">std::unique_ptr&lt; Graph &gt; RemoveSelfArcsAndDuplicateArcs(const Graph &amp;graph)</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00329">util.h:329</a></div></div>
<div class="ttc" id="namespaceutil_html_a3215b610ebe65cde55008dc1367c434e"><div class="ttname"><a href="namespaceutil.html#a3215b610ebe65cde55008dc1367c434e">util::PathHasCycle</a></div><div class="ttdeci">bool PathHasCycle(const Graph &amp;graph, const std::vector&lt; int &gt; &amp;arc_path)</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00376">util.h:376</a></div></div>
<div class="ttc" id="classutil_1_1_undirected_adjacency_lists_of_directed_graph_1_1_adjacency_list_iterator_html_a544dc5fdf254f2bcd1b7dfa67ef41b7a"><div class="ttname"><a href="classutil_1_1_undirected_adjacency_lists_of_directed_graph_1_1_adjacency_list_iterator.html#a544dc5fdf254f2bcd1b7dfa67ef41b7a">util::UndirectedAdjacencyListsOfDirectedGraph::AdjacencyListIterator::AdjacencyListIterator</a></div><div class="ttdeci">AdjacencyListIterator(const Graph &amp;graph, ArcIterator &amp;&amp;arc_it)</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00108">util.h:108</a></div></div>
<div class="ttc" id="classutil_1_1_base_graph_html_a10ee27e856003f599bc0a2265a3ab11d"><div class="ttname"><a href="classutil_1_1_base_graph.html#a10ee27e856003f599bc0a2265a3ab11d">util::BaseGraph::AllForwardArcs</a></div><div class="ttdeci">IntegerRange&lt; ArcIndex &gt; AllForwardArcs() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00942">graph.h:942</a></div></div>
<div class="ttc" id="classutil_1_1_base_graph_html_a4d3fc55a2fe209a908470199437cec9a"><div class="ttname"><a href="classutil_1_1_base_graph.html#a4d3fc55a2fe209a908470199437cec9a">util::BaseGraph::num_arcs</a></div><div class="ttdeci">ArcIndexType num_arcs() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00206">graph.h:206</a></div></div>
<div class="ttc" id="classutil_1_1_undirected_adjacency_lists_of_directed_graph_html_acb3986c66a9d18524b947fd391f68240"><div class="ttname"><a href="classutil_1_1_undirected_adjacency_lists_of_directed_graph.html#acb3986c66a9d18524b947fd391f68240">util::UndirectedAdjacencyListsOfDirectedGraph::operator[]</a></div><div class="ttdeci">BeginEndWrapper&lt; AdjacencyListIterator &gt; operator[](int node) const</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00120">util.h:120</a></div></div>
<div class="ttc" id="classutil_1_1_list_graph_html_a2eeae3a8497dc3942e3db3128a10d41c"><div class="ttname"><a href="classutil_1_1_list_graph.html#a2eeae3a8497dc3942e3db3128a10d41c">util::ListGraph::Tail</a></div><div class="ttdeci">NodeIndexType Tail(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01111">graph.h:1111</a></div></div>
<div class="ttc" id="namespaceutil_html_a00a901881f9035f66a4204da4c0ea3e5"><div class="ttname"><a href="namespaceutil.html#a00a901881f9035f66a4204da4c0ea3e5">util::ComputeOnePossibleReverseArcMapping</a></div><div class="ttdeci">std::vector&lt; int &gt; ComputeOnePossibleReverseArcMapping(const Graph &amp;graph, bool die_if_not_symmetric)</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00387">util.h:387</a></div></div>
<div class="ttc" id="namespaceutil_html_a77ac83968fcb358183853127d83d595a"><div class="ttname"><a href="namespaceutil.html#a77ac83968fcb358183853127d83d595a">util::RemoveCyclesFromPath</a></div><div class="ttdeci">void RemoveCyclesFromPath(const Graph &amp;graph, std::vector&lt; int &gt; *arc_path)</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00351">util.h:351</a></div></div>
<div class="ttc" id="classutil_1_1_static_graph_html_a7b505ba4a01bce342d049f5a8674da72"><div class="ttname"><a href="classutil_1_1_static_graph.html#a7b505ba4a01bce342d049f5a8674da72">util::StaticGraph::AddArc</a></div><div class="ttdeci">ArcIndexType AddArc(NodeIndexType tail, NodeIndexType head)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01286">graph.h:1286</a></div></div>
<div class="ttc" id="classutil_1_1_undirected_adjacency_lists_of_directed_graph_1_1_adjacency_list_iterator_html"><div class="ttname"><a href="classutil_1_1_undirected_adjacency_lists_of_directed_graph_1_1_adjacency_list_iterator.html">util::UndirectedAdjacencyListsOfDirectedGraph::AdjacencyListIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00106">util.h:106</a></div></div>
<div class="ttc" id="namespaceutil_html_a9aedc5b3920b0ce89959be43ece7625b"><div class="ttname"><a href="namespaceutil.html#a9aedc5b3920b0ce89959be43ece7625b">util::GraphHasSelfArcs</a></div><div class="ttdeci">bool GraphHasSelfArcs(const Graph &amp;graph)</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00192">util.h:192</a></div></div>
<div class="ttc" id="classutil_1_1_static_graph_html"><div class="ttname"><a href="classutil_1_1_static_graph.html">util::StaticGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00398">graph.h:398</a></div></div>
<div class="ttc" id="namespaceutil_html_a366d433bd2afb387ea527c581447dffc"><div class="ttname"><a href="namespaceutil.html#a366d433bd2afb387ea527c581447dffc">util::GetConnectedComponents</a></div><div class="ttdeci">std::vector&lt; int &gt; GetConnectedComponents(int num_nodes, const UndirectedGraph &amp;graph)</div><div class="ttdef"><b>Definition:</b> <a href="connected__components_8h_source.html#l00302">connected_components.h:302</a></div></div>
<div class="ttc" id="connected__components_8h_html"><div class="ttname"><a href="connected__components_8h.html">connected_components.h</a></div></div>
<div class="ttc" id="namespaceutil_html_aa94a02ae5c14feb50676668f2de166dc"><div class="ttname"><a href="namespaceutil.html#aa94a02ae5c14feb50676668f2de166dc">util::GraphIsSymmetric</a></div><div class="ttdeci">bool GraphIsSymmetric(const Graph &amp;graph)</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00218">util.h:218</a></div></div>
<div class="ttc" id="iterators_8h_html"><div class="ttname"><a href="iterators_8h.html">iterators.h</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_aecf320bda6e95d1edaf3a546673e3e6b"><div class="ttname"><a href="namespaceoperations__research.html#aecf320bda6e95d1edaf3a546673e3e6b">operations_research::ArcIndex</a></div><div class="ttdeci">int32_t ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00202">ebert_graph.h:202</a></div></div>
<div class="ttc" id="namespaceutil_html_aa9fb4c9a176acaf72053b11727436e9e"><div class="ttname"><a href="namespaceutil.html#aa9fb4c9a176acaf72053b11727436e9e">util::IsSubsetOf0N</a></div><div class="ttdeci">bool IsSubsetOf0N(const std::vector&lt; int &gt; &amp;v, int n)</div></div>
<div class="ttc" id="classutil_1_1_list_graph_html_a7b505ba4a01bce342d049f5a8674da72"><div class="ttname"><a href="classutil_1_1_list_graph.html#a7b505ba4a01bce342d049f5a8674da72">util::ListGraph::AddArc</a></div><div class="ttdeci">ArcIndexType AddArc(NodeIndexType tail, NodeIndexType head)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01141">graph.h:1141</a></div></div>
<div class="ttc" id="namespaceutil_html_a7cab01cf2313ef202fdb8d1540430c1c"><div class="ttname"><a href="namespaceutil.html#a7cab01cf2313ef202fdb8d1540430c1c">util::GraphHasDuplicateArcs</a></div><div class="ttdeci">bool GraphHasDuplicateArcs(const Graph &amp;graph)</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00200">util.h:200</a></div></div>
<div class="ttc" id="classutil_1_1_begin_end_wrapper_html"><div class="ttname"><a href="classutil_1_1_begin_end_wrapper.html">util::BeginEndWrapper</a></div><div class="ttdef"><b>Definition:</b> <a href="iterators_8h_source.html#l00038">iterators.h:38</a></div></div>
<div class="ttc" id="classutil_1_1_list_graph_html"><div class="ttname"><a href="classutil_1_1_list_graph.html">util::ListGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00299">graph.h:299</a></div></div>
<div class="ttc" id="namespaceutil_html_ae5f98804c317dda817bff628d868c4dd"><div class="ttname"><a href="namespaceutil.html#ae5f98804c317dda817bff628d868c4dd">util::CopyGraph</a></div><div class="ttdeci">std::unique_ptr&lt; Graph &gt; CopyGraph(const Graph &amp;graph)</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00263">util.h:263</a></div></div>
<div class="ttc" id="classutil_1_1_list_graph_html_a6a4d37693b809140b0dde7abd463d04e"><div class="ttname"><a href="classutil_1_1_list_graph.html#a6a4d37693b809140b0dde7abd463d04e">util::ListGraph::Build</a></div><div class="ttdeci">void Build()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00341">graph.h:341</a></div></div>
<div class="ttc" id="class_dense_connected_components_finder_html_ad8e718920ab9683d39af650d714cffe1"><div class="ttname"><a href="class_dense_connected_components_finder.html#ad8e718920ab9683d39af650d714cffe1">DenseConnectedComponentsFinder::SetNumberOfNodes</a></div><div class="ttdeci">void SetNumberOfNodes(int num_nodes)</div></div>
<div class="ttc" id="classutil_1_1_undirected_adjacency_lists_of_directed_graph_1_1_adjacency_list_iterator_html_ad4452fdabbda5c829124e1ab81bd750a"><div class="ttname"><a href="classutil_1_1_undirected_adjacency_lists_of_directed_graph_1_1_adjacency_list_iterator.html#ad4452fdabbda5c829124e1ab81bd750a">util::UndirectedAdjacencyListsOfDirectedGraph::AdjacencyListIterator::operator *</a></div><div class="ttdeci">Graph::NodeIndex operator *() const</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00111">util.h:111</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="graph_8h_html"><div class="ttname"><a href="graph_8h.html">graph.h</a></div></div>
<div class="ttc" id="classutil_1_1_undirected_adjacency_lists_of_directed_graph_html_a2380f2634e304c2161485c0d395b78eb"><div class="ttname"><a href="classutil_1_1_undirected_adjacency_lists_of_directed_graph.html#a2380f2634e304c2161485c0d395b78eb">util::UndirectedAdjacencyListsOfDirectedGraph::ArcIterator</a></div><div class="ttdeci">Graph::OutgoingOrOppositeIncomingArcIterator ArcIterator</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00105">util.h:105</a></div></div>
<div class="ttc" id="class_dense_connected_components_finder_html_af1a300e659dbc3041b1485f12855bd31"><div class="ttname"><a href="class_dense_connected_components_finder.html#af1a300e659dbc3041b1485f12855bd31">DenseConnectedComponentsFinder::GetNumberOfComponents</a></div><div class="ttdeci">int GetNumberOfComponents() const</div><div class="ttdef"><b>Definition:</b> <a href="connected__components_8h_source.html#l00099">connected_components.h:99</a></div></div>
<div class="ttc" id="classutil_1_1_base_graph_html_a8a40f2c75615a26ba71e94dd7d42f481"><div class="ttname"><a href="classutil_1_1_base_graph.html#a8a40f2c75615a26ba71e94dd7d42f481">util::BaseGraph::AllNodes</a></div><div class="ttdeci">IntegerRange&lt; NodeIndex &gt; AllNodes() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00936">graph.h:936</a></div></div>
<div class="ttc" id="namespaceutil_html_ab34783e729bb5fc99042893f6bfcbb2f"><div class="ttname"><a href="namespaceutil.html#ab34783e729bb5fc99042893f6bfcbb2f">util::GetWeaklyConnectedComponents</a></div><div class="ttdeci">std::vector&lt; int &gt; GetWeaklyConnectedComponents(const Graph &amp;graph)</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00134">util.h:134</a></div></div>
<div class="ttc" id="classutil_1_1_base_graph_html_a6a2df5042167b234f6dc3aed4acfa6c9"><div class="ttname"><a href="classutil_1_1_base_graph.html#a6a2df5042167b234f6dc3aed4acfa6c9">util::BaseGraph::num_nodes</a></div><div class="ttdeci">NodeIndexType num_nodes() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00203">graph.h:203</a></div></div>
<div class="ttc" id="namespaceutil_html_aab5724a929530fa1d28749dc82852388"><div class="ttname"><a href="namespaceutil.html#aab5724a929530fa1d28749dc82852388">util::RemapGraph</a></div><div class="ttdeci">std::unique_ptr&lt; Graph &gt; RemapGraph(const Graph &amp;graph, const std::vector&lt; int &gt; &amp;new_node_index)</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00276">util.h:276</a></div></div>
<div class="ttc" id="classutil_1_1_base_graph_html_aec05ff3d270a5f888e1623c2a99ff2aa"><div class="ttname"><a href="classutil_1_1_base_graph.html#aec05ff3d270a5f888e1623c2a99ff2aa">util::BaseGraph&lt; NodeIndexType, ArcIndexType, false &gt;::NodeIndex</a></div><div class="ttdeci">NodeIndexType NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00191">graph.h:191</a></div></div>
<div class="ttc" id="classutil_1_1_base_graph_html_a92531459eff09455cfa63976f5024906"><div class="ttname"><a href="classutil_1_1_base_graph.html#a92531459eff09455cfa63976f5024906">util::BaseGraph&lt; NodeIndexType, ArcIndexType, false &gt;::ArcIndex</a></div><div class="ttdeci">ArcIndexType ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00192">graph.h:192</a></div></div>
<div class="ttc" id="class_dense_connected_components_finder_html_a428ab6b7c944afe33bd86a6a1ae7e668"><div class="ttname"><a href="class_dense_connected_components_finder.html#a428ab6b7c944afe33bd86a6a1ae7e668">DenseConnectedComponentsFinder::AddEdge</a></div><div class="ttdeci">bool AddEdge(int node1, int node2)</div></div>
<div class="ttc" id="classutil_1_1_undirected_adjacency_lists_of_directed_graph_html_a0a6c3259e0f5b11ae67f15beefa1020c"><div class="ttname"><a href="classutil_1_1_undirected_adjacency_lists_of_directed_graph.html#a0a6c3259e0f5b11ae67f15beefa1020c">util::UndirectedAdjacencyListsOfDirectedGraph::UndirectedAdjacencyListsOfDirectedGraph</a></div><div class="ttdeci">UndirectedAdjacencyListsOfDirectedGraph(const Graph &amp;graph)</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00102">util.h:102</a></div></div>
<div class="ttc" id="classutil_1_1_undirected_adjacency_lists_of_directed_graph_html"><div class="ttname"><a href="classutil_1_1_undirected_adjacency_lists_of_directed_graph.html">util::UndirectedAdjacencyListsOfDirectedGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00100">util.h:100</a></div></div>
<div class="ttc" id="namespaceutil_html_ab66702bf387ec38027c1f94444872510"><div class="ttname"><a href="namespaceutil.html#ab66702bf387ec38027c1f94444872510">util::GraphIsWeaklyConnected</a></div><div class="ttdeci">bool GraphIsWeaklyConnected(const Graph &amp;graph)</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00247">util.h:247</a></div></div>
<div class="ttc" id="namespaceutil_html_a99094e047812eb44a7c2b3b82091f560"><div class="ttname"><a href="namespaceutil.html#a99094e047812eb44a7c2b3b82091f560">util::GetSubgraphOfNodes</a></div><div class="ttdeci">std::unique_ptr&lt; Graph &gt; GetSubgraphOfNodes(const Graph &amp;graph, const std::vector&lt; int &gt; &amp;nodes)</div><div class="ttdef"><b>Definition:</b> <a href="util_8h_source.html#l00295">util.h:295</a></div></div>
2021-01-26 11:28:50 +01:00
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
2020-01-31 17:22:59 +01:00
</div>
</div>
<div id="footer-container">
<div id="footer">
</div>
</div>
</body>
</html>