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