700 lines
121 KiB
HTML
700 lines
121 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.h 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_8h_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.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="topologicalsorter_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> <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="comment">// TopologicalSorter provides topologically sorted traversal of the</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// nodes of a directed acyclic graph (DAG) with up to INT_MAX nodes.</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// It sorts ancestor nodes before their descendants.</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// If your graph is not a DAG and you're reading this, you are probably</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">// looking for ortools/graph/strongly_connected_components.h which does</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// the topological decomposition of a directed graph.</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// EXAMPLE:</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">// vector<int> result;</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// vector<string> nodes = {"a", "b", "c"};</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">// vector<pair<string, string>> arcs = {{"a", "c"}, {"a", "b"}, {"b", "c"}};</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// if (util::StableTopologicalSort(num_nodes, arcs, &result)) {</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// LOG(INFO) << "The topological order is: " << gtl::LogContainer(result);</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// } else {</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// LOG(INFO) << "The graph is cyclic.";</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// // Note: you can extract a cycle with the TopologicalSorter class, or</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// // with the API defined in circularity_detector.h.</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// }</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// // This will be successful and result will be equal to {"a", "b", "c"}.</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// There are 8 flavors of topological sort, from these 3 bits:</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// - There are OrDie() versions that directly return the topological order, or</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// crash if a cycle is detected (and LOG the cycle).</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// - There are type-generic versions that can take any node type (including</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// non-dense integers), but slower, or the "dense int" versions which requires</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// nodes to be a dense interval [0..num_nodes-1]. Note that the type must</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// be compatible with LOG << T if you're using the OrDie() version.</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// - The sorting can be either stable or not. "Stable" essentially means that it</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// will preserve the order of nodes, if possible. More precisely, the returned</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// topological order will be the lexicographically minimal valid order, where</span></div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// "lexicographic" applies to the indices of the nodes.</span></div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// TopologicalSort()</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// TopologicalSortOrDie()</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// StableTopologicalSort()</span></div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// StableTopologicalSortOrDie()</span></div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// DenseIntTopologicalSort()</span></div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// DenseIntTopologicalSortOrDie()</span></div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// DenseIntStableTopologicalSort()</span></div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// DenseIntStableTopologicalSortOrDie()</span></div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment">// If you need more control, or a step-by-step topological sort, see the</span></div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// TopologicalSorter classes below.</span></div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  </div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#ifndef UTIL_GRAPH_TOPOLOGICALSORTER_H__</span></div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#define UTIL_GRAPH_TOPOLOGICALSORTER_H__</span></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  </div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#include <queue></span></div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor">#include <type_traits></span></div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor">#include <vector></span></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> <span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="preprocessor">#include "<a class="code" href="container__logging_8h.html">ortools/base/container_logging.h</a>"</span></div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</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="l00072"></a><span class="lineno"> 72</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="l00073"></a><span class="lineno"> 73</span>  </div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="keyword">namespace </span><a class="code" href="namespaceutil.html">util</a> {</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> <span class="comment">// Returns true if the graph was a DAG, and outputs the topological order in</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// "topological_order". Returns false if the graph is cyclic.</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// Works in O(num_nodes + arcs.size()), and is pretty fast.</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="keyword">inline</span> ABSL_MUST_USE_RESULT <span class="keywordtype">bool</span> <a class="code" href="namespaceutil.html#ab334681e638994051039e44e8789d3f5">DenseIntTopologicalSort</a>(</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</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="l00081"></a><span class="lineno"> 81</span>  std::vector<int>* topological_order);</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  </div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment">// Like DenseIntTopologicalSort, but stable.</span></div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="keyword">inline</span> ABSL_MUST_USE_RESULT <span class="keywordtype">bool</span> <a class="code" href="namespaceutil.html#a551780458cf6bf0170ab36e9eb7d88eb">DenseIntStableTopologicalSort</a>(</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</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="l00086"></a><span class="lineno"> 86</span>  std::vector<int>* topological_order);</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  </div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment">// Finds a cycle in the directed graph given as argument: nodes are dense</span></div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment">// integers in 0..num_nodes-1, and (directed) arcs are pairs of nodes</span></div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// {from, to}.</span></div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment">// The returned cycle is a list of nodes that form a cycle, eg. {1, 4, 3}</span></div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment">// if the cycle 1->4->3->1 exists.</span></div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// If the graph is acyclic, returns an empty vector.</span></div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> ABSL_MUST_USE_RESULT std::vector<int> <a class="code" href="namespaceutil.html#aa435ca6f81746d48541552b46f2e3440">FindCycleInDenseIntGraph</a>(</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</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="l00096"></a><span class="lineno"> 96</span>  </div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// Like the two above, but with generic node types. The nodes must be provided.</span></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment">// Can be significantly slower, but still linear.</span></div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> ABSL_MUST_USE_RESULT <span class="keywordtype">bool</span> <a class="code" href="namespaceutil.html#af41e869886ca4b1bacaeb24fa76343f0">TopologicalSort</a>(</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">const</span> std::vector<T>& nodes, <span class="keyword">const</span> std::vector<std::pair<T, T>>& arcs,</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  std::vector<T>* topological_order);</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> ABSL_MUST_USE_RESULT <span class="keywordtype">bool</span> <a class="code" href="namespaceutil.html#ad150c7b6ee948e66c2abeadb4ce2d3e4">StableTopologicalSort</a>(</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keyword">const</span> std::vector<T>& nodes, <span class="keyword">const</span> std::vector<std::pair<T, T>>& arcs,</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  std::vector<T>* topological_order);</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  </div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// "OrDie()" versions of the 4 functions above. Those directly return the</span></div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// topological order, which makes their API even simpler.</span></div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="keyword">inline</span> std::vector<int> <a class="code" href="namespaceutil.html#af5ba39bfb98a77b28ace8a45cfb9e855">DenseIntTopologicalSortOrDie</a>(</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</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="l00112"></a><span class="lineno"> 112</span> <span class="keyword">inline</span> std::vector<int> <a class="code" href="namespaceutil.html#ab5d7c8313ca0fd87a7d5445081e97b0c">DenseIntStableTopologicalSortOrDie</a>(</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</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="l00114"></a><span class="lineno"> 114</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> std::vector<T> <a class="code" href="namespaceutil.html#aeb4b373ef569ec99917c4566aac1b741">TopologicalSortOrDie</a>(<span class="keyword">const</span> std::vector<T>& nodes,</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">const</span> std::vector<std::pair<T, T>>& arcs);</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> std::vector<T> <a class="code" href="namespaceutil.html#af7583b83e073657b301db60692ad0390">StableTopologicalSortOrDie</a>(</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">const</span> std::vector<T>& nodes, <span class="keyword">const</span> std::vector<std::pair<T, T>>& arcs);</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  </div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="keyword">namespace </span><a class="code" href="namespaceinternal.html">internal</a> {</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// Internal wrapper around the *TopologicalSort classes.</span></div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> Sorter></div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"><a class="line" href="namespaceutil_1_1internal.html#a2469f1533fa009758f1d3c4b5a7dda31"> 124</a></span> ABSL_MUST_USE_RESULT <span class="keywordtype">bool</span> <a class="code" href="namespaceutil_1_1internal.html#a2469f1533fa009758f1d3c4b5a7dda31">RunTopologicalSorter</a>(</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  Sorter* sorter, <span class="keyword">const</span> std::vector<std::pair<T, T>>& arcs,</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  std::vector<T>* topological_order_or_cycle);</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  </div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment">// Do not use the templated class directly, instead use one of the</span></div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// typedefs DenseIntTopologicalSorter or DenseIntStableTopologicalSorter.</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment">// The equivalent of a TopologicalSorter<int> which nodes are the</span></div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment">// N integers from 0 to N-1 (see the toplevel comment). The API is</span></div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment">// exactly similar to that of TopologicalSorter, please refer to the</span></div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// TopologicalSorter class below for more detailed comments.</span></div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment">// If the template parameter is true then the sort will be stable.</span></div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment">// This means that the order of the nodes will be maintained as much as</span></div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment">// possible. A non-stable sort is more efficient, since the complexity</span></div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// of getting the next node is O(1) rather than O(log(Nodes)).</span></div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> stable_sort = false></div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html"> 141</a></span> <span class="keyword">class </span><a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html">DenseIntTopologicalSorterTpl</a> {</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">// To store the adjacency lists efficiently.</span></div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#aae2aec5b86307e8702d0a3fdd74f9be2"> 144</a></span>  <span class="keyword">typedef</span> std::vector<int> <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#aae2aec5b86307e8702d0a3fdd74f9be2">AdjacencyList</a>;</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  </div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">// For efficiency, it is best to specify how many nodes are required</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// by using the next constructor.</span></div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a8feb90266ba02e6f92df32ac619589de"> 148</a></span>  <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a8feb90266ba02e6f92df32ac619589de">DenseIntTopologicalSorterTpl</a>()</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  : traversal_started_(false),</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  num_edges_(0),</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  num_edges_added_since_last_duplicate_removal_(0) {}</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>  <span class="comment">// One may also construct a DenseIntTopologicalSorterTpl with a predefined</span></div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// number of empty nodes. One can thus bypass the AddNode() API,</span></div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// which may yield a lower memory usage.</span></div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a22fc21e3de5c05e9a2540c2a9beeded4"> 156</a></span>  <span class="keyword">explicit</span> <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a22fc21e3de5c05e9a2540c2a9beeded4">DenseIntTopologicalSorterTpl</a>(<span class="keywordtype">int</span> num_nodes)</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  : adjacency_lists_(num_nodes),</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  traversal_started_(false),</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  num_edges_(0),</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  num_edges_added_since_last_duplicate_removal_(0) {}</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  </div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">// Performs in constant amortized time. Calling this will make all</span></div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="comment">// node indices in [0 .. node_index] be valid node indices. If you</span></div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="comment">// can avoid using AddNode(), you should! If you know the number of</span></div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="comment">// nodes in advance, you should specify that at construction time --</span></div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// it will be faster and use less memory.</span></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a14bc33ad8ed703f5b023706f0e2aaacd">AddNode</a>(<span class="keywordtype">int</span> node_index);</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  </div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">// Performs in constant amortized time. Calling this will make all</span></div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// node indices in [0, max(from, to)] be valid node indices.</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a0c4392b8dbb1d4677e6d1a1b52bb9898">AddEdge</a>(<span class="keywordtype">int</span> from, <span class="keywordtype">int</span> to);</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="comment">// Performs in O(average degree) in average. If a cycle is detected</span></div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="comment">// and "output_cycle_nodes" isn't NULL, it will require an additional</span></div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="comment">// O(number of edges + number of nodes in the graph) time.</span></div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordtype">bool</span> <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a29b5249beab48f850aa3e2e87ffa1a75">GetNext</a>(<span class="keywordtype">int</span>* next_node_index, <span class="keywordtype">bool</span>* cyclic,</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  std::vector<int>* output_cycle_nodes = NULL);</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  </div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#aa2b85b48ee1ab7b2e6da0ac2e8a91711"> 179</a></span>  <span class="keywordtype">int</span> <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#aa2b85b48ee1ab7b2e6da0ac2e8a91711">GetCurrentFringeSize</a>() {</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#ad71227cf309f882f99921233186790c6">StartTraversal</a>();</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">return</span> nodes_with_zero_indegree_.size();</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  }</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  </div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#ad71227cf309f882f99921233186790c6">StartTraversal</a>();</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  </div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"><a class="line" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#ad4cbfde0e58af51646856c0dcbc28640"> 186</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#ad4cbfde0e58af51646856c0dcbc28640">TraversalStarted</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> traversal_started_; }</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  </div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// Given a vector<AdjacencyList> of size n such that elements of the</span></div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">// AdjacencyList are in [0, n-1], remove the duplicates within each</span></div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// AdjacencyList of size greater or equal to skip_lists_smaller_than,</span></div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// in linear time. Returns the total number of duplicates removed.</span></div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">// This method is exposed for unit testing purposes only.</span></div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a86eb0e226467f5aa86a6212fe900a44f">RemoveDuplicates</a>(std::vector<AdjacencyList>* lists,</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordtype">int</span> skip_lists_smaller_than);</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  </div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="comment">// To extract a cycle. When there is no cycle, cycle_nodes will be empty.</span></div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a07aa254fe7a666f42819636a91cea372">ExtractCycle</a>(std::vector<int>* cycle_nodes) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  </div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="comment">// Outgoing adjacency lists.</span></div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  std::vector<AdjacencyList> adjacency_lists_;</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  </div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordtype">bool</span> traversal_started_;</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  </div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="comment">// Only valid after a traversal started.</span></div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordtype">int</span> num_nodes_left_;</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keyword">typename</span> std::conditional<</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  stable_sort,</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="comment">// We use greater<int> so that the lowest elements gets popped first.</span></div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  std::priority_queue<int, std::vector<int>, std::greater<int>>,</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  std::queue<int>>::type nodes_with_zero_indegree_;</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  std::vector<int> indegree_;</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  </div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="comment">// Used internally by AddEdge() to decide whether to trigger</span></div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="comment">// RemoveDuplicates(). See the .cc.</span></div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordtype">int</span> num_edges_; <span class="comment">// current total number of edges.</span></div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordtype">int</span> num_edges_added_since_last_duplicate_removal_;</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  </div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html">DenseIntTopologicalSorterTpl</a>);</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span> };</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  </div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="keyword">extern</span> <span class="keyword">template</span> <span class="keyword">class </span>DenseIntTopologicalSorterTpl<false>;</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="keyword">extern</span> <span class="keyword">template</span> <span class="keyword">class </span>DenseIntTopologicalSorterTpl<true>;</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  </div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span> } <span class="comment">// namespace internal</span></div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  </div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment">// Recommended version for general usage. The stability makes it more</span></div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="comment">// deterministic, and its behavior is guaranteed to never change.</span></div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span> typedef ::util::internal::DenseIntTopologicalSorterTpl<</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="comment">/*stable_sort=*/</span><span class="keyword">true</span>></div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"><a class="line" href="namespaceutil.html#a74fc6e241bfc96048a5612a62fa34d11"> 232</a></span>  <a class="code" href="namespaceutil.html#a74fc6e241bfc96048a5612a62fa34d11">DenseIntStableTopologicalSorter</a>;</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> <span class="comment">// Use this version if you are certain you don't care about the</span></div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="comment">// tie-breaking order and need the 5 to 10% performance gain. The</span></div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="comment">// performance gain can be more significant for large graphs with large</span></div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="comment">// numbers of source nodes (for example 2 Million nodes with 2 Million</span></div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="comment">// random edges sees a factor of 0.7 difference in completion time).</span></div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span> typedef ::util::internal::DenseIntTopologicalSorterTpl<</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">/*stable_sort=*/</span><span class="keyword">false</span>></div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"><a class="line" href="namespaceutil.html#af1e0eacbfb0b5de3f7453de0f9a48201"> 241</a></span>  <a class="code" href="namespaceutil.html#af1e0eacbfb0b5de3f7453de0f9a48201">DenseIntTopologicalSorter</a>;</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  </div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="comment">// A copy of each Node is stored internally. Duplicated edges are allowed,</span></div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="comment">// and discarded lazily so that AddEdge() keeps an amortized constant</span></div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="comment">// time, yet the total memory usage remains O(number of different edges +</span></div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="comment">// number of nodes).</span></div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span> <span class="comment">// DenseIntTopologicalSorter implements the core topological sort</span></div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="comment">// algorithm. For greater efficiency it can be used directly</span></div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="comment">// (TopologicalSorter<int> is about 1.5-3x slower).</span></div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="comment">// TopologicalSorter requires that all nodes and edges be added before</span></div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="comment">// traversing the nodes, otherwise it will die with a fatal error.</span></div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment">// Note(user): since all the real work is done by</span></div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="comment">// DenseIntTopologicalSorterTpl, and this class is a template, we inline</span></div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="comment">// every function here in the .h.</span></div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment">// If stable_sort is true then the topological sort will preserve the</span></div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment">// original order of the nodes as much as possible. Note, the order</span></div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment">// which is preserved is the order in which the nodes are added (if you</span></div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="comment">// use AddEdge it will add the first argument and then the second).</span></div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keywordtype">bool</span> stable_sort = <span class="keyword">false</span>,</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keyword">typename</span> <a class="code" href="namespaceutil__hash.html#aa2ba7114404f5416e797636b0e1eddcd">Hash</a> = <span class="keyword">typename</span> absl::flat_hash_map<T, int>::hasher,</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keyword">typename</span> KeyEqual =</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keyword">typename</span> absl::flat_hash_map<T, int, Hash>::key_equal></div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"><a class="line" href="classutil_1_1_topological_sorter.html"> 268</a></span> <span class="keyword">class </span><a class="code" href="classutil_1_1_topological_sorter.html">TopologicalSorter</a> {</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"><a class="line" href="classutil_1_1_topological_sorter.html#ad6b4163ff61978eb0e66658ded3b5744"> 270</a></span>  <a class="code" href="classutil_1_1_topological_sorter.html#ad6b4163ff61978eb0e66658ded3b5744">TopologicalSorter</a>() {}</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"><a class="line" href="classutil_1_1_topological_sorter.html#a896eb8719e4aa05badde9c9f6b94264f"> 271</a></span>  <a class="code" href="classutil_1_1_topological_sorter.html#a896eb8719e4aa05badde9c9f6b94264f">~TopologicalSorter</a>() {}</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  </div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="comment">// Adds a node to the graph, if it has not already been added via</span></div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="comment">// previous calls to AddNode()/AddEdge(). If no edges are later</span></div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">// added connecting this node, then it remains an isolated node in</span></div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// the graph. AddNode() only exists to support isolated nodes. There</span></div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">// is no requirement (nor is it an error) to call AddNode() for the</span></div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">// endpoints used in a call to AddEdge(). Dies with a fatal error if</span></div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="comment">// called after a traversal has been started (see TraversalStarted()),</span></div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="comment">// or if more than INT_MAX nodes are being added.</span></div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"><a class="line" href="classutil_1_1_topological_sorter.html#adf35867ff0932290f5456b27d1ed6bff"> 281</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1_topological_sorter.html#adf35867ff0932290f5456b27d1ed6bff">AddNode</a>(<span class="keyword">const</span> T& node) { int_sorter_.AddNode(LookupOrInsertNode(node)); }</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  </div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="comment">// Adds a directed edge with the given endpoints to the graph. There</span></div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="comment">// is no requirement (nor is it an error) to call AddNode() for the</span></div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="comment">// endpoints. Dies with a fatal error if called after a traversal</span></div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="comment">// has been started (see TraversalStarted()).</span></div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"><a class="line" href="classutil_1_1_topological_sorter.html#a038de061979331bea01ffa96da55fac2"> 287</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1_topological_sorter.html#a038de061979331bea01ffa96da55fac2">AddEdge</a>(<span class="keyword">const</span> T& from, <span class="keyword">const</span> T& to) {</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="comment">// The lookups are not inlined into AddEdge because we need to ensure that</span></div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="comment">// "from" is inserted before "to".</span></div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> from_int = LookupOrInsertNode(from);</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> to_int = LookupOrInsertNode(to);</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  int_sorter_.AddEdge(from_int, to_int);</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>  </div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="comment">// Visits the least node in topological order over the current set of</span></div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="comment">// nodes and edges, and marks that node as visited, so that repeated</span></div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">// calls to GetNext() will visit all nodes in order. Writes the newly</span></div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">// visited node in *node and returns true with *cyclic set to false</span></div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">// (assuming the graph has not yet been discovered to be cyclic).</span></div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="comment">// Returns false if all nodes have been visited, or if the graph is</span></div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="comment">// discovered to be cyclic, in which case *cyclic is also set to true.</span></div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="comment">// If you set the optional argument "output_cycle_nodes" to non-NULL and</span></div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="comment">// a cycle is detected, it will dump an arbitrary cycle of the graph</span></div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="comment">// (whose length will be between 1 and #number_of_nodes, inclusive),</span></div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="comment">// in the natural order: for example if "output_cycle_nodes" is filled</span></div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="comment">// with ["A", "C", "B"], it means that A->C->B->A is a directed cycle</span></div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="comment">// of the graph.</span></div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">// This starts a traversal (if not started already). Note that the</span></div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="comment">// graph can only be traversed once.</span></div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"><a class="line" href="classutil_1_1_topological_sorter.html#a0f4f0594b7fb10285a7235db079abd46"> 312</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classutil_1_1_topological_sorter.html#a0f4f0594b7fb10285a7235db079abd46">GetNext</a>(T* node, <span class="keywordtype">bool</span>* cyclic_ptr,</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  std::vector<T>* output_cycle_nodes = NULL) {</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <a class="code" href="classutil_1_1_topological_sorter.html#ad71227cf309f882f99921233186790c6">StartTraversal</a>();</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keywordtype">int</span> node_index;</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">if</span> (!int_sorter_.GetNext(&node_index, cyclic_ptr,</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  output_cycle_nodes ? &cycle_int_nodes_ : NULL)) {</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordflow">if</span> (*cyclic_ptr && output_cycle_nodes != NULL) {</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  output_cycle_nodes->clear();</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> int_node : cycle_int_nodes_) {</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  output_cycle_nodes->push_back(nodes_[int_node]);</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  }</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  }</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  }</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  *node = nodes_[node_index];</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  }</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  </div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">// Returns the number of nodes that currently have zero indegree.</span></div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="comment">// This starts a traversal (if not started already).</span></div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"><a class="line" href="classutil_1_1_topological_sorter.html#aa2b85b48ee1ab7b2e6da0ac2e8a91711"> 332</a></span>  <span class="keywordtype">int</span> <a class="code" href="classutil_1_1_topological_sorter.html#aa2b85b48ee1ab7b2e6da0ac2e8a91711">GetCurrentFringeSize</a>() {</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <a class="code" href="classutil_1_1_topological_sorter.html#ad71227cf309f882f99921233186790c6">StartTraversal</a>();</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keywordflow">return</span> int_sorter_.GetCurrentFringeSize();</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  }</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  </div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="comment">// Start a traversal. See TraversalStarted(). This initializes the</span></div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="comment">// various data structures of the sorter. Since this takes O(num_nodes</span></div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="comment">// + num_edges) time, users may want to call this at their convenience,</span></div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="comment">// instead of making it happen with the first GetNext().</span></div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"><a class="line" href="classutil_1_1_topological_sorter.html#ad71227cf309f882f99921233186790c6"> 341</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1_topological_sorter.html#ad71227cf309f882f99921233186790c6">StartTraversal</a>() {</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">if</span> (<a class="code" href="classutil_1_1_topological_sorter.html#ad4cbfde0e58af51646856c0dcbc28640">TraversalStarted</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  nodes_.resize(node_to_index_.size());</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="comment">// We move elements from the absl::flat_hash_map to this vector, without</span></div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="comment">// extra copy (if they are movable).</span></div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span>& node_and_index : node_to_index_) {</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  nodes_[node_and_index.second] = std::move(node_and_index.first);</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  }</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <a class="code" href="namespacegtl.html#a8b11464d5e8c5f0bb36a15d53abb8cc7">gtl::STLClearHashIfBig</a>(&node_to_index_, 1 << 16);</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  int_sorter_.StartTraversal();</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  }</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  </div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="comment">// Whether a traversal has started. If true, AddNode() and AddEdge()</span></div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="comment">// can no longer be called.</span></div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"><a class="line" href="classutil_1_1_topological_sorter.html#ad4cbfde0e58af51646856c0dcbc28640"> 355</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classutil_1_1_topological_sorter.html#ad4cbfde0e58af51646856c0dcbc28640">TraversalStarted</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> int_sorter_.TraversalStarted(); }</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  </div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="comment">// A simple mapping from node to their dense index, in 0..num_nodes-1,</span></div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="comment">// which will be their index in nodes_[]. Cleared when a traversal</span></div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="comment">// starts, and replaced by nodes_[].</span></div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  absl::flat_hash_map<T, int, Hash, KeyEqual> node_to_index_;</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  </div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="comment">// Stores all the nodes as soon as a traversal starts.</span></div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  std::vector<T> nodes_;</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  </div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="comment">// An internal DenseIntTopologicalSorterTpl that does all the real work.</span></div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html">::util::internal::DenseIntTopologicalSorterTpl<stable_sort></a> int_sorter_;</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  </div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="comment">// Used internally to extract cycles from the underlying</span></div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="comment">// DenseIntTopologicalSorterTpl.</span></div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  std::vector<int> cycle_int_nodes_;</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  </div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="comment">// Lookup an existing node's index, or add the node and return the</span></div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="comment">// new index that was assigned to it.</span></div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordtype">int</span> LookupOrInsertNode(<span class="keyword">const</span> T& node) {</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">return</span> <a class="code" href="namespacegtl.html#a7a0f8dc4187504b814d8a8be463b517c">gtl::LookupOrInsert</a>(&node_to_index_, node, node_to_index_.size());</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  }</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  </div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="class_topological_sorter.html">TopologicalSorter</a>);</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span> };</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  </div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span> <span class="keyword">namespace </span><a class="code" href="namespaceinternal.html">internal</a> {</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="comment">// If successful, returns true and outputs the order in "topological_order".</span></div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span> <span class="comment">// If not, returns false and outputs a cycle in "cycle" (if not null).</span></div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> Sorter></div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"><a class="line" href="namespaceutil_1_1internal.html#ab0aaa24215c6840593d68357753e47c5"> 386</a></span> ABSL_MUST_USE_RESULT <span class="keywordtype">bool</span> <a class="code" href="namespaceutil_1_1internal.html#a2469f1533fa009758f1d3c4b5a7dda31">RunTopologicalSorter</a>(</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  Sorter* sorter, <span class="keyword">const</span> std::vector<std::pair<T, T>>& arcs,</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  std::vector<T>* topological_order, std::vector<T>* cycle) {</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  topological_order->clear();</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& arc : arcs) {</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  sorter->AddEdge(arc.first, arc.second);</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  }</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordtype">bool</span> cyclic = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  sorter->StartTraversal();</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  T <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keywordflow">while</span> (sorter->GetNext(&<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, &cyclic, cycle)) {</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  topological_order->push_back(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  }</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordflow">return</span> !cyclic;</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span> }</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  </div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> stable_sort = false></div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"><a class="line" href="namespaceutil_1_1internal.html#ac53a0ceebb758d339062a2e1aad03a59"> 403</a></span> ABSL_MUST_USE_RESULT <span class="keywordtype">bool</span> <a class="code" href="namespaceutil_1_1internal.html#ac53a0ceebb758d339062a2e1aad03a59">DenseIntTopologicalSortImpl</a>(</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</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="l00405"></a><span class="lineno"> 405</span>  std::vector<int>* topological_order) {</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html">DenseIntTopologicalSorterTpl<stable_sort></a> sorter(num_nodes);</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">return</span> RunTopologicalSorter<int, decltype(sorter)>(</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  &sorter, arcs, topological_order, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span> }</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  </div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keywordtype">bool</span> stable_sort = false></div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"><a class="line" href="namespaceutil_1_1internal.html#a428fd18bbf6ca438e45ed1ab423ba22b"> 412</a></span> ABSL_MUST_USE_RESULT <span class="keywordtype">bool</span> <a class="code" href="namespaceutil_1_1internal.html#a428fd18bbf6ca438e45ed1ab423ba22b">TopologicalSortImpl</a>(</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keyword">const</span> std::vector<T>& nodes, <span class="keyword">const</span> std::vector<std::pair<T, T>>& arcs,</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  std::vector<T>* topological_order) {</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <a class="code" href="classutil_1_1_topological_sorter.html">TopologicalSorter<T, stable_sort></a> sorter;</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> T& node : nodes) {</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  sorter.<a class="code" href="classutil_1_1_topological_sorter.html#adf35867ff0932290f5456b27d1ed6bff">AddNode</a>(node);</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  }</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordflow">return</span> RunTopologicalSorter<T, decltype(sorter)>(&sorter, arcs,</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  topological_order, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span> }</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  </div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="comment">// Now, the OrDie() versions, which directly return the topological order.</span></div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> Sorter></div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"><a class="line" href="namespaceutil_1_1internal.html#aefe117335b59796829ef22c7dd2099c9"> 425</a></span> std::vector<T> <a class="code" href="namespaceutil_1_1internal.html#aefe117335b59796829ef22c7dd2099c9">RunTopologicalSorterOrDie</a>(</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  Sorter* sorter, <span class="keyword">const</span> std::vector<std::pair<T, T>>& arcs) {</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  std::vector<T> topo_order;</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code" href="namespaceutil_1_1internal.html#a2469f1533fa009758f1d3c4b5a7dda31">RunTopologicalSorter</a>(sorter, arcs, &topo_order, &topo_order))</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  << <span class="stringliteral">"Found cycle: "</span> << <a class="code" href="namespacegtl.html#a252ef610941828aa417152c3230ca670">gtl::LogContainer</a>(topo_order);</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordflow">return</span> topo_order;</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span> }</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  </div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> stable_sort = false></div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"><a class="line" href="namespaceutil_1_1internal.html#ab12d59ce7e9e42d05a336f0ee5bd9561"> 434</a></span> std::vector<int> <a class="code" href="namespaceutil_1_1internal.html#ab12d59ce7e9e42d05a336f0ee5bd9561">DenseIntTopologicalSortOrDieImpl</a>(</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</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="l00436"></a><span class="lineno"> 436</span>  <a class="code" href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html">DenseIntTopologicalSorterTpl<stable_sort></a> sorter(num_nodes);</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceutil_1_1internal.html#aefe117335b59796829ef22c7dd2099c9">RunTopologicalSorterOrDie</a>(&sorter, arcs);</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span> }</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  </div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keywordtype">bool</span> stable_sort = false></div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"><a class="line" href="namespaceutil_1_1internal.html#a13fc55a09e673e1f4a327f4492537554"> 441</a></span> std::vector<T> <a class="code" href="namespaceutil_1_1internal.html#a13fc55a09e673e1f4a327f4492537554">TopologicalSortOrDieImpl</a>(</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keyword">const</span> std::vector<T>& nodes, <span class="keyword">const</span> std::vector<std::pair<T, T>>& arcs) {</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <a class="code" href="classutil_1_1_topological_sorter.html">TopologicalSorter<T, stable_sort></a> sorter;</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> T& node : nodes) {</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  sorter.<a class="code" href="classutil_1_1_topological_sorter.html#adf35867ff0932290f5456b27d1ed6bff">AddNode</a>(node);</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  }</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceutil_1_1internal.html#aefe117335b59796829ef22c7dd2099c9">RunTopologicalSorterOrDie</a>(&sorter, arcs);</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span> }</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span> } <span class="comment">// namespace internal</span></div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  </div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span> <span class="comment">// Implementations of the "simple API" functions declared at the top.</span></div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"><a class="line" href="namespaceutil.html#ab334681e638994051039e44e8789d3f5"> 452</a></span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="namespaceutil.html#ab334681e638994051039e44e8789d3f5">DenseIntTopologicalSort</a>(</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</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="l00454"></a><span class="lineno"> 454</span>  std::vector<int>* topological_order) {</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keywordflow">return</span> internal::DenseIntTopologicalSortImpl<false>(num_nodes, arcs,</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  topological_order);</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span> }</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  </div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"><a class="line" href="namespaceutil.html#a551780458cf6bf0170ab36e9eb7d88eb"> 459</a></span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="namespaceutil.html#a551780458cf6bf0170ab36e9eb7d88eb">DenseIntStableTopologicalSort</a>(</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</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="l00461"></a><span class="lineno"> 461</span>  std::vector<int>* topological_order) {</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keywordflow">return</span> internal::DenseIntTopologicalSortImpl<true>(num_nodes, arcs,</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  topological_order);</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span> }</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  </div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"><a class="line" href="namespaceutil.html#ae1d38e9433c8c471ee54f1f4e9f538af"> 467</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespaceutil.html#af41e869886ca4b1bacaeb24fa76343f0">TopologicalSort</a>(<span class="keyword">const</span> std::vector<T>& nodes,</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keyword">const</span> std::vector<std::pair<T, T>>& arcs,</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  std::vector<T>* topological_order) {</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keywordflow">return</span> internal::TopologicalSortImpl<T, false>(nodes, arcs,</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  topological_order);</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span> }</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  </div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"><a class="line" href="namespaceutil.html#a4af619041e395824341b2def36c1de6f"> 475</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespaceutil.html#ad150c7b6ee948e66c2abeadb4ce2d3e4">StableTopologicalSort</a>(<span class="keyword">const</span> std::vector<T>& nodes,</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keyword">const</span> std::vector<std::pair<T, T>>& arcs,</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  std::vector<T>* topological_order) {</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordflow">return</span> internal::TopologicalSortImpl<T, true>(nodes, arcs, topological_order);</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span> }</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  </div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"><a class="line" href="namespaceutil.html#af5ba39bfb98a77b28ace8a45cfb9e855"> 481</a></span> <span class="keyword">inline</span> std::vector<int> <a class="code" href="namespaceutil.html#af5ba39bfb98a77b28ace8a45cfb9e855">DenseIntTopologicalSortOrDie</a>(</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</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="l00483"></a><span class="lineno"> 483</span>  <span class="keywordflow">return</span> internal::DenseIntTopologicalSortOrDieImpl<false>(num_nodes, arcs);</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span> }</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  </div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"><a class="line" href="namespaceutil.html#ab5d7c8313ca0fd87a7d5445081e97b0c"> 486</a></span> <span class="keyword">inline</span> std::vector<int> <a class="code" href="namespaceutil.html#ab5d7c8313ca0fd87a7d5445081e97b0c">DenseIntStableTopologicalSortOrDie</a>(</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</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="l00488"></a><span class="lineno"> 488</span>  <span class="keywordflow">return</span> internal::DenseIntTopologicalSortOrDieImpl<true>(num_nodes, arcs);</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span> }</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  </div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"><a class="line" href="namespaceutil.html#aeb4b373ef569ec99917c4566aac1b741"> 492</a></span> std::vector<T> <a class="code" href="namespaceutil.html#aeb4b373ef569ec99917c4566aac1b741">TopologicalSortOrDie</a>(<span class="keyword">const</span> std::vector<T>& nodes,</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keyword">const</span> std::vector<std::pair<T, T>>& arcs) {</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordflow">return</span> internal::TopologicalSortOrDieImpl<T, false>(nodes, arcs);</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span> }</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  </div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"><a class="line" href="namespaceutil.html#af7583b83e073657b301db60692ad0390"> 498</a></span> std::vector<T> <a class="code" href="namespaceutil.html#af7583b83e073657b301db60692ad0390">StableTopologicalSortOrDie</a>(</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keyword">const</span> std::vector<T>& nodes, <span class="keyword">const</span> std::vector<std::pair<T, T>>& arcs) {</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordflow">return</span> internal::TopologicalSortOrDieImpl<T, true>(nodes, arcs);</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span> }</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  </div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span> } <span class="comment">// namespace util</span></div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  </div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span> <span class="comment">// BACKWARDS COMPATIBILITY</span></div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span> <span class="comment">// Some of the classes or functions have been exposed under the global namespace</span></div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span> <span class="comment">// or the util::graph:: namespace. Until all clients are fixed to use the</span></div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span> <span class="comment">// util:: namespace, we keep those versions around.</span></div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"><a class="line" href="topologicalsorter_8h.html#a1f8f665393baf8da98b841fd2d35f4c6"> 509</a></span> <a class="code" href="topologicalsorter_8h.html#a1f8f665393baf8da98b841fd2d35f4c6">typedef ::util::DenseIntStableTopologicalSorter</a> <a class="code" href="topologicalsorter_8h.html#a1f8f665393baf8da98b841fd2d35f4c6">DenseIntStableTopologicalSorter</a>;</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"><a class="line" href="topologicalsorter_8h.html#a8b6138051f1b749d68632e232dae034f"> 510</a></span> <a class="code" href="topologicalsorter_8h.html#a8b6138051f1b749d68632e232dae034f">typedef ::util::DenseIntTopologicalSorter</a> <a class="code" href="topologicalsorter_8h.html#a8b6138051f1b749d68632e232dae034f">DenseIntTopologicalSorter</a>;</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keywordtype">bool</span> stable_sort = <span class="keyword">false</span>,</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keyword">typename</span> <a class="code" href="namespaceutil__hash.html#aa2ba7114404f5416e797636b0e1eddcd">Hash</a> = <span class="keyword">typename</span> absl::flat_hash_map<T, int>::hasher,</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keyword">typename</span> KeyEqual =</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keyword">typename</span> absl::flat_hash_map<T, int, Hash>::key_equal></div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"><a class="line" href="class_topological_sorter.html"> 515</a></span> <span class="keyword">class </span><a class="code" href="class_topological_sorter.html">TopologicalSorter</a></div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  : <span class="keyword">public</span> <a class="code" href="classutil_1_1_topological_sorter.html">::util::TopologicalSorter</a><T, stable_sort, Hash, KeyEqual> {};</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  </div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span> <span class="keyword">namespace </span><a class="code" href="namespaceutil.html">util</a> {</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"><a class="line" href="namespaceutil_1_1graph.html"> 519</a></span> <span class="keyword">namespace </span>graph {</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"><a class="line" href="namespaceutil_1_1graph.html#ac91f14af7aefe8e2434052500fc53ca5"> 520</a></span> <span class="keyword">inline</span> std::vector<int> <a class="code" href="namespaceutil_1_1graph.html#ac91f14af7aefe8e2434052500fc53ca5">DenseIntTopologicalSortOrDie</a>(</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</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="l00522"></a><span class="lineno"> 522</span>  <a class="code" href="namespaceutil_1_1graph.html#ac91f14af7aefe8e2434052500fc53ca5">return ::util::DenseIntTopologicalSortOrDie</a>(num_nodes, arcs);</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span> }</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"><a class="line" href="namespaceutil_1_1graph.html#a7d60006ef9e9a72f33a79d9756330f4e"> 524</a></span> <span class="keyword">inline</span> std::vector<int> <a class="code" href="namespaceutil_1_1graph.html#a7d60006ef9e9a72f33a79d9756330f4e">DenseIntStableTopologicalSortOrDie</a>(</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</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="l00526"></a><span class="lineno"> 526</span>  <a class="code" href="namespaceutil_1_1graph.html#a7d60006ef9e9a72f33a79d9756330f4e">return ::util::DenseIntStableTopologicalSortOrDie</a>(num_nodes, arcs);</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span> }</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"><a class="line" href="namespaceutil_1_1graph.html#a30786e77f8257683fea5c2a7a1185bd0"> 529</a></span> std::vector<T> <a class="code" href="namespaceutil_1_1graph.html#a30786e77f8257683fea5c2a7a1185bd0">StableTopologicalSortOrDie</a>(</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keyword">const</span> std::vector<T>& nodes, <span class="keyword">const</span> std::vector<std::pair<T, T>>& arcs) {</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  return ::util::StableTopologicalSortOrDie<T>(nodes, arcs);</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span> }</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  </div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span> } <span class="comment">// namespace graph</span></div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span> } <span class="comment">// namespace util</span></div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  </div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span> <span class="preprocessor">#endif // UTIL_GRAPH_TOPOLOGICALSORTER_H__</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div class="ttc" id="anamespacegtl_html_a7a0f8dc4187504b814d8a8be463b517c"><div class="ttname"><a href="namespacegtl.html#a7a0f8dc4187504b814d8a8be463b517c">gtl::LookupOrInsert</a></div><div class="ttdeci">Collection::value_type::second_type & LookupOrInsert(Collection *const collection, const typename Collection::value_type::first_type &key, const typename Collection::value_type::second_type &value)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00207">map_util.h:207</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_1_1graph_html_a7d60006ef9e9a72f33a79d9756330f4e"><div class="ttname"><a href="namespaceutil_1_1graph.html#a7d60006ef9e9a72f33a79d9756330f4e">util::graph::DenseIntStableTopologicalSortOrDie</a></div><div class="ttdeci">std::vector< int > DenseIntStableTopologicalSortOrDie(int num_nodes, const std::vector< std::pair< int, int >> &arcs)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00524">topologicalsorter.h:524</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1_topological_sorter_html_ad71227cf309f882f99921233186790c6"><div class="ttname"><a href="classutil_1_1_topological_sorter.html#ad71227cf309f882f99921233186790c6">util::TopologicalSorter::StartTraversal</a></div><div class="ttdeci">void StartTraversal()</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00341">topologicalsorter.h:341</a></div></div>
|
|
<div class="ttc" id="atopologicalsorter_8h_html_a8b6138051f1b749d68632e232dae034f"><div class="ttname"><a href="topologicalsorter_8h.html#a8b6138051f1b749d68632e232dae034f">DenseIntTopologicalSorter</a></div><div class="ttdeci">::util::DenseIntTopologicalSorter DenseIntTopologicalSorter</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00510">topologicalsorter.h:510</a></div></div>
|
|
<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="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="anamespaceutil_1_1internal_html_a428fd18bbf6ca438e45ed1ab423ba22b"><div class="ttname"><a href="namespaceutil_1_1internal.html#a428fd18bbf6ca438e45ed1ab423ba22b">util::internal::TopologicalSortImpl</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool TopologicalSortImpl(const std::vector< T > &nodes, const std::vector< std::pair< T, T >> &arcs, std::vector< T > *topological_order)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00412">topologicalsorter.h:412</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_html_ab334681e638994051039e44e8789d3f5"><div class="ttname"><a href="namespaceutil.html#ab334681e638994051039e44e8789d3f5">util::DenseIntTopologicalSort</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool DenseIntTopologicalSort(int num_nodes, const std::vector< std::pair< int, int >> &arcs, std::vector< int > *topological_order)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00452">topologicalsorter.h:452</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_html_a551780458cf6bf0170ab36e9eb7d88eb"><div class="ttname"><a href="namespaceutil.html#a551780458cf6bf0170ab36e9eb7d88eb">util::DenseIntStableTopologicalSort</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool DenseIntStableTopologicalSort(int num_nodes, const std::vector< std::pair< int, int >> &arcs, std::vector< int > *topological_order)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00459">topologicalsorter.h:459</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="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_1_1graph_html_a30786e77f8257683fea5c2a7a1185bd0"><div class="ttname"><a href="namespaceutil_1_1graph.html#a30786e77f8257683fea5c2a7a1185bd0">util::graph::StableTopologicalSortOrDie</a></div><div class="ttdeci">std::vector< T > StableTopologicalSortOrDie(const std::vector< T > &nodes, const std::vector< std::pair< T, T >> &arcs)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00529">topologicalsorter.h:529</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1_topological_sorter_html_adf35867ff0932290f5456b27d1ed6bff"><div class="ttname"><a href="classutil_1_1_topological_sorter.html#adf35867ff0932290f5456b27d1ed6bff">util::TopologicalSorter::AddNode</a></div><div class="ttdeci">void AddNode(const T &node)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00281">topologicalsorter.h:281</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a252ef610941828aa417152c3230ca670"><div class="ttname"><a href="namespacegtl.html#a252ef610941828aa417152c3230ca670">gtl::LogContainer</a></div><div class="ttdeci">auto LogContainer(const ContainerT &container, const PolicyT &policy) -> decltype(gtl::LogRange(container.begin(), container.end(), policy))</div><div class="ttdef"><b>Definition:</b> <a href="container__logging_8h_source.html#l00275">container_logging.h:275</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1_topological_sorter_html_a038de061979331bea01ffa96da55fac2"><div class="ttname"><a href="classutil_1_1_topological_sorter.html#a038de061979331bea01ffa96da55fac2">util::TopologicalSorter::AddEdge</a></div><div class="ttdeci">void AddEdge(const T &from, const T &to)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00287">topologicalsorter.h:287</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_html_af41e869886ca4b1bacaeb24fa76343f0"><div class="ttname"><a href="namespaceutil.html#af41e869886ca4b1bacaeb24fa76343f0">util::TopologicalSort</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool TopologicalSort(const std::vector< T > &nodes, const std::vector< std::pair< T, T >> &arcs, std::vector< T > *topological_order)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00467">topologicalsorter.h:467</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1_topological_sorter_html_a0f4f0594b7fb10285a7235db079abd46"><div class="ttname"><a href="classutil_1_1_topological_sorter.html#a0f4f0594b7fb10285a7235db079abd46">util::TopologicalSorter::GetNext</a></div><div class="ttdeci">bool GetNext(T *node, bool *cyclic_ptr, std::vector< T > *output_cycle_nodes=NULL)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00312">topologicalsorter.h:312</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1_topological_sorter_html_aa2b85b48ee1ab7b2e6da0ac2e8a91711"><div class="ttname"><a href="classutil_1_1_topological_sorter.html#aa2b85b48ee1ab7b2e6da0ac2e8a91711">util::TopologicalSorter::GetCurrentFringeSize</a></div><div class="ttdeci">int GetCurrentFringeSize()</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00332">topologicalsorter.h:332</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_html_af5ba39bfb98a77b28ace8a45cfb9e855"><div class="ttname"><a href="namespaceutil.html#af5ba39bfb98a77b28ace8a45cfb9e855">util::DenseIntTopologicalSortOrDie</a></div><div class="ttdeci">std::vector< int > DenseIntTopologicalSortOrDie(int num_nodes, const std::vector< std::pair< int, int >> &arcs)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00481">topologicalsorter.h:481</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_1_1internal_html_ab12d59ce7e9e42d05a336f0ee5bd9561"><div class="ttname"><a href="namespaceutil_1_1internal.html#ab12d59ce7e9e42d05a336f0ee5bd9561">util::internal::DenseIntTopologicalSortOrDieImpl</a></div><div class="ttdeci">std::vector< int > DenseIntTopologicalSortOrDieImpl(int num_nodes, const std::vector< std::pair< int, int >> &arcs)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00434">topologicalsorter.h:434</a></div></div>
|
|
<div class="ttc" id="acontainer__logging_8h_html"><div class="ttname"><a href="container__logging_8h.html">container_logging.h</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_1_topological_sorter_html_ad6b4163ff61978eb0e66658ded3b5744"><div class="ttname"><a href="classutil_1_1_topological_sorter.html#ad6b4163ff61978eb0e66658ded3b5744">util::TopologicalSorter::TopologicalSorter</a></div><div class="ttdeci">TopologicalSorter()</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00270">topologicalsorter.h:270</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_html_ad150c7b6ee948e66c2abeadb4ce2d3e4"><div class="ttname"><a href="namespaceutil.html#ad150c7b6ee948e66c2abeadb4ce2d3e4">util::StableTopologicalSort</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool StableTopologicalSort(const std::vector< T > &nodes, const std::vector< std::pair< T, T >> &arcs, std::vector< T > *topological_order)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00475">topologicalsorter.h:475</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1internal_1_1_dense_int_topological_sorter_tpl_html_ad4cbfde0e58af51646856c0dcbc28640"><div class="ttname"><a href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#ad4cbfde0e58af51646856c0dcbc28640">util::internal::DenseIntTopologicalSorterTpl::TraversalStarted</a></div><div class="ttdeci">bool TraversalStarted() const</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00186">topologicalsorter.h:186</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_1_1graph_html_ac91f14af7aefe8e2434052500fc53ca5"><div class="ttname"><a href="namespaceutil_1_1graph.html#ac91f14af7aefe8e2434052500fc53ca5">util::graph::DenseIntTopologicalSortOrDie</a></div><div class="ttdeci">std::vector< int > DenseIntTopologicalSortOrDie(int num_nodes, const std::vector< std::pair< int, int >> &arcs)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00520">topologicalsorter.h:520</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</a></div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00141">topologicalsorter.h:141</a></div></div>
|
|
<div class="ttc" id="aclass_topological_sorter_html"><div class="ttname"><a href="class_topological_sorter.html">TopologicalSorter</a></div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00515">topologicalsorter.h:516</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1_topological_sorter_html"><div class="ttname"><a href="classutil_1_1_topological_sorter.html">util::TopologicalSorter</a></div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00268">topologicalsorter.h:268</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_1_1internal_html_a13fc55a09e673e1f4a327f4492537554"><div class="ttname"><a href="namespaceutil_1_1internal.html#a13fc55a09e673e1f4a327f4492537554">util::internal::TopologicalSortOrDieImpl</a></div><div class="ttdeci">std::vector< T > TopologicalSortOrDieImpl(const std::vector< T > &nodes, const std::vector< std::pair< T, T >> &arcs)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00441">topologicalsorter.h:441</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_html_ab5d7c8313ca0fd87a7d5445081e97b0c"><div class="ttname"><a href="namespaceutil.html#ab5d7c8313ca0fd87a7d5445081e97b0c">util::DenseIntStableTopologicalSortOrDie</a></div><div class="ttdeci">std::vector< int > DenseIntStableTopologicalSortOrDie(int num_nodes, const std::vector< std::pair< int, int >> &arcs)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00486">topologicalsorter.h:486</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_1_1internal_html_ac53a0ceebb758d339062a2e1aad03a59"><div class="ttname"><a href="namespaceutil_1_1internal.html#ac53a0ceebb758d339062a2e1aad03a59">util::internal::DenseIntTopologicalSortImpl</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool DenseIntTopologicalSortImpl(int num_nodes, const std::vector< std::pair< int, int >> &arcs, std::vector< int > *topological_order)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00403">topologicalsorter.h:403</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_html_af7583b83e073657b301db60692ad0390"><div class="ttname"><a href="namespaceutil.html#af7583b83e073657b301db60692ad0390">util::StableTopologicalSortOrDie</a></div><div class="ttdeci">std::vector< T > StableTopologicalSortOrDie(const std::vector< T > &nodes, const std::vector< std::pair< T, T >> &arcs)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00498">topologicalsorter.h:498</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_1_1internal_html_aefe117335b59796829ef22c7dd2099c9"><div class="ttname"><a href="namespaceutil_1_1internal.html#aefe117335b59796829ef22c7dd2099c9">util::internal::RunTopologicalSorterOrDie</a></div><div class="ttdeci">std::vector< T > RunTopologicalSorterOrDie(Sorter *sorter, const std::vector< std::pair< T, T >> &arcs)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00425">topologicalsorter.h:425</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1internal_1_1_dense_int_topological_sorter_tpl_html_a22fc21e3de5c05e9a2540c2a9beeded4"><div class="ttname"><a href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a22fc21e3de5c05e9a2540c2a9beeded4">util::internal::DenseIntTopologicalSorterTpl::DenseIntTopologicalSorterTpl</a></div><div class="ttdeci">DenseIntTopologicalSorterTpl(int num_nodes)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00156">topologicalsorter.h:156</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_1_1internal_html_a2469f1533fa009758f1d3c4b5a7dda31"><div class="ttname"><a href="namespaceutil_1_1internal.html#a2469f1533fa009758f1d3c4b5a7dda31">util::internal::RunTopologicalSorter</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool RunTopologicalSorter(Sorter *sorter, const std::vector< std::pair< T, T >> &arcs, std::vector< T > *topological_order_or_cycle)</div></div>
|
|
<div class="ttc" id="aclassutil_1_1_topological_sorter_html_a896eb8719e4aa05badde9c9f6b94264f"><div class="ttname"><a href="classutil_1_1_topological_sorter.html#a896eb8719e4aa05badde9c9f6b94264f">util::TopologicalSorter::~TopologicalSorter</a></div><div class="ttdeci">~TopologicalSorter()</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00271">topologicalsorter.h:271</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_1_topological_sorter_html_ad4cbfde0e58af51646856c0dcbc28640"><div class="ttname"><a href="classutil_1_1_topological_sorter.html#ad4cbfde0e58af51646856c0dcbc28640">util::TopologicalSorter::TraversalStarted</a></div><div class="ttdeci">bool TraversalStarted() const</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00355">topologicalsorter.h:355</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_html_aeb4b373ef569ec99917c4566aac1b741"><div class="ttname"><a href="namespaceutil.html#aeb4b373ef569ec99917c4566aac1b741">util::TopologicalSortOrDie</a></div><div class="ttdeci">std::vector< T > TopologicalSortOrDie(const std::vector< T > &nodes, const std::vector< std::pair< T, T >> &arcs)</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00492">topologicalsorter.h:492</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_html_a74fc6e241bfc96048a5612a62fa34d11"><div class="ttname"><a href="namespaceutil.html#a74fc6e241bfc96048a5612a62fa34d11">util::DenseIntStableTopologicalSorter</a></div><div class="ttdeci">::util::internal::DenseIntTopologicalSorterTpl< true > DenseIntStableTopologicalSorter</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00232">topologicalsorter.h:232</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="anamespaceutil_html_af1e0eacbfb0b5de3f7453de0f9a48201"><div class="ttname"><a href="namespaceutil.html#af1e0eacbfb0b5de3f7453de0f9a48201">util::DenseIntTopologicalSorter</a></div><div class="ttdeci">::util::internal::DenseIntTopologicalSorterTpl< false > DenseIntTopologicalSorter</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00241">topologicalsorter.h:241</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="aclassutil_1_1internal_1_1_dense_int_topological_sorter_tpl_html_aa2b85b48ee1ab7b2e6da0ac2e8a91711"><div class="ttname"><a href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#aa2b85b48ee1ab7b2e6da0ac2e8a91711">util::internal::DenseIntTopologicalSorterTpl::GetCurrentFringeSize</a></div><div class="ttdeci">int GetCurrentFringeSize()</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00179">topologicalsorter.h:179</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a8b11464d5e8c5f0bb36a15d53abb8cc7"><div class="ttname"><a href="namespacegtl.html#a8b11464d5e8c5f0bb36a15d53abb8cc7">gtl::STLClearHashIfBig</a></div><div class="ttdeci">void STLClearHashIfBig(T *obj, size_t limit)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00180">stl_util.h:180</a></div></div>
|
|
<div class="ttc" id="atopologicalsorter_8h_html_a1f8f665393baf8da98b841fd2d35f4c6"><div class="ttname"><a href="topologicalsorter_8h.html#a1f8f665393baf8da98b841fd2d35f4c6">DenseIntStableTopologicalSorter</a></div><div class="ttdeci">::util::DenseIntStableTopologicalSorter DenseIntStableTopologicalSorter</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00509">topologicalsorter.h:509</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_8cc_html_a395f613555f398dd389670bb4c2a4599"><div class="ttname"><a href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a></div><div class="ttdeci">Block * next</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l00674">constraint_solver.cc:674</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#l00039">bop_parameters.pb.h:39</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="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__hash_html_aa2ba7114404f5416e797636b0e1eddcd"><div class="ttname"><a href="namespaceutil__hash.html#aa2ba7114404f5416e797636b0e1eddcd">util_hash::Hash</a></div><div class="ttdeci">uint64 Hash(uint64 num, uint64 c)</div><div class="ttdef"><b>Definition:</b> <a href="hash_8h_source.html#l00150">hash.h:150</a></div></div>
|
|
<div class="ttc" id="aclassutil_1_1internal_1_1_dense_int_topological_sorter_tpl_html_a8feb90266ba02e6f92df32ac619589de"><div class="ttname"><a href="classutil_1_1internal_1_1_dense_int_topological_sorter_tpl.html#a8feb90266ba02e6f92df32ac619589de">util::internal::DenseIntTopologicalSorterTpl::DenseIntTopologicalSorterTpl</a></div><div class="ttdeci">DenseIntTopologicalSorterTpl()</div><div class="ttdef"><b>Definition:</b> <a href="topologicalsorter_8h_source.html#l00148">topologicalsorter.h:148</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_8h.html">topologicalsorter.h</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>
|