427 lines
58 KiB
HTML
427 lines
58 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.20"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: topologicalsorter.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">8.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.20 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @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&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">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('topologicalsorter_8cc_source.html',''); initResizable(); });
|
|
/* @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>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">topologicalsorter.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="topologicalsorter_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <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> <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> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <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> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <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> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <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> <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> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="topologicalsorter_8h.html">ortools/graph/topologicalsorter.h</a>"</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  </div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <map></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <queue></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>  </div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="map__util_8h.html">ortools/base/map_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="stl__util_8h.html">ortools/base/stl_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  </div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="keyword">namespace </span><a class="code" href="namespaceutil.html">util</a> {</div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"><a class="line" href="namespaceutil_1_1internal.html"> 26</a></span> <span class="keyword">namespace </span><a class="code" href="namespaceinternal.html">internal</a> {</div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  </div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">template</span> <<span class="keyword">typename</span> IntQueue></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> PopTop(IntQueue* q, <span class="keywordtype">int</span>* top) {</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  *top = q->front();</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  q->pop();</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> }</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  </div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="keyword">template</span> <<span class="keyword">typename</span> C, <span class="keyword">typename</span> F></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="keywordtype">void</span> PopTop(std::priority_queue<int, C, F>* q, <span class="keywordtype">int</span>* top) {</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  *top = q->top();</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  q->pop();</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> }</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  </div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> stable_sort></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a14bc33ad8ed703f5b023706f0e2aaacd"> 43</a></span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a14bc33ad8ed703f5b023706f0e2aaacd">DenseIntTopologicalSorterTpl<stable_sort>::AddNode</a>(<span class="keywordtype">int</span> node_index) {</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!TraversalStarted()) << <span class="stringliteral">"Cannot add nodes after starting traversal"</span>;</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  </div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordflow">if</span> (node_index >= adjacency_lists_.size()) {</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  adjacency_lists_.resize(node_index + 1);</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  }</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> }</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  </div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// Up to a point, we detect duplicates up front and do not insert them.</span></div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// Then we switch to using RemoveDuplicates(), see below.</span></div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// Note(user): I did benchmarks on this in November 2011, and while</span></div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// 32 seemed too large, I did not see very significant performance</span></div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// differences with 0, 4, 8 or 16. But since larger values of this</span></div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment">// threshold mean that there will be slightly less space used up by</span></div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// small adjacency lists in case there are repeated edges, I picked 16.</span></div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"><a class="line" href="namespaceutil_1_1internal.html#ad028288bd4526a697d575f43c3f2e47b"> 59</a></span> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="namespaceutil_1_1internal.html#ad028288bd4526a697d575f43c3f2e47b">kLazyDuplicateDetectionSizeThreshold</a> = 16;</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  </div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> stable_sort></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a0c4392b8dbb1d4677e6d1a1b52bb9898"> 62</a></span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a0c4392b8dbb1d4677e6d1a1b52bb9898">DenseIntTopologicalSorterTpl<stable_sort>::AddEdge</a>(<span class="keywordtype">int</span> from, <span class="keywordtype">int</span> to) {</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!TraversalStarted()) << <span class="stringliteral">"Cannot add edges after starting traversal"</span>;</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  </div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  AddNode(<a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(from, to));</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  </div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#aae2aec5b86307e8702d0a3fdd74f9be2">AdjacencyList</a>& adj_list = adjacency_lists_[from];</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a1134b580f8da4de94ca6b1de4d37975e">uint32</a> adj_list_size = adj_list.size();</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">if</span> (adj_list_size <= <a class="code" href="namespaceutil_1_1internal.html#ad028288bd4526a697d575f43c3f2e47b">kLazyDuplicateDetectionSizeThreshold</a>) {</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">for</span> (AdjacencyList::const_iterator it = adj_list.begin();</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  it != adj_list.end(); ++it) {</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">if</span> (*it == to) {</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  }</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  adj_list.push_back(to);</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  ++num_edges_;</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  adj_list.push_back(to);</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (++num_edges_added_since_last_duplicate_removal_ > ++num_edges_ / 2) {</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  num_edges_added_since_last_duplicate_removal_ = 0;</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// We remove all duplicates at once, but skip lists for which the</span></div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// number of duplicates can't be too large, i.e. lists smaller than</span></div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// kLazyDuplicateDetectionSizeThreshold * 2. The overall ratio of</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">// duplicate edges remains bounded by 2/3 in the worst case.</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  num_edges_ -= RemoveDuplicates(&adjacency_lists_,</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <a class="code" href="namespaceutil_1_1internal.html#ad028288bd4526a697d575f43c3f2e47b">kLazyDuplicateDetectionSizeThreshold</a> * 2);</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> }</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  </div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> stable_sort></div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a29b5249beab48f850aa3e2e87ffa1a75"> 93</a></span> <span class="keywordtype">bool</span> <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a29b5249beab48f850aa3e2e87ffa1a75">DenseIntTopologicalSorterTpl<stable_sort>::GetNext</a>(</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordtype">int</span>* next_node_index, <span class="keywordtype">bool</span>* cyclic, std::vector<int>* output_cycle_nodes) {</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">if</span> (!TraversalStarted()) {</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  StartTraversal();</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  </div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  *cyclic = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">if</span> (num_nodes_left_ == 0) {</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  }</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">if</span> (nodes_with_zero_indegree_.empty()) {</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Not all nodes have been visited ("</span> << num_nodes_left_</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  << <span class="stringliteral">" nodes left), but there aren't any zero-indegree nodes"</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  << <span class="stringliteral">" available. This graph is cyclic! Use ExtractCycle() for"</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  << <span class="stringliteral">" more information."</span>;</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  *cyclic = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">if</span> (output_cycle_nodes != NULL) {</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  ExtractCycle(output_cycle_nodes);</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  }</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  </div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// Pop one orphan node.</span></div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  --num_nodes_left_;</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  PopTop(&nodes_with_zero_indegree_, next_node_index);</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  </div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="comment">// Swap out the adjacency list, since we won't need it afterwards,</span></div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// to decrease memory usage.</span></div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#aae2aec5b86307e8702d0a3fdd74f9be2">AdjacencyList</a> adj_list;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  adj_list.swap(adjacency_lists_[*next_node_index]);</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  </div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="comment">// Add new orphan nodes to nodes_with_zero_indegree_.</span></div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < adj_list.size(); ++i) {</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">if</span> (--indegree_[adj_list[i]] == 0) {</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  nodes_with_zero_indegree_.push(adj_list[i]);</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  }</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  }</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> }</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  </div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> stable_sort></div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#ad71227cf309f882f99921233186790c6"> 134</a></span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#ad71227cf309f882f99921233186790c6">DenseIntTopologicalSorterTpl<stable_sort>::StartTraversal</a>() {</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">if</span> (TraversalStarted()) {</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  }</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  </div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = adjacency_lists_.size();</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  indegree_.assign(num_nodes, 0);</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  </div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="comment">// Iterate over all adjacency lists, and fill the indegree[] vector.</span></div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">// Note that we don't bother removing duplicates: there can't be</span></div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="comment">// too many, since we removed them progressively, and it is actually</span></div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="comment">// cheaper to keep them at this point.</span></div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> from = 0; from < num_nodes; ++from) {</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#aae2aec5b86307e8702d0a3fdd74f9be2">AdjacencyList</a>& adj_list = adjacency_lists_[from];</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">for</span> (AdjacencyList::const_iterator it = adj_list.begin();</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  it != adj_list.end(); ++it) {</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  ++indegree_[*it];</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  }</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  }</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  </div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// Initialize the nodes_with_zero_indegree_ vector.</span></div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < num_nodes; ++node) {</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">if</span> (indegree_[node] == 0) {</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  nodes_with_zero_indegree_.push(node);</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  }</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  }</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  </div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  num_nodes_left_ = num_nodes;</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  traversal_started_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> }</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  </div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment">// static</span></div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> stable_sort></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a86eb0e226467f5aa86a6212fe900a44f"> 167</a></span> <span class="keywordtype">int</span> <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a86eb0e226467f5aa86a6212fe900a44f">DenseIntTopologicalSorterTpl<stable_sort>::RemoveDuplicates</a>(</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  std::vector<AdjacencyList>* lists, <span class="keywordtype">int</span> skip_lists_smaller_than) {</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">// We can always skip lists with less than 2 elements.</span></div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">if</span> (skip_lists_smaller_than < 2) {</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a0c4392b8dbb1d4677e6d1a1b52bb9898"> 171</a></span>  skip_lists_smaller_than = 2;</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  }</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> n = lists->size();</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  std::vector<bool> visited(n, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordtype">int</span> num_duplicates_removed = 0;</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a29b5249beab48f850aa3e2e87ffa1a75"> 176</a></span>  <span class="keywordflow">for</span> (std::vector<AdjacencyList>::iterator list = lists->begin();</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  list != lists->end(); ++list) {</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">if</span> (list->size() < skip_lists_smaller_than) {</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  }</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  num_duplicates_removed += list->size();</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// To optimize the duplicate removal loop, we split it in two:</span></div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="comment">// first, find the first duplicate, then copy the rest of the shifted</span></div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#ad71227cf309f882f99921233186790c6"> 184</a></span>  <span class="comment">// adjacency list as we keep detecting duplicates.</span></div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  AdjacencyList::iterator it = list->begin();</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(it != list->end());</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">while</span> (!visited[*it]) {</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  visited[*(it++)] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">if</span> (it == list->end()) {</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  }</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  }</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a86eb0e226467f5aa86a6212fe900a44f"> 193</a></span>  <span class="comment">// Skip the shifted copy if there were no duplicates at all.</span></div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">if</span> (it != list->end()) {</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  AdjacencyList::iterator it2 = it;</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">while</span> (++it != list->end()) {</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a07aa254fe7a666f42819636a91cea372"> 197</a></span>  <span class="keywordflow">if</span> (!visited[*it]) {</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  visited[*it] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  *(it2++) = *it;</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  }</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  }</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  list->erase(it2, list->end());</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  }</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordflow">for</span> (it = list->begin(); it != list->end(); ++it) {</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  visited[*it] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  num_duplicates_removed -= list->size();</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  }</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">return</span> num_duplicates_removed;</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span> }</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  </div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="comment">// Note(user): as of 2012-09, this implementation works in</span></div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="comment">// O(number of edges + number of nodes), which is the theoretical best.</span></div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="comment">// It could probably be optimized to gain a significant constant speed-up;</span></div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="comment">// but at the cost of more code complexity.</span></div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> stable_sort></div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a07aa254fe7a666f42819636a91cea372"> 217</a></span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a07aa254fe7a666f42819636a91cea372">DenseIntTopologicalSorterTpl<stable_sort>::ExtractCycle</a>(</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  std::vector<int>* cycle_nodes)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = adjacency_lists_.size();</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  cycle_nodes->clear();</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="comment">// To find a cycle, we start a DFS from each yet-unvisited node and</span></div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">// try to find a cycle, if we don't find it then we know for sure that</span></div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="comment">// no cycle is reachable from any of the explored nodes (so, we don't</span></div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="comment">// explore them in later DFSs).</span></div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  std::vector<bool> no_cycle_reachable_from(num_nodes, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="comment">// The DFS stack will contain a chain of nodes, from the root of the</span></div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="comment">// DFS to the current leaf.</span></div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keyword">struct </span>DfsState {</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordtype">int</span> node;</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="comment">// Points at the first child node that we did *not* yet look at.</span></div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordtype">int</span> adj_list_index;</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keyword">explicit</span> DfsState(<span class="keywordtype">int</span> _node) : node(_node), adj_list_index(0) {}</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  };</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  std::vector<DfsState> dfs_stack;</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  std::vector<bool> in_cur_stack(num_nodes, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> start_node = 0; start_node < num_nodes; ++start_node) {</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">if</span> (no_cycle_reachable_from[start_node]) {</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// Start the DFS.</span></div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  dfs_stack.push_back(DfsState(start_node));</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  in_cur_stack[start_node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keywordflow">while</span> (!dfs_stack.empty()) {</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  DfsState* cur_state = &dfs_stack.back();</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">if</span> (cur_state->adj_list_index >=</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  adjacency_lists_[cur_state->node].size()) {</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  no_cycle_reachable_from[cur_state->node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  in_cur_stack[cur_state->node] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  dfs_stack.pop_back();</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  }</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="comment">// Look at the current child, and increase the current state's</span></div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="comment">// adj_list_index.</span></div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> child =</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  adjacency_lists_[cur_state->node][cur_state->adj_list_index];</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  ++(cur_state->adj_list_index);</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">if</span> (no_cycle_reachable_from[child]) {</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  }</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">if</span> (in_cur_stack[child]) {</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="comment">// We detected a cycle! Fill it and return.</span></div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">for</span> (;;) {</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  cycle_nodes->push_back(dfs_stack.back().node);</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">if</span> (dfs_stack.back().node == child) {</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  std::reverse(cycle_nodes->begin(), cycle_nodes->end());</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  }</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  dfs_stack.pop_back();</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  }</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  }</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="comment">// Push the child onto the stack.</span></div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  dfs_stack.push_back(DfsState(child));</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  in_cur_stack[child] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  }</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  }</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// If we're here, then all the DFS stopped, and they never encountered</span></div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">// a cycle (otherwise, we would have returned). Just exit; the output</span></div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">// vector has been cleared already.</span></div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span> }</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  </div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="comment">// Generate the templated code. Including these definitions allows us</span></div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span> <span class="comment">// to have templated code inside the .cc file and not incur linker errors.</span></div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span> <span class="keyword">template</span> <span class="keyword">class </span><a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html">DenseIntTopologicalSorterTpl<false></a>;</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="keyword">template</span> <span class="keyword">class </span><a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html">DenseIntTopologicalSorterTpl<true></a>;</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  </div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span> } <span class="comment">// namespace internal</span></div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  </div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"><a class="line" href="namespaceutil.html#aa435ca6f81746d48541552b46f2e3440"> 288</a></span> std::vector<int> <a class="code" href="namespaceutil.html#aa435ca6f81746d48541552b46f2e3440">FindCycleInDenseIntGraph</a>(</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordtype">int</span> num_nodes, <span class="keyword">const</span> std::vector<std::pair<int, int>>& arcs) {</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  std::vector<int> cycle;</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keywordflow">if</span> (num_nodes < 1) {</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordflow">return</span> cycle;</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  }</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html">internal::DenseIntTopologicalSorterTpl</a><<span class="comment">/* stable= */</span> <span class="keyword">false</span>> sorter(num_nodes);</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& arc : arcs) {</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  sorter.<a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a0c4392b8dbb1d4677e6d1a1b52bb9898">AddEdge</a>(arc.first, arc.second);</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  }</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  sorter.<a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a07aa254fe7a666f42819636a91cea372">ExtractCycle</a>(&cycle);</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">return</span> cycle;</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span> }</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span> } <span class="comment">// namespace util</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div class="ttc" id="amap__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00978">base/logging.h:978</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a9d0c202d5fdd62f4fa2c613339ff168a"><div class="ttname"><a href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">max</a></div><div class="ttdeci">int64 max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1internal_1_1_dense_int_topological_sorter_tpl_html_a86eb0e226467f5aa86a6212fe900a44f"><div class="ttname"><a href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a86eb0e226467f5aa86a6212fe900a44f">util::internal::DenseIntTopologicalSorterTpl::RemoveDuplicates</a></div><div class="ttdeci">static int RemoveDuplicates(std::vector< AdjacencyList > *lists, int skip_lists_smaller_than)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8cc_source.html#l00167">topologicalsorter.cc:167</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1internal_1_1_dense_int_topological_sorter_tpl_html_a14bc33ad8ed703f5b023706f0e2aaacd"><div class="ttname"><a href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a14bc33ad8ed703f5b023706f0e2aaacd">util::internal::DenseIntTopologicalSorterTpl::AddNode</a></div><div class="ttdeci">void AddNode(int node_index)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8cc_source.html#l00043">topologicalsorter.cc:43</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1internal_1_1_dense_int_topological_sorter_tpl_html_a29b5249beab48f850aa3e2e87ffa1a75"><div class="ttname"><a href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a29b5249beab48f850aa3e2e87ffa1a75">util::internal::DenseIntTopologicalSorterTpl::GetNext</a></div><div class="ttdeci">bool GetNext(int *next_node_index, bool *cyclic, std::vector< int > *output_cycle_nodes=NULL)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8cc_source.html#l00093">topologicalsorter.cc:93</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1internal_1_1_dense_int_topological_sorter_tpl_html_aae2aec5b86307e8702d0a3fdd74f9be2"><div class="ttname"><a href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#aae2aec5b86307e8702d0a3fdd74f9be2">util::internal::DenseIntTopologicalSorterTpl::AdjacencyList</a></div><div class="ttdeci">std::vector< int > AdjacencyList</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00144">topologicalsorter.h:144</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1internal_1_1_dense_int_topological_sorter_tpl_html_a07aa254fe7a666f42819636a91cea372"><div class="ttname"><a href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a07aa254fe7a666f42819636a91cea372">util::internal::DenseIntTopologicalSorterTpl::ExtractCycle</a></div><div class="ttdeci">void ExtractCycle(std::vector< int > *cycle_nodes) const</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8cc_source.html#l00217">topologicalsorter.cc:217</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1internal_1_1_dense_int_topological_sorter_tpl_html"><div class="ttname"><a href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html">util::internal::DenseIntTopologicalSorterTpl< false ></a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a1134b580f8da4de94ca6b1de4d37975e"><div class="ttname"><a href="integral__types_8h.html#a1134b580f8da4de94ca6b1de4d37975e">uint32</a></div><div class="ttdeci">unsigned int uint32</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00038">integral_types.h:38</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00884">base/logging.h:884</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1internal_1_1_dense_int_topological_sorter_tpl_html_ad71227cf309f882f99921233186790c6"><div class="ttname"><a href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#ad71227cf309f882f99921233186790c6">util::internal::DenseIntTopologicalSorterTpl::StartTraversal</a></div><div class="ttdeci">void StartTraversal()</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8cc_source.html#l00134">topologicalsorter.cc:134</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1internal_1_1_dense_int_topological_sorter_tpl_html_a0c4392b8dbb1d4677e6d1a1b52bb9898"><div class="ttname"><a href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a0c4392b8dbb1d4677e6d1a1b52bb9898">util::internal::DenseIntTopologicalSorterTpl::AddEdge</a></div><div class="ttdeci">void AddEdge(int from, int to)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8cc_source.html#l00062">topologicalsorter.cc:62</a></div></div>
|
|
<div class="ttc" id="astl__util_8h_html"><div class="ttname"><a href="stl__util_8h.html">stl_util.h</a></div></div>
|
|
<div class="ttc" id="atopologicalsorter_8h_html"><div class="ttname"><a href="topologicalsorter_8h.html">topologicalsorter.h</a></div></div>
|
|
<div class="ttc" id="anamespaceinternal_html"><div class="ttname"><a href="namespaceinternal.html">internal</a></div><div class="ttdef"><b>Definition:</b> <a href="bop__parameters_8pb_8h_source.html#l00040">bop_parameters.pb.h:40</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_html"><div class="ttname"><a href="namespaceutil.html">util</a></div><div class="ttdef"><b>Definition:</b> <a href="status__builder_8h_source.html#l00021">status_builder.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_1_1internal_html_ad028288bd4526a697d575f43c3f2e47b"><div class="ttname"><a href="namespaceutil_1_1internal.html#ad028288bd4526a697d575f43c3f2e47b">util::internal::kLazyDuplicateDetectionSizeThreshold</a></div><div class="ttdeci">static const int kLazyDuplicateDetectionSizeThreshold</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8cc_source.html#l00059">topologicalsorter.cc:59</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_html_aa435ca6f81746d48541552b46f2e3440"><div class="ttname"><a href="namespaceutil.html#aa435ca6f81746d48541552b46f2e3440">util::FindCycleInDenseIntGraph</a></div><div class="ttdeci">std::vector< int > FindCycleInDenseIntGraph(int num_nodes, const std::vector< std::pair< int, int >> &arcs)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8cc_source.html#l00288">topologicalsorter.cc:288</a></div></div>
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_725f3a5915051842f84e3ea508be2a62.html">graph</a></li><li class="navelem"><a class="el" href="topologicalsorter_8cc.html">topologicalsorter.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.20 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|