257 lines
487 KiB
HTML
257 lines
487 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<title>OR-Tools</title>
|
|
<meta http-equiv="Content-Type" content="text/html;"/>
|
|
<meta charset="utf-8"/>
|
|
<!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
|
|
<link rel="stylesheet" type="text/css" href="ortools.css" title="default" media="screen,print" />
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
</head>
|
|
<body>
|
|
<div id="banner-container">
|
|
<div id="banner">
|
|
<span id="sfml">OR-Tools 7.2</span>
|
|
</div>
|
|
</div>
|
|
<link rel="icon" href="https://developers.google.com/optimization/images/orLogo.png">
|
|
<div id="content">
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<li><a href="index.html"><span>Main Page</span></a></li>
|
|
<li><a href="pages.html"><span>Related Pages</span></a></li>
|
|
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
|
|
<li><a href="annotated.html"><span>Classes</span></a></li>
|
|
<li class="current"><a href="files.html"><span>Files</span></a></li>
|
|
</ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('graph_8h_source.html','');});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">graph.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="graph_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">//</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">//</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// This file defines a generic graph interface on which most algorithms can be</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// built and provides a few efficient implementations with a fast construction</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// time. Its design is based on the experience acquired by the Operations</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">// Research team in their various graph algorithm implementations.</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">//</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// The main ideas are:</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// - Graph nodes and arcs are represented by integers.</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// - Node or arc annotations (weight, cost, ...) are not part of the graph</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">// class, they can be stored outside in one or more arrays and can be easily</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// retrieved using a node or arc as an index.</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">//</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// Terminology:</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// - An arc of a graph is directed and going from a tail node to a head node.</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// - Some implementations also store 'reverse' arcs and can be used for</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// undirected graph or flow-like algorithm.</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// - A node or arc index is 'valid' if it represents a node or arc of</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// the graph. The validity ranges are always [0, num_nodes()) for nodes and</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// [0, num_arcs()) for forward arcs. Reverse arcs are elements of</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// [-num_arcs(), 0) and are also considered valid by the implementations that</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// store them.</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">//</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// Provided implementations:</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// - ListGraph<> for the simplest api. Also aliased to util::Graph.</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// - StaticGraph<> for performance, but require calling Build(), see below</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// - CompleteGraph<> if you need a fully connected graph</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// - CompleteBipartiteGraph<> if you need a fully connected bipartite graph</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// - ReverseArcListGraph<> to add reverse arcs to ListGraph<></span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// - ReverseArcStaticGraph<> to add reverse arcs to StaticGraph<></span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// - ReverseArcMixedGraph<> for a smaller memory footprint</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">//</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// Utility classes & functions:</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// - Permute() to permute an array according to a given permutation.</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// - SVector<> vector with index range [-size(), size()) for ReverseArcGraph.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">//</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// Basic usage:</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// typedef ListGraph<> Graph; // Choose a graph implementation.</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// Graph graph;</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// for (...) {</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// graph.AddArc(tail, head);</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// }</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// ...</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment">// for (int node = 0; node < graph.num_nodes(); ++node) {</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// for (const int arc : graph.OutgoingArcs(node)) {</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment">// head = graph.Head(arc);</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment">// tail = node; // or graph.Tail(arc) which is fast but not as much.</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// }</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// }</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment">//</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment">// Iteration over the arcs touching a node:</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment">//</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment">// - OutgoingArcs(node): All the forward arcs leaving the node.</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment">// - IncomingArcs(node): All the forward arcs arriving at the node.</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment">//</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// And two more involved ones:</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment">//</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment">// - OutgoingOrOppositeIncomingArcs(node): This returns both the forward arcs</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// leaving the node (i.e. OutgoingArcs(node)) and the reverse arcs leaving the</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// node (i.e. the opposite arcs of the ones returned by IncomingArcs(node)).</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// - OppositeIncomingArcs(node): This returns the reverse arcs leaving the node.</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment">//</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// Note on iteration efficiency: When re-indexing the arcs it is not possible to</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// have both the outgoing arcs and the incoming ones form a consecutive range.</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment">//</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// It is however possible to do so for the outgoing arcs and the opposite</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment">// incoming arcs. It is why the OutgoingOrOppositeIncomingArcs() and</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment">// OutgoingArcs() iterations are more efficient than the IncomingArcs() one.</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment">//</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment">// If you know the graph size in advance, this already set the number of nodes,</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment">// reserve space for the arcs and check in DEBUG mode that you don't go over the</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment">// bounds:</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment">// Graph graph(num_nodes, arc_capacity);</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment">//</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment">// Storing and using node annotations:</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment">// std::vector<bool> is_visited(graph.num_nodes(), false);</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// ...</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment">// for (int node = 0; node < graph.num_nodes(); ++node) {</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment">// if (!is_visited[node]) ...</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// }</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment">//</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment">// Storing and using arc annotations:</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// std::vector<int> weights;</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// for (...) {</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment">// graph.AddArc(tail, head);</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment">// weights.push_back(arc_weight);</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment">// }</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment">// ...</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// for (const int arc : graph.OutgoingArcs(node)) {</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// ... weights[arc] ...;</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment">// }</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment">//</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// More efficient version:</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment">// typedef StaticGraph<> Graph;</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// Graph graph(num_nodes, arc_capacity); // Optional, but help memory usage.</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// std::vector<int> weights;</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment">// weights.reserve(arc_capacity); // Optional, but help memory usage.</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment">// for (...) {</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment">// graph.AddArc(tail, head);</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment">// weights.push_back(arc_weight);</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// }</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment">// ...</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment">// std::vector<Graph::ArcIndex> permutation;</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// graph.Build(&permutation); // A static graph must be Build() before usage.</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment">// Permute(permutation, &weights); // Build() may permute the arc index.</span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment">// ...</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment">//</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// Encoding an undirected graph: If you don't need arc annotation, then the best</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// is to add two arcs for each edge (one in each direction) to a directed graph.</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// Otherwise you can do the following.</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment">//</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment">// typedef ReverseArc... Graph;</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// Graph graph;</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="comment">// for (...) {</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment">// graph.AddArc(tail, head); // or graph.AddArc(head, tail) but not both.</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// edge_annotations.push_back(value);</span></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment">// }</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment">// ...</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment">// for (const Graph::NodeIndex node : graph.AllNodes()) {</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment">// for (const Graph::ArcIndex arc :</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// graph.OutgoingOrOppositeIncomingArcs(node)) {</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment">// destination = graph.Head(arc);</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment">// annotation = edge_annotations[arc < 0 ? graph.OppositeArc(arc) : arc];</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment">// }</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment">// }</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment">//</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment">//</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment">// Note: The graphs are primarily designed to be constructed first and then used</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// because it covers most of the use cases. It is possible to extend the</span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment">// interface with more dynamicity (like removing arcs), but this is not done at</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// this point. Note that a "dynamic" implementation will break some assumptions</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// we make on what node or arc are valid and also on the indices returned by</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// AddArc(). Some arguments for simplifying the interface at the cost of</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// dynamicity are:</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment">//</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// - It is always possible to construct a static graph from a dynamic one</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// before calling a complex algo.</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment">// - If you really need a dynamic graph, maybe it is better to compute a graph</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment">// property incrementally rather than calling an algorithm that starts from</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// scratch each time.</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> </div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="preprocessor">#ifndef UTIL_GRAPH_GRAPH_H_</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="preprocessor">#define UTIL_GRAPH_GRAPH_H_</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> </div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="preprocessor">#include <algorithm></span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="preprocessor">#include <cstddef></span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="preprocessor">#include <cstdlib></span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="preprocessor">#include <limits></span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="preprocessor">#include <new></span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="preprocessor">#include "ortools/base/integral_types.h"</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="preprocessor">#include "ortools/base/logging.h"</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="preprocessor">#include "ortools/base/macros.h"</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="preprocessor">#include "<a class="code" href="iterators_8h.html">ortools/graph/iterators.h</a>"</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="keyword">namespace </span><a class="code" href="namespaceutil.html">util</a> {</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="comment">// Forward declaration.</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div><div class="line"><a name="l00174"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html"> 174</a></span> <span class="keyword">class </span><a class="code" href="classutil_1_1SVector.html">SVector</a>;</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> </div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="comment">// Base class of all Graphs implemented here. The default value for the graph</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="comment">// index types is int32 since allmost all graphs that fit into memory do not</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="comment">// need bigger indices.</span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment">//</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment">// Note: The type can be unsigned, except for the graphs with reverse arcs</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment">// where the ArcIndexType must be signed, but not necessarly the NodeIndexType.</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType = int32, <span class="keyword">typename</span> ArcIndexType = int32,</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordtype">bool</span> HasReverseArcs = <span class="keyword">false</span>></div><div class="line"><a name="l00184"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html"> 184</a></span> <span class="keyword">class </span><a class="code" href="classutil_1_1BaseGraph.html">BaseGraph</a> {</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// Typedef so you can use Graph::NodeIndex and Graph::ArcIndex to be generic</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">// but also to improve the readability of your code. We also recommend</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// that you define a typedef ... Graph; for readability.</span></div><div class="line"><a name="l00189"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#adb271cf4bcf2de5b5bbe300d7054af29"> 189</a></span>  <span class="keyword">typedef</span> NodeIndexType <a class="code" href="classutil_1_1BaseGraph.html#adb271cf4bcf2de5b5bbe300d7054af29">NodeIndex</a>;</div><div class="line"><a name="l00190"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#a0eba6e5899924388644dfa2258ae8929"> 190</a></span>  <span class="keyword">typedef</span> ArcIndexType <a class="code" href="classutil_1_1BaseGraph.html#a0eba6e5899924388644dfa2258ae8929">ArcIndex</a>;</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> </div><div class="line"><a name="l00192"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#ab2aa905e49f98689100f071c493d20fa"> 192</a></span>  <a class="code" href="classutil_1_1BaseGraph.html#ab2aa905e49f98689100f071c493d20fa">BaseGraph</a>()</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  : <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">num_nodes_</a>(0),</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <a class="code" href="classutil_1_1BaseGraph.html#a424bd34a9767e7edeaf3a60ecd3cb000">node_capacity_</a>(0),</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">num_arcs_</a>(0),</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <a class="code" href="classutil_1_1BaseGraph.html#a895e891d1ad52ce3efcfeb7ba11194c7">arc_capacity_</a>(0),</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <a class="code" href="classutil_1_1BaseGraph.html#aa980e5526b9ded17a83928fc339c71e4">const_capacities_</a>(<a class="code" href="namespaceutil.html#aadd7603ae6e78cc2490ca9710fbaf180">false</a>) {}</div><div class="line"><a name="l00198"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#ad2353019d9890202a2220fd230940fb5"> 198</a></span>  <span class="keyword">virtual</span> <a class="code" href="classutil_1_1BaseGraph.html#ad2353019d9890202a2220fd230940fb5">~BaseGraph</a>() {}</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="comment">// Returns the number of valid nodes in the graph.</span></div><div class="line"><a name="l00201"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#a0f551c921fa0b5aaa334a6e36f61db4a"> 201</a></span>  NodeIndexType <a class="code" href="classutil_1_1BaseGraph.html#a0f551c921fa0b5aaa334a6e36f61db4a">num_nodes</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">num_nodes_</a>; }</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> </div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// Returns the number of valid arcs in the graph.</span></div><div class="line"><a name="l00204"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#aefb468e4d4a3128c91b3bad9f5b314c8"> 204</a></span>  ArcIndexType <a class="code" href="classutil_1_1BaseGraph.html#aefb468e4d4a3128c91b3bad9f5b314c8">num_arcs</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">num_arcs_</a>; }</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> </div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="comment">// Allows nice range-based for loop:</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="comment">// for (const NodeIndex node : graph.AllNodes()) { ... }</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="comment">// for (const ArcIndex arc : graph.AllForwardArcs()) { ... }</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  IntegerRange<NodeIndex> <a class="code" href="classutil_1_1BaseGraph.html#a32ba4a5ca9a4b89f750eb2dc56518b02">AllNodes</a>() <span class="keyword">const</span>;</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  IntegerRange<ArcIndex> <a class="code" href="classutil_1_1BaseGraph.html#abcfd7c21143e5ed38573c0dd60826dd8">AllForwardArcs</a>() <span class="keyword">const</span>;</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> </div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="comment">// Returns true if the given node is a valid node of the graph.</span></div><div class="line"><a name="l00213"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#abf853acea86e01356f53055f77661770"> 213</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classutil_1_1BaseGraph.html#abf853acea86e01356f53055f77661770">IsNodeValid</a>(NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">return</span> node >= 0 && node < <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">num_nodes_</a>;</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  }</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> </div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">// Returns true if the given arc is a valid arc of the graph.</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">// Note that the arc validity range changes for graph with reverse arcs.</span></div><div class="line"><a name="l00219"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#a2097ccda3b1ad27e2c82166979018bda"> 219</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classutil_1_1BaseGraph.html#a2097ccda3b1ad27e2c82166979018bda">IsArcValid</a>(ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">return</span> (HasReverseArcs ? -<a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">num_arcs_</a> : 0) <= arc && arc < <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">num_arcs_</a>;</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  }</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> </div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="comment">// Capacity reserved for future nodes, always >= num_nodes_.</span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  NodeIndexType <a class="code" href="classutil_1_1BaseGraph.html#a463d57480c9563a7a707c5d0928c9946">node_capacity</a>() <span class="keyword">const</span>;</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span> </div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="comment">// Capacity reserved for future arcs, always >= num_arcs_.</span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  ArcIndexType <a class="code" href="classutil_1_1BaseGraph.html#a92ffd852b2ab2e5241f9832e71a2de71">arc_capacity</a>() <span class="keyword">const</span>;</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> </div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="comment">// Changes the graph capacities. The functions will fail in debug mode if:</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="comment">// - const_capacities_ is true.</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="comment">// - A valid node does not fall into the new node range.</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">// - A valid arc does not fall into the new arc range.</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="comment">// In non-debug mode, const_capacities_ is ignored and nothing will happen</span></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="comment">// if the new capacity value for the arcs or the nodes is too small.</span></div><div class="line"><a name="l00235"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#a69a71cbb575b13bde9899f5a6a217139"> 235</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1BaseGraph.html#a69a71cbb575b13bde9899f5a6a217139">ReserveNodes</a>(NodeIndexType bound) {</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  DCHECK(!<a class="code" href="classutil_1_1BaseGraph.html#aa980e5526b9ded17a83928fc339c71e4">const_capacities_</a>);</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  DCHECK_GE(bound, <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">num_nodes_</a>);</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">if</span> (bound <= <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">num_nodes_</a>) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <a class="code" href="classutil_1_1BaseGraph.html#a424bd34a9767e7edeaf3a60ecd3cb000">node_capacity_</a> = bound;</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  }</div><div class="line"><a name="l00241"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#a9563f7154a759843923dd9bb27b288e7"> 241</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1BaseGraph.html#a9563f7154a759843923dd9bb27b288e7">ReserveArcs</a>(ArcIndexType bound) {</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  DCHECK(!<a class="code" href="classutil_1_1BaseGraph.html#aa980e5526b9ded17a83928fc339c71e4">const_capacities_</a>);</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  DCHECK_GE(bound, <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">num_arcs_</a>);</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">if</span> (bound <= <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">num_arcs_</a>) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <a class="code" href="classutil_1_1BaseGraph.html#a895e891d1ad52ce3efcfeb7ba11194c7">arc_capacity_</a> = bound;</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  }</div><div class="line"><a name="l00247"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#ab731ca5c638e7b1b0a2c459c94a90f55"> 247</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1BaseGraph.html#ab731ca5c638e7b1b0a2c459c94a90f55">Reserve</a>(NodeIndexType <a class="code" href="classutil_1_1BaseGraph.html#a463d57480c9563a7a707c5d0928c9946">node_capacity</a>, ArcIndexType <a class="code" href="classutil_1_1BaseGraph.html#a92ffd852b2ab2e5241f9832e71a2de71">arc_capacity</a>) {</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <a class="code" href="classutil_1_1BaseGraph.html#a69a71cbb575b13bde9899f5a6a217139">ReserveNodes</a>(<a class="code" href="classutil_1_1BaseGraph.html#a463d57480c9563a7a707c5d0928c9946">node_capacity</a>);</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <a class="code" href="classutil_1_1BaseGraph.html#a9563f7154a759843923dd9bb27b288e7">ReserveArcs</a>(<a class="code" href="classutil_1_1BaseGraph.html#a92ffd852b2ab2e5241f9832e71a2de71">arc_capacity</a>);</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  }</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> </div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="comment">// FreezeCapacities() makes any future attempt to change the graph capacities</span></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="comment">// crash in DEBUG mode.</span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1BaseGraph.html#aa3bd051d1e141b09dda17aa9b5f24f69">FreezeCapacities</a>();</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> </div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="comment">// Constants that will never be a valid node or arc.</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="comment">// They are the maximum possible node and arc capacity.</span></div><div class="line"><a name="l00258"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#ab1292c82a3f43be3bd57b63a05fe0214"> 258</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> NodeIndexType <a class="code" href="classutil_1_1BaseGraph.html#ab1292c82a3f43be3bd57b63a05fe0214">kNilNode</a>;</div><div class="line"><a name="l00259"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521"> 259</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> ArcIndexType <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">kNilArc</a>;</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> </div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="comment">// TODO(user): remove the public functions below. They are just here during</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="comment">// the transition from the old ebert_graph api to this new graph api.</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> A, <span class="keyword">typename</span> B></div><div class="line"><a name="l00264"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#a07214b96597069d781e27b1dd17ef83e"> 264</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1BaseGraph.html#a07214b96597069d781e27b1dd17ef83e">GroupForwardArcsByFunctor</a>(<span class="keyword">const</span> A& a, B* b) {</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  LOG(FATAL) << <span class="stringliteral">"Not supported"</span>;</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  }</div><div class="line"><a name="l00267"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#a346b8a5811f0e287e1ebce2de2c1ad28"> 267</a></span>  ArcIndexType <a class="code" href="classutil_1_1BaseGraph.html#a346b8a5811f0e287e1ebce2de2c1ad28">max_end_arc_index</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classutil_1_1BaseGraph.html#a895e891d1ad52ce3efcfeb7ba11194c7">arc_capacity_</a>; }</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> </div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">// Functions commented when defined because they are implementation details.</span></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1BaseGraph.html#ac47030fcb75a3220f8cf9ed79697056e">ComputeCumulativeSum</a>(std::vector<ArcIndexType>* v);</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1BaseGraph.html#a63fd586eed6c345866317e2f0faf377e">BuildStartAndForwardHead</a>(<a class="code" href="classutil_1_1SVector.html">SVector<NodeIndexType></a>* head,</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  std::vector<ArcIndexType>* start,</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  std::vector<ArcIndexType>* permutation);</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> </div><div class="line"><a name="l00276"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f"> 276</a></span>  NodeIndexType <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">num_nodes_</a>;</div><div class="line"><a name="l00277"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#a424bd34a9767e7edeaf3a60ecd3cb000"> 277</a></span>  NodeIndexType <a class="code" href="classutil_1_1BaseGraph.html#a424bd34a9767e7edeaf3a60ecd3cb000">node_capacity_</a>;</div><div class="line"><a name="l00278"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff"> 278</a></span>  ArcIndexType <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">num_arcs_</a>;</div><div class="line"><a name="l00279"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#a895e891d1ad52ce3efcfeb7ba11194c7"> 279</a></span>  ArcIndexType <a class="code" href="classutil_1_1BaseGraph.html#a895e891d1ad52ce3efcfeb7ba11194c7">arc_capacity_</a>;</div><div class="line"><a name="l00280"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#aa980e5526b9ded17a83928fc339c71e4"> 280</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classutil_1_1BaseGraph.html#aa980e5526b9ded17a83928fc339c71e4">const_capacities_</a>;</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> };</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> </div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span> <span class="comment">// Basic graph implementation without reverse arc. This class also serves as a</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="comment">// documentation for the generic graph interface (minus the part related to</span></div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> <span class="comment">// reverse arcs).</span></div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span> <span class="comment">//</span></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> <span class="comment">// This implementation uses a linked list and compared to StaticGraph:</span></div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span> <span class="comment">// - Is a bit faster to construct (if the arcs are not ordered by tail).</span></div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span> <span class="comment">// - Does not require calling Build().</span></div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span> <span class="comment">// - Has slower outgoing arc iteration.</span></div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> <span class="comment">// - Uses more memory: ArcIndexType * node_capacity()</span></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> <span class="comment">// + (ArcIndexType + NodeIndexType) * arc_capacity().</span></div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <span class="comment">// - Has an efficient Tail() but need an extra NodeIndexType/arc memory for it.</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="comment">// - Never changes the initial arc index returned by AddArc().</span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="comment">//</span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType = <span class="keywordtype">int</span>32, <span class="keyword">typename</span> ArcIndexType = <span class="keywordtype">int</span>32></div><div class="line"><a name="l00297"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph.html"> 297</a></span> <span class="keyword">class </span><a class="code" href="classutil_1_1ListGraph.html">ListGraph</a> : <span class="keyword">public</span> <a class="code" href="classutil_1_1BaseGraph.html">BaseGraph</a><NodeIndexType, ArcIndexType, false> {</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keyword">typedef</span> <a class="code" href="classutil_1_1BaseGraph.html">BaseGraph<NodeIndexType, ArcIndexType, false></a> <a class="code" href="classutil_1_1BaseGraph.html">Base</a>;</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a895e891d1ad52ce3efcfeb7ba11194c7">Base::arc_capacity_</a>;</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#aa980e5526b9ded17a83928fc339c71e4">Base::const_capacities_</a>;</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a424bd34a9767e7edeaf3a60ecd3cb000">Base::node_capacity_</a>;</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">Base::num_arcs_</a>;</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">Base::num_nodes_</a>;</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> </div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a2097ccda3b1ad27e2c82166979018bda">Base::IsArcValid</a>;</div><div class="line"><a name="l00307"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph.html#a4b5be895dae4a52e7bd97a7ef47267a6"> 307</a></span>  <a class="code" href="classutil_1_1ListGraph.html#a4b5be895dae4a52e7bd97a7ef47267a6">ListGraph</a>() {}</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> </div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="comment">// Reserve space for the graph at construction and do not allow it to grow</span></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">// beyond that, see FreezeCapacities(). This constructor also makes any nodes</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="comment">// in [0, num_nodes) valid.</span></div><div class="line"><a name="l00312"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph.html#a184d6ce1a3d943810039ac9b97b860ef"> 312</a></span>  <a class="code" href="classutil_1_1ListGraph.html#a184d6ce1a3d943810039ac9b97b860ef">ListGraph</a>(NodeIndexType <a class="code" href="classutil_1_1BaseGraph.html#a0f551c921fa0b5aaa334a6e36f61db4a">num_nodes</a>, ArcIndexType <a class="code" href="classutil_1_1BaseGraph.html#a92ffd852b2ab2e5241f9832e71a2de71">arc_capacity</a>) {</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  this-><a class="code" href="classutil_1_1BaseGraph.html#ab731ca5c638e7b1b0a2c459c94a90f55">Reserve</a>(num_nodes, <a class="code" href="classutil_1_1BaseGraph.html#a92ffd852b2ab2e5241f9832e71a2de71">arc_capacity</a>);</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  this-><a class="code" href="classutil_1_1BaseGraph.html#aa3bd051d1e141b09dda17aa9b5f24f69">FreezeCapacities</a>();</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  this-><a class="code" href="classutil_1_1ListGraph.html#a6af38e88610400b54e8f28ab6f880908">AddNode</a>(num_nodes - 1);</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  }</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> </div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="comment">// If node is not a valid node, sets num_nodes_ to node + 1 so that the given</span></div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="comment">// node becomes valid. It will fail in DEBUG mode if the capacities are fixed</span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="comment">// and the new node is out of range.</span></div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ListGraph.html#a6af38e88610400b54e8f28ab6f880908">AddNode</a>(NodeIndexType node);</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> </div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="comment">// Adds an arc to the graph and returns its current index which will always</span></div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="comment">// be num_arcs() - 1. It will also automatically call AddNode(tail)</span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="comment">// and AddNode(head). It will fail in DEBUG mode if the capacities</span></div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="comment">// are fixed and this cause the graph to grow beyond them.</span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="comment">//</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="comment">// Note: Self referencing arcs and duplicate arcs are supported.</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  ArcIndexType <a class="code" href="classutil_1_1ListGraph.html#ac1aa8c7591bb033a49bab79c21c9f496">AddArc</a>(NodeIndexType tail, NodeIndexType head);</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span> </div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="comment">// Some graph implementations need to be finalized with Build() before they</span></div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="comment">// can be used. After Build() is called, the arc indices (which had been the</span></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="comment">// return values of previous AddArc() calls) may change: the new index of</span></div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="comment">// former arc #i will be stored in permutation[i] if #i is smaller than</span></div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="comment">// permutation.size() or will be unchanged otherwise. If you don't care about</span></div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="comment">// these, just call the simple no-output version Build().</span></div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="comment">//</span></div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="comment">// Note that some implementations become immutable after calling Build().</span></div><div class="line"><a name="l00339"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph.html#a777ff917f03a31da77f275d536578afa"> 339</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ListGraph.html#a777ff917f03a31da77f275d536578afa">Build</a>() { <a class="code" href="classutil_1_1ListGraph.html#a777ff917f03a31da77f275d536578afa">Build</a>(<span class="keyword">nullptr</span>); }</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ListGraph.html#a777ff917f03a31da77f275d536578afa">Build</a>(std::vector<ArcIndexType>* permutation);</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> </div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="comment">// Do not use directly.</span></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keyword">class </span>OutgoingArcIterator;</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keyword">class </span>OutgoingHeadIterator;</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> </div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="comment">// Graph jargon: the "degree" of a node is its number of arcs. The out-degree</span></div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="comment">// is the number of outgoing arcs. The in-degree is the number of incoming</span></div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="comment">// arcs, and is only available for some graph implementations, below.</span></div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="comment">//</span></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="comment">// ListGraph<>::OutDegree() works in O(degree).</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  ArcIndexType <a class="code" href="classutil_1_1ListGraph.html#ac52db792129da62b7ab25372ab90647c">OutDegree</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> </div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="comment">// Allows to iterate over the forward arcs that verify Tail(arc) == node.</span></div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="comment">// This is meant to be used as:</span></div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="comment">// for (const ArcIndex arc : graph.OutgoingArcs(node)) { ... }</span></div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  BeginEndWrapper<OutgoingArcIterator> <a class="code" href="classutil_1_1ListGraph.html#ab63770fa993b9347586d2852b841bdc2">OutgoingArcs</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> </div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="comment">// Advanced usage. Same as OutgoingArcs(), but allows to restart the iteration</span></div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="comment">// from an already known outgoing arc of the given node.</span></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  BeginEndWrapper<OutgoingArcIterator> <a class="code" href="classutil_1_1ListGraph.html#ac52a095c1ebbd1ca89902168350bbb75">OutgoingArcsStartingFrom</a>(</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  NodeIndexType node, ArcIndexType from) <span class="keyword">const</span>;</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> </div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="comment">// This loops over the heads of the OutgoingArcs(node). It is just a more</span></div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="comment">// convenient way to achieve this. Moreover this interface is used by some</span></div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="comment">// graph algorithms.</span></div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  BeginEndWrapper<OutgoingHeadIterator> <a class="code" href="classutil_1_1ListGraph.html#a1565480b94bf179067e81d762916ed52">operator[]</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> </div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="comment">// Returns the tail/head of a valid arc.</span></div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  NodeIndexType <a class="code" href="classutil_1_1ListGraph.html#aba03f198f690155bca2ab23b039cea54">Tail</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  NodeIndexType <a class="code" href="classutil_1_1ListGraph.html#ad7d3d076d3c154d89f1eda855a34b487">Head</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span> </div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ListGraph.html#aefd885a0eba3ec33568137533190ba5b">ReserveNodes</a>(NodeIndexType bound) <span class="keyword">override</span>;</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ListGraph.html#af637e16c3c7604f0354a6fa317358a15">ReserveArcs</a>(ArcIndexType bound) <span class="keyword">override</span>;</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> </div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  std::vector<ArcIndexType> start_;</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  std::vector<ArcIndexType> next_;</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  std::vector<NodeIndexType> head_;</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  std::vector<NodeIndexType> tail_;</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> };</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> </div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> <span class="comment">// Most efficient implementation of a graph without reverse arcs:</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="comment">// - Build() needs to be called after the arc and node have been added.</span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> <span class="comment">// - The graph is really compact memory wise:</span></div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> <span class="comment">// ArcIndexType * node_capacity() + 2 * NodeIndexType * arc_capacity(),</span></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> <span class="comment">// but when Build() is called it uses a temporary extra space of</span></div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> <span class="comment">// ArcIndexType * arc_capacity().</span></div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> <span class="comment">// - The construction is really fast.</span></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> <span class="comment">//</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span> <span class="comment">// NOTE(user): if the need arises for very-well compressed graphs, we could</span></div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> <span class="comment">// shave NodeIndexType * arc_capacity() off the permanent memory requirement</span></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> <span class="comment">// with a similar class that doesn't support Tail(), i.e.</span></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> <span class="comment">// StaticGraphWithoutTail<>. This almost corresponds to a past implementation</span></div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> <span class="comment">// of StaticGraph<> @CL 116144340.</span></div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType = <span class="keywordtype">int</span>32, <span class="keyword">typename</span> ArcIndexType = <span class="keywordtype">int</span>32></div><div class="line"><a name="l00396"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph.html"> 396</a></span> <span class="keyword">class </span><a class="code" href="classutil_1_1StaticGraph.html">StaticGraph</a> : <span class="keyword">public</span> <a class="code" href="classutil_1_1BaseGraph.html">BaseGraph</a><NodeIndexType, ArcIndexType, false> {</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keyword">typedef</span> <a class="code" href="classutil_1_1BaseGraph.html">BaseGraph<NodeIndexType, ArcIndexType, false></a> <a class="code" href="classutil_1_1BaseGraph.html">Base</a>;</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a895e891d1ad52ce3efcfeb7ba11194c7">Base::arc_capacity_</a>;</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#aa980e5526b9ded17a83928fc339c71e4">Base::const_capacities_</a>;</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a424bd34a9767e7edeaf3a60ecd3cb000">Base::node_capacity_</a>;</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">Base::num_arcs_</a>;</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">Base::num_nodes_</a>;</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> </div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a2097ccda3b1ad27e2c82166979018bda">Base::IsArcValid</a>;</div><div class="line"><a name="l00406"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph.html#afe7f293d20a6f38c859af7c51ab1b105"> 406</a></span>  <a class="code" href="classutil_1_1StaticGraph.html#afe7f293d20a6f38c859af7c51ab1b105">StaticGraph</a>() : is_built_(<a class="code" href="namespaceutil.html#aadd7603ae6e78cc2490ca9710fbaf180">false</a>), arc_in_order_(true), last_tail_seen_(0) {}</div><div class="line"><a name="l00407"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph.html#abb5850c4145abf3dad76d25668368505"> 407</a></span>  <a class="code" href="classutil_1_1StaticGraph.html#abb5850c4145abf3dad76d25668368505">StaticGraph</a>(NodeIndexType <a class="code" href="classutil_1_1BaseGraph.html#a0f551c921fa0b5aaa334a6e36f61db4a">num_nodes</a>, ArcIndexType <a class="code" href="classutil_1_1BaseGraph.html#a92ffd852b2ab2e5241f9832e71a2de71">arc_capacity</a>)</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  : is_built_(<a class="code" href="namespaceutil.html#aadd7603ae6e78cc2490ca9710fbaf180">false</a>), arc_in_order_(true), last_tail_seen_(0) {</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  this-><a class="code" href="classutil_1_1BaseGraph.html#ab731ca5c638e7b1b0a2c459c94a90f55">Reserve</a>(num_nodes, <a class="code" href="classutil_1_1BaseGraph.html#a92ffd852b2ab2e5241f9832e71a2de71">arc_capacity</a>);</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  this-><a class="code" href="classutil_1_1BaseGraph.html#aa3bd051d1e141b09dda17aa9b5f24f69">FreezeCapacities</a>();</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  this-><a class="code" href="classutil_1_1StaticGraph.html#aa2a879f538b488698183a860bdb88596">AddNode</a>(num_nodes - 1);</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  }</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> </div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="comment">// Do not use directly. See instead the arc iteration functions below.</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keyword">class </span>OutgoingArcIterator;</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> </div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  NodeIndexType <a class="code" href="classutil_1_1StaticGraph.html#aefeec121033f3271585a059f0b5fbd3c">Head</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  NodeIndexType <a class="code" href="classutil_1_1StaticGraph.html#a9615f3c590e39f40ca5158bd4f37b5b4">Tail</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  ArcIndexType <a class="code" href="classutil_1_1StaticGraph.html#a7241e6e63df39df439a5ebb4fe28773e">OutDegree</a>(NodeIndexType node) <span class="keyword">const</span>; <span class="comment">// Work in O(1).</span></div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  BeginEndWrapper<OutgoingArcIterator> <a class="code" href="classutil_1_1StaticGraph.html#aa7eeb525aab90ef2bab82eb69687f600">OutgoingArcs</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  BeginEndWrapper<OutgoingArcIterator> <a class="code" href="classutil_1_1StaticGraph.html#aa6626536ee02fe83aa26ff7bbcfc8ae7">OutgoingArcsStartingFrom</a>(</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  NodeIndexType node, ArcIndexType from) <span class="keyword">const</span>;</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> </div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="comment">// This loops over the heads of the OutgoingArcs(node). It is just a more</span></div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="comment">// convenient way to achieve this. Moreover this interface is used by some</span></div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="comment">// graph algorithms.</span></div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  BeginEndWrapper<NodeIndexType const*> <a class="code" href="classutil_1_1StaticGraph.html#a160bf25732e2b1a19e8bf6d853014070">operator[]</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> </div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1StaticGraph.html#a9b1c856f35140cb8902b94374a43d368">ReserveNodes</a>(NodeIndexType bound) <span class="keyword">override</span>;</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1StaticGraph.html#a98f11aaa1013df49976fcb5433538ff5">ReserveArcs</a>(ArcIndexType bound) <span class="keyword">override</span>;</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1StaticGraph.html#aa2a879f538b488698183a860bdb88596">AddNode</a>(NodeIndexType node);</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  ArcIndexType <a class="code" href="classutil_1_1StaticGraph.html#a10d877b38553e9d2d0ce6fcfc4427df4">AddArc</a>(NodeIndexType tail, NodeIndexType head);</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> </div><div class="line"><a name="l00434"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph.html#a0b8444bcee7138b5702880a882d29283"> 434</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1StaticGraph.html#a0b8444bcee7138b5702880a882d29283">Build</a>() { <a class="code" href="classutil_1_1StaticGraph.html#a0b8444bcee7138b5702880a882d29283">Build</a>(<span class="keyword">nullptr</span>); }</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1StaticGraph.html#a0b8444bcee7138b5702880a882d29283">Build</a>(std::vector<ArcIndexType>* permutation);</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> </div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  ArcIndexType DirectArcLimit(NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  DCHECK(is_built_);</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  DCHECK(<a class="code" href="classutil_1_1BaseGraph.html#abf853acea86e01356f53055f77661770">Base::IsNodeValid</a>(node));</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordflow">return</span> node + 1 < <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">num_nodes_</a> ? start_[node + 1] : <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">num_arcs_</a>;</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  }</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> </div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keywordtype">bool</span> is_built_;</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordtype">bool</span> arc_in_order_;</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  NodeIndexType last_tail_seen_;</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  std::vector<ArcIndexType> start_;</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  std::vector<NodeIndexType> head_;</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  std::vector<NodeIndexType> tail_;</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> };</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span> </div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span> <span class="comment">// Extends the ListGraph by also storing the reverse arcs.</span></div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> <span class="comment">// This class also documents the Graph interface related to reverse arc.</span></div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span> <span class="comment">// - NodeIndexType can be unsigned, but ArcIndexType must be signed.</span></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span> <span class="comment">// - It has most of the same advantanges and disadvantages as ListGraph.</span></div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span> <span class="comment">// - It takes 2 * ArcIndexType * node_capacity()</span></div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span> <span class="comment">// + 2 * (ArcIndexType + NodeIndexType) * arc_capacity() memory.</span></div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType = <span class="keywordtype">int</span>32, <span class="keyword">typename</span> ArcIndexType = <span class="keywordtype">int</span>32></div><div class="line"><a name="l00459"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph.html"> 459</a></span> <span class="keyword">class </span><a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a></div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  : <span class="keyword">public</span> <a class="code" href="classutil_1_1BaseGraph.html">BaseGraph</a><NodeIndexType, ArcIndexType, true> {</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keyword">typedef</span> <a class="code" href="classutil_1_1BaseGraph.html">BaseGraph<NodeIndexType, ArcIndexType, true></a> <a class="code" href="classutil_1_1BaseGraph.html">Base</a>;</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a895e891d1ad52ce3efcfeb7ba11194c7">Base::arc_capacity_</a>;</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#aa980e5526b9ded17a83928fc339c71e4">Base::const_capacities_</a>;</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a424bd34a9767e7edeaf3a60ecd3cb000">Base::node_capacity_</a>;</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">Base::num_arcs_</a>;</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">Base::num_nodes_</a>;</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> </div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a2097ccda3b1ad27e2c82166979018bda">Base::IsArcValid</a>;</div><div class="line"><a name="l00470"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph.html#ac553bb63399815ac609976e5a3bd8732"> 470</a></span>  <a class="code" href="classutil_1_1ReverseArcListGraph.html#ac553bb63399815ac609976e5a3bd8732">ReverseArcListGraph</a>() {}</div><div class="line"><a name="l00471"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph.html#a885571656abd56593b2edbebb451d67f"> 471</a></span>  <a class="code" href="classutil_1_1ReverseArcListGraph.html#a885571656abd56593b2edbebb451d67f">ReverseArcListGraph</a>(NodeIndexType <a class="code" href="classutil_1_1BaseGraph.html#a0f551c921fa0b5aaa334a6e36f61db4a">num_nodes</a>, ArcIndexType <a class="code" href="classutil_1_1BaseGraph.html#a92ffd852b2ab2e5241f9832e71a2de71">arc_capacity</a>) {</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  this-><a class="code" href="classutil_1_1BaseGraph.html#ab731ca5c638e7b1b0a2c459c94a90f55">Reserve</a>(num_nodes, <a class="code" href="classutil_1_1BaseGraph.html#a92ffd852b2ab2e5241f9832e71a2de71">arc_capacity</a>);</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  this-><a class="code" href="classutil_1_1BaseGraph.html#aa3bd051d1e141b09dda17aa9b5f24f69">FreezeCapacities</a>();</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  this-><a class="code" href="classutil_1_1ReverseArcListGraph.html#aadf05a4b2729e2844c3251d82b9e862c">AddNode</a>(num_nodes - 1);</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  }</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> </div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="comment">// Returns the opposite arc of a given arc. That is the reverse arc of the</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="comment">// given forward arc or the forward arc of a given reverse arc.</span></div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  ArcIndexType <a class="code" href="classutil_1_1ReverseArcListGraph.html#aa3306c75dd28ca037205f382ac832b2a">OppositeArc</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span> </div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="comment">// Do not use directly. See instead the arc iteration functions below.</span></div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keyword">class </span>OutgoingOrOppositeIncomingArcIterator;</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keyword">class </span>OppositeIncomingArcIterator;</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keyword">class </span>IncomingArcIterator;</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="keyword">class </span>OutgoingArcIterator;</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="keyword">class </span>OutgoingHeadIterator;</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span> </div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="comment">// ReverseArcListGraph<>::OutDegree() and ::InDegree() work in O(degree).</span></div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  ArcIndexType <a class="code" href="classutil_1_1ReverseArcListGraph.html#ad25429b667ebd6e2ac662b76f3e02eae">OutDegree</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  ArcIndexType <a class="code" href="classutil_1_1ReverseArcListGraph.html#aeffdaa7d0a6c7b6355ee1dab33524961">InDegree</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span> </div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="comment">// Arc iterations functions over the arcs touching a node (see the top-level</span></div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="comment">// comment for the different types). To be used as follows:</span></div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="comment">// for (const Graph::ArcIndex arc : IterationFunction(node)) { ... }</span></div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="comment">//</span></div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="comment">// The StartingFrom() version are similar, but restart the iteration from a</span></div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="comment">// given arc position (which must be valid in the iteration context).</span></div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  BeginEndWrapper<OutgoingArcIterator> <a class="code" href="classutil_1_1ReverseArcListGraph.html#ac8923133838003d7a7ffb4500f0d4ffa">OutgoingArcs</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  BeginEndWrapper<IncomingArcIterator> <a class="code" href="classutil_1_1ReverseArcListGraph.html#ad0e7957e515d9c50f931c00166d099ce">IncomingArcs</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  BeginEndWrapper<OutgoingOrOppositeIncomingArcIterator></div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <a class="code" href="classutil_1_1ReverseArcListGraph.html#a104172ed25aa4cea18cd3a5c2187d4c7">OutgoingOrOppositeIncomingArcs</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  BeginEndWrapper<OppositeIncomingArcIterator> <a class="code" href="classutil_1_1ReverseArcListGraph.html#a3cd1d1d0e50aaa2f30817db44cca8881">OppositeIncomingArcs</a>(</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  BeginEndWrapper<OutgoingArcIterator> <a class="code" href="classutil_1_1ReverseArcListGraph.html#a60d3a435f90e2c963047cc6d8c6ad363">OutgoingArcsStartingFrom</a>(</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  NodeIndexType node, ArcIndexType from) <span class="keyword">const</span>;</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  BeginEndWrapper<IncomingArcIterator> <a class="code" href="classutil_1_1ReverseArcListGraph.html#a1a89c1efcf87cce6cec110126eb05641">IncomingArcsStartingFrom</a>(</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  NodeIndexType node, ArcIndexType from) <span class="keyword">const</span>;</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  BeginEndWrapper<OutgoingOrOppositeIncomingArcIterator></div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <a class="code" href="classutil_1_1ReverseArcListGraph.html#a96a609a53497ca38517dba5c277c7798">OutgoingOrOppositeIncomingArcsStartingFrom</a>(NodeIndexType node,</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  ArcIndexType from) <span class="keyword">const</span>;</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  BeginEndWrapper<OppositeIncomingArcIterator> <a class="code" href="classutil_1_1ReverseArcListGraph.html#a1e345c79e59f71e088f4876be93a903d">OppositeIncomingArcsStartingFrom</a>(</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  NodeIndexType node, ArcIndexType from) <span class="keyword">const</span>;</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span> </div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="comment">// This loops over the heads of the OutgoingArcs(node). It is just a more</span></div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="comment">// convenient way to achieve this. Moreover this interface is used by some</span></div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="comment">// graph algorithms.</span></div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  BeginEndWrapper<OutgoingHeadIterator> <a class="code" href="classutil_1_1ReverseArcListGraph.html#a28d6f97b2135e9d51bad632c2556fa56">operator[]</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span> </div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  NodeIndexType <a class="code" href="classutil_1_1ReverseArcListGraph.html#a2fdb48f771da93712d9386c60615cf04">Head</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  NodeIndexType <a class="code" href="classutil_1_1ReverseArcListGraph.html#ac7b475304d3677d4a29c676e64c3e09c">Tail</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span> </div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html#ae7734e3c4b1930b2859b4813bf6e238b">ReserveNodes</a>(NodeIndexType bound) <span class="keyword">override</span>;</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html#a6409e1c967f2062aa83b4bde26a931f1">ReserveArcs</a>(ArcIndexType bound) <span class="keyword">override</span>;</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html#aadf05a4b2729e2844c3251d82b9e862c">AddNode</a>(NodeIndexType node);</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  ArcIndexType <a class="code" href="classutil_1_1ReverseArcListGraph.html#a79291a548af693328d0e4e8f64cdc745">AddArc</a>(NodeIndexType tail, NodeIndexType head);</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> </div><div class="line"><a name="l00527"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph.html#a25d91ab3a2ced7900dd2f5cbcf1ed587"> 527</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html#a25d91ab3a2ced7900dd2f5cbcf1ed587">Build</a>() { <a class="code" href="classutil_1_1ReverseArcListGraph.html#a25d91ab3a2ced7900dd2f5cbcf1ed587">Build</a>(<span class="keyword">nullptr</span>); }</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html#a25d91ab3a2ced7900dd2f5cbcf1ed587">Build</a>(std::vector<ArcIndexType>* permutation);</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> </div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  std::vector<ArcIndexType> start_;</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  std::vector<ArcIndexType> reverse_start_;</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <a class="code" href="classutil_1_1SVector.html">SVector<ArcIndexType></a> next_;</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <a class="code" href="classutil_1_1SVector.html">SVector<NodeIndexType></a> head_;</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span> };</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span> </div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span> <span class="comment">// StaticGraph with reverse arc.</span></div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span> <span class="comment">// - NodeIndexType can be unsigned, but ArcIndexType must be signed.</span></div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> <span class="comment">// - It has most of the same advantanges and disadvantages as StaticGraph.</span></div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span> <span class="comment">// - It takes 2 * ArcIndexType * node_capacity()</span></div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="comment">// + 2 * (ArcIndexType + NodeIndexType) * arc_capacity() memory.</span></div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span> <span class="comment">// - If the ArcIndexPermutation is needed, then an extra ArcIndexType *</span></div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span> <span class="comment">// arc_capacity() is needed for it.</span></div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> <span class="comment">// - The reverse arcs from a node are sorted by head (so we could add a log()</span></div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span> <span class="comment">// time lookup function).</span></div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType = <span class="keywordtype">int</span>32, <span class="keyword">typename</span> ArcIndexType = <span class="keywordtype">int</span>32></div><div class="line"><a name="l00547"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph.html"> 547</a></span> <span class="keyword">class </span><a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a></div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  : <span class="keyword">public</span> <a class="code" href="classutil_1_1BaseGraph.html">BaseGraph</a><NodeIndexType, ArcIndexType, true> {</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keyword">typedef</span> <a class="code" href="classutil_1_1BaseGraph.html">BaseGraph<NodeIndexType, ArcIndexType, true></a> <a class="code" href="classutil_1_1BaseGraph.html">Base</a>;</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a895e891d1ad52ce3efcfeb7ba11194c7">Base::arc_capacity_</a>;</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#aa980e5526b9ded17a83928fc339c71e4">Base::const_capacities_</a>;</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a424bd34a9767e7edeaf3a60ecd3cb000">Base::node_capacity_</a>;</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">Base::num_arcs_</a>;</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">Base::num_nodes_</a>;</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span> </div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a2097ccda3b1ad27e2c82166979018bda">Base::IsArcValid</a>;</div><div class="line"><a name="l00558"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph.html#a98bf967d563272b62a207d179aae5973"> 558</a></span>  <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a98bf967d563272b62a207d179aae5973">ReverseArcStaticGraph</a>() : is_built_(<a class="code" href="namespaceutil.html#aadd7603ae6e78cc2490ca9710fbaf180">false</a>) {}</div><div class="line"><a name="l00559"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph.html#ac9b88c60dccd3b6aafa96df2de557a23"> 559</a></span>  <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#ac9b88c60dccd3b6aafa96df2de557a23">ReverseArcStaticGraph</a>(NodeIndexType <a class="code" href="classutil_1_1BaseGraph.html#a0f551c921fa0b5aaa334a6e36f61db4a">num_nodes</a>, ArcIndexType <a class="code" href="classutil_1_1BaseGraph.html#a92ffd852b2ab2e5241f9832e71a2de71">arc_capacity</a>)</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  : is_built_(<a class="code" href="namespaceutil.html#aadd7603ae6e78cc2490ca9710fbaf180">false</a>) {</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  this-><a class="code" href="classutil_1_1BaseGraph.html#ab731ca5c638e7b1b0a2c459c94a90f55">Reserve</a>(num_nodes, <a class="code" href="classutil_1_1BaseGraph.html#a92ffd852b2ab2e5241f9832e71a2de71">arc_capacity</a>);</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  this-><a class="code" href="classutil_1_1BaseGraph.html#aa3bd051d1e141b09dda17aa9b5f24f69">FreezeCapacities</a>();</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  this-><a class="code" href="classutil_1_1ReverseArcStaticGraph.html#af83383a45904db07bed45418199ff2dc">AddNode</a>(num_nodes - 1);</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  }</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span> </div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="comment">// Deprecated.</span></div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keyword">class </span>OutgoingOrOppositeIncomingArcIterator;</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keyword">class </span>OppositeIncomingArcIterator;</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keyword">class </span>IncomingArcIterator;</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="keyword">class </span>OutgoingArcIterator;</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span> </div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="comment">// ReverseArcStaticGraph<>::OutDegree() and ::InDegree() work in O(1).</span></div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  ArcIndexType <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#aa9ec825f0a93d13a5c93e82b42cc1088">OutDegree</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  ArcIndexType <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#aacb8fc16527ae0e30a874393a94cd8ee">InDegree</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span> </div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  BeginEndWrapper<OutgoingArcIterator> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#af7ab2d9151c0b94ecb6569a369ce00b5">OutgoingArcs</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  BeginEndWrapper<IncomingArcIterator> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a53ad65ff7f20bd4a6fb2494ed6dd2490">IncomingArcs</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  BeginEndWrapper<OutgoingOrOppositeIncomingArcIterator></div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a383413966b4ee3790931137c44916bd3">OutgoingOrOppositeIncomingArcs</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  BeginEndWrapper<OppositeIncomingArcIterator> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a1708f7e290d33a29936556e7453a5092">OppositeIncomingArcs</a>(</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  BeginEndWrapper<OutgoingArcIterator> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a50115c615a3af5b9d50afc51a75541c3">OutgoingArcsStartingFrom</a>(</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  NodeIndexType node, ArcIndexType from) <span class="keyword">const</span>;</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  BeginEndWrapper<IncomingArcIterator> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#aa040d7a9d3e8af80b21f9ee07f6bae34">IncomingArcsStartingFrom</a>(</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  NodeIndexType node, ArcIndexType from) <span class="keyword">const</span>;</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  BeginEndWrapper<OutgoingOrOppositeIncomingArcIterator></div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a61603e21e903115daf755e297bf652bb">OutgoingOrOppositeIncomingArcsStartingFrom</a>(NodeIndexType node,</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  ArcIndexType from) <span class="keyword">const</span>;</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  BeginEndWrapper<OppositeIncomingArcIterator> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a486c54240d6d491740aac1a4bd574f48">OppositeIncomingArcsStartingFrom</a>(</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  NodeIndexType node, ArcIndexType from) <span class="keyword">const</span>;</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span> </div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="comment">// This loops over the heads of the OutgoingArcs(node). It is just a more</span></div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="comment">// convenient way to achieve this. Moreover this interface is used by some</span></div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="comment">// graph algorithms.</span></div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  BeginEndWrapper<NodeIndexType const*> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a0ff94f595442b19c2de253a2685fe27f">operator[]</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span> </div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  ArcIndexType <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a2f8dc1bf8f2242b19aacc876301365a6">OppositeArc</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="comment">// TODO(user): support Head() and Tail() before Build(), like StaticGraph<>.</span></div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  NodeIndexType <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a72e8ed03fe3f8ff27d156622a86900aa">Head</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  NodeIndexType <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a12cf8d1312236cac409d9a1a934c1ad3">Tail</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span> </div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a950e85c43ad31af8dd24a15e895c77c7">ReserveArcs</a>(ArcIndexType bound) <span class="keyword">override</span>;</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#af83383a45904db07bed45418199ff2dc">AddNode</a>(NodeIndexType node);</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  ArcIndexType <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a0b801f8cece53ce666b90be4a8b76ae6">AddArc</a>(NodeIndexType tail, NodeIndexType head);</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span> </div><div class="line"><a name="l00606"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph.html#a485803d141f9c80beaaae7094548d672"> 606</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a485803d141f9c80beaaae7094548d672">Build</a>() { <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a485803d141f9c80beaaae7094548d672">Build</a>(<span class="keyword">nullptr</span>); }</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a485803d141f9c80beaaae7094548d672">Build</a>(std::vector<ArcIndexType>* permutation);</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span> </div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  ArcIndexType DirectArcLimit(NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  DCHECK(is_built_);</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  DCHECK(<a class="code" href="classutil_1_1BaseGraph.html#abf853acea86e01356f53055f77661770">Base::IsNodeValid</a>(node));</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="keywordflow">return</span> node + 1 < <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">num_nodes_</a> ? start_[node + 1] : <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">num_arcs_</a>;</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  }</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  ArcIndexType ReverseArcLimit(NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  DCHECK(is_built_);</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  DCHECK(<a class="code" href="classutil_1_1BaseGraph.html#abf853acea86e01356f53055f77661770">Base::IsNodeValid</a>(node));</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="keywordflow">return</span> node + 1 < <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">num_nodes_</a> ? reverse_start_[node + 1] : 0;</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  }</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span> </div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="keywordtype">bool</span> is_built_;</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  std::vector<ArcIndexType> start_;</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  std::vector<ArcIndexType> reverse_start_;</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  SVector<NodeIndexType> head_;</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  SVector<ArcIndexType> opposite_;</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span> };</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span> </div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span> <span class="comment">// This graph is a mix between the ReverseArcListGraph and the</span></div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span> <span class="comment">// ReverseArcStaticGraph. It uses less memory:</span></div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span> <span class="comment">// - It takes 2 * ArcIndexType * node_capacity()</span></div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span> <span class="comment">// + (2 * NodeIndexType + ArcIndexType) * arc_capacity() memory.</span></div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span> <span class="comment">// - If the ArcIndexPermutation is needed, then an extra ArcIndexType *</span></div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span> <span class="comment">// arc_capacity() is needed for it.</span></div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType = <span class="keywordtype">int</span>32, <span class="keyword">typename</span> ArcIndexType = <span class="keywordtype">int</span>32></div><div class="line"><a name="l00635"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph.html"> 635</a></span> <span class="keyword">class </span><a class="code" href="classutil_1_1ReverseArcMixedGraph.html">ReverseArcMixedGraph</a></div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  : <span class="keyword">public</span> <a class="code" href="classutil_1_1BaseGraph.html">BaseGraph</a><NodeIndexType, ArcIndexType, true> {</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keyword">typedef</span> <a class="code" href="classutil_1_1BaseGraph.html">BaseGraph<NodeIndexType, ArcIndexType, true></a> <a class="code" href="classutil_1_1BaseGraph.html">Base</a>;</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a895e891d1ad52ce3efcfeb7ba11194c7">Base::arc_capacity_</a>;</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#aa980e5526b9ded17a83928fc339c71e4">Base::const_capacities_</a>;</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a424bd34a9767e7edeaf3a60ecd3cb000">Base::node_capacity_</a>;</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">Base::num_arcs_</a>;</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">Base::num_nodes_</a>;</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span> </div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a2097ccda3b1ad27e2c82166979018bda">Base::IsArcValid</a>;</div><div class="line"><a name="l00646"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph.html#af10d16de8964a7abf555759bb9f257aa"> 646</a></span>  <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#af10d16de8964a7abf555759bb9f257aa">ReverseArcMixedGraph</a>() : is_built_(<a class="code" href="namespaceutil.html#aadd7603ae6e78cc2490ca9710fbaf180">false</a>) {}</div><div class="line"><a name="l00647"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph.html#a6735921f3354efcf696ad98e4cf7c2c1"> 647</a></span>  <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a6735921f3354efcf696ad98e4cf7c2c1">ReverseArcMixedGraph</a>(NodeIndexType <a class="code" href="classutil_1_1BaseGraph.html#a0f551c921fa0b5aaa334a6e36f61db4a">num_nodes</a>, ArcIndexType <a class="code" href="classutil_1_1BaseGraph.html#a92ffd852b2ab2e5241f9832e71a2de71">arc_capacity</a>)</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  : is_built_(<a class="code" href="namespaceutil.html#aadd7603ae6e78cc2490ca9710fbaf180">false</a>) {</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  this-><a class="code" href="classutil_1_1BaseGraph.html#ab731ca5c638e7b1b0a2c459c94a90f55">Reserve</a>(num_nodes, <a class="code" href="classutil_1_1BaseGraph.html#a92ffd852b2ab2e5241f9832e71a2de71">arc_capacity</a>);</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  this-><a class="code" href="classutil_1_1BaseGraph.html#aa3bd051d1e141b09dda17aa9b5f24f69">FreezeCapacities</a>();</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  this-><a class="code" href="classutil_1_1ReverseArcMixedGraph.html#aab290c8728947d80dbf9fec6e320c3d1">AddNode</a>(num_nodes - 1);</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  }</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span> </div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="comment">// Deprecated.</span></div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keyword">class </span>OutgoingOrOppositeIncomingArcIterator;</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="keyword">class </span>OppositeIncomingArcIterator;</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="keyword">class </span>IncomingArcIterator;</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keyword">class </span>OutgoingArcIterator;</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span> </div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  ArcIndexType <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#addeb94680d05c79b1be501edc5823209">OutDegree</a>(NodeIndexType node) <span class="keyword">const</span>; <span class="comment">// O(1)</span></div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  ArcIndexType <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#ae5ea8fcc78ca9b142e07665d447ad2bd">InDegree</a>(NodeIndexType node) <span class="keyword">const</span>; <span class="comment">// O(in-degree)</span></div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span> </div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  BeginEndWrapper<OutgoingArcIterator> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a6e39d187175616e99c958a81bcd1831f">OutgoingArcs</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  BeginEndWrapper<IncomingArcIterator> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a4923ba6abf7a599e833becfa82750a86">IncomingArcs</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  BeginEndWrapper<OutgoingOrOppositeIncomingArcIterator></div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a9cdfbde174efbc5747d58330dbd85e86">OutgoingOrOppositeIncomingArcs</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  BeginEndWrapper<OppositeIncomingArcIterator> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a2e920761999c90a1b266b96d609d8464">OppositeIncomingArcs</a>(</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  BeginEndWrapper<OutgoingArcIterator> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a41eeddd2d42998985b295d05fc04439e">OutgoingArcsStartingFrom</a>(</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  NodeIndexType node, ArcIndexType from) <span class="keyword">const</span>;</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  BeginEndWrapper<IncomingArcIterator> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#ac3108bd8dd239c6adb32b30c16c5fc70">IncomingArcsStartingFrom</a>(</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  NodeIndexType node, ArcIndexType from) <span class="keyword">const</span>;</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  BeginEndWrapper<OutgoingOrOppositeIncomingArcIterator></div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a09e6c29120c6f7f0a84fb4c02af0f0ee">OutgoingOrOppositeIncomingArcsStartingFrom</a>(NodeIndexType node,</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  ArcIndexType from) <span class="keyword">const</span>;</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  BeginEndWrapper<OppositeIncomingArcIterator> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#ae53769b81e0791bccfdf1187d4fcf7f6">OppositeIncomingArcsStartingFrom</a>(</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  NodeIndexType node, ArcIndexType from) <span class="keyword">const</span>;</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span> </div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="comment">// This loops over the heads of the OutgoingArcs(node). It is just a more</span></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="comment">// convenient way to achieve this. Moreover this interface is used by some</span></div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="comment">// graph algorithms.</span></div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  BeginEndWrapper<NodeIndexType const*> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#aff7c6ef395dfc941edac13b29e154b54">operator[]</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span> </div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  ArcIndexType <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a86effffe3928593a808edf548dd6b832">OppositeArc</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="comment">// TODO(user): support Head() and Tail() before Build(), like StaticGraph<>.</span></div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  NodeIndexType <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a5ebe11f2abcd78ad1f5606e27d1688bb">Head</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  NodeIndexType <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a351cbc3c0c79e22f010e697bf65d7100">Tail</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span> </div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#ad39d8df784046ecfb6192ac0a0b5da44">ReserveArcs</a>(ArcIndexType bound) <span class="keyword">override</span>;</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#aab290c8728947d80dbf9fec6e320c3d1">AddNode</a>(NodeIndexType node);</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  ArcIndexType <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a362fa49b586ff223477aab7a53d17f14">AddArc</a>(NodeIndexType tail, NodeIndexType head);</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span> </div><div class="line"><a name="l00693"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph.html#a06e56a529396bbd2595f5c32c2f73142"> 693</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a06e56a529396bbd2595f5c32c2f73142">Build</a>() { <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a06e56a529396bbd2595f5c32c2f73142">Build</a>(<span class="keyword">nullptr</span>); }</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a06e56a529396bbd2595f5c32c2f73142">Build</a>(std::vector<ArcIndexType>* permutation);</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span> </div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  ArcIndexType DirectArcLimit(NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  DCHECK(is_built_);</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  DCHECK(<a class="code" href="classutil_1_1BaseGraph.html#abf853acea86e01356f53055f77661770">Base::IsNodeValid</a>(node));</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="keywordflow">return</span> node + 1 < <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">num_nodes_</a> ? start_[node + 1] : <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">num_arcs_</a>;</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  }</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span> </div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keywordtype">bool</span> is_built_;</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  std::vector<ArcIndexType> start_;</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  std::vector<ArcIndexType> reverse_start_;</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  std::vector<ArcIndexType> next_;</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  SVector<NodeIndexType> head_;</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span> };</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span> </div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span> <span class="comment">// Permutes the elements of array_to_permute: element #i will be moved to</span></div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span> <span class="comment">// position permutation[i]. permutation must be either empty (in which case</span></div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span> <span class="comment">// nothing happens), or a permutation of [0, permutation.size()).</span></div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span> <span class="comment">//</span></div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span> <span class="comment">// The algorithm is fast but need extra memory for a copy of the permuted part</span></div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span> <span class="comment">// of array_to_permute.</span></div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span> <span class="comment">//</span></div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span> <span class="comment">// TODO(user): consider slower but more memory efficient implementations that</span></div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span> <span class="comment">// follow the cycles of the permutation and use a bitmap to indicate what has</span></div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span> <span class="comment">// been permuted or to mark the beginning of each cycle.</span></div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span> </div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span> <span class="comment">// Some compiler do not know typeof(), so we have to use this extra function</span></div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span> <span class="comment">// internally.</span></div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span> <span class="keyword">template</span> <<span class="keyword">class</span> IntVector, <span class="keyword">class</span> Array, <span class="keyword">class</span> ElementType></div><div class="line"><a name="l00724"></a><span class="lineno"><a class="line" href="namespaceutil.html#a9470623ca7db3c4a62ce3b326c6b07d8"> 724</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceutil.html#a9470623ca7db3c4a62ce3b326c6b07d8">PermuteWithExplicitElementType</a>(<span class="keyword">const</span> IntVector& permutation,</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  Array* array_to_permute,</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  ElementType unused) {</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  std::vector<ElementType> temp(permutation.size());</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < permutation.size(); ++i) {</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  temp[i] = (*array_to_permute)[i];</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  }</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < permutation.size(); ++i) {</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  (*array_to_permute)[permutation[i]] = temp[i];</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  }</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span> }</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span> </div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span> <span class="keyword">template</span> <<span class="keyword">class</span> IntVector, <span class="keyword">class</span> Array></div><div class="line"><a name="l00737"></a><span class="lineno"><a class="line" href="namespaceutil.html#a8c227a057c1ce9d46b1185abf77ad91e"> 737</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceutil.html#a8c227a057c1ce9d46b1185abf77ad91e">Permute</a>(<span class="keyword">const</span> IntVector& permutation, Array* array_to_permute) {</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="keywordflow">if</span> (permutation.empty()) {</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  }</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <a class="code" href="namespaceutil.html#a9470623ca7db3c4a62ce3b326c6b07d8">PermuteWithExplicitElementType</a>(permutation, array_to_permute,</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  (*array_to_permute)[0]);</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span> }</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span> </div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span> <span class="comment">// We need a specialization for std::vector<bool>, because the default code uses</span></div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span> <span class="comment">// (*array_to_permute)[0] as ElementType, which isn't 'bool' in that case.</span></div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span> <span class="keyword">template</span> <<span class="keyword">class</span> IntVector></div><div class="line"><a name="l00748"></a><span class="lineno"><a class="line" href="namespaceutil.html#ac497881c4166bc694adc4bee62746118"> 748</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceutil.html#a8c227a057c1ce9d46b1185abf77ad91e">Permute</a>(<span class="keyword">const</span> IntVector& permutation,</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  std::vector<bool>* array_to_permute) {</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="keywordflow">if</span> (permutation.empty()) {</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  }</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <span class="keywordtype">bool</span> unused = <span class="keyword">false</span>;</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <a class="code" href="namespaceutil.html#a9470623ca7db3c4a62ce3b326c6b07d8">PermuteWithExplicitElementType</a>(permutation, array_to_permute, unused);</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span> }</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span> </div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span> <span class="comment">// A vector-like class where valid indices are in [- size_, size_) and reserved</span></div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span> <span class="comment">// indices for future growth are in [- capacity_, capacity_). It is used to hold</span></div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span> <span class="comment">// arc related information for graphs with reverse arcs.</span></div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span> <span class="comment">// It supports only up to 2^31-1 elements, for compactness. If you ever need</span></div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span> <span class="comment">// more, consider using templates for the size/capacity integer types.</span></div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span> <span class="comment">//</span></div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span> <span class="comment">// Sample usage:</span></div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span> <span class="comment">//</span></div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span> <span class="comment">// SVector<int> v;</span></div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span> <span class="comment">// v.grow(left_value, right_value);</span></div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span> <span class="comment">// v.resize(10);</span></div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span> <span class="comment">// v.clear();</span></div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span> <span class="comment">// v.swap(new_v);</span></div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span> <span class="comment">// std:swap(v[i], v[~i]);</span></div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span> <span class="keyword">class </span>SVector {</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00774"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#ac342b96ebd12c4cc505567c0d5342fd6"> 774</a></span>  <a class="code" href="classutil_1_1SVector.html#ac342b96ebd12c4cc505567c0d5342fd6">SVector</a>() : base_(nullptr), size_(0), capacity_(0) {}</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span> </div><div class="line"><a name="l00776"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#aa05f6afa9ff06e13079eff039632f0cb"> 776</a></span>  <a class="code" href="classutil_1_1SVector.html#aa05f6afa9ff06e13079eff039632f0cb">~SVector</a>() { <a class="code" href="classutil_1_1SVector.html#a36d88784d1f797dcf76845c47d74a4da">clear_and_dealloc</a>(); }</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span> </div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="comment">// Copy constructor and assignment operator.</span></div><div class="line"><a name="l00779"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#a4ca50715f87be0dd9925dd46e2810436"> 779</a></span>  <a class="code" href="classutil_1_1SVector.html#a4ca50715f87be0dd9925dd46e2810436">SVector</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1SVector.html">SVector</a>& other) : <a class="code" href="classutil_1_1SVector.html">SVector</a>() { *<span class="keyword">this</span> = other; }</div><div class="line"><a name="l00780"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#afc485e5858e15ce8ec376ca7640ede1e"> 780</a></span>  <a class="code" href="classutil_1_1SVector.html">SVector</a>& <a class="code" href="classutil_1_1SVector.html#afc485e5858e15ce8ec376ca7640ede1e">operator=</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1SVector.html">SVector</a>& other) {</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <span class="keywordflow">if</span> (capacity_ < other.size_) {</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <a class="code" href="classutil_1_1SVector.html#a36d88784d1f797dcf76845c47d74a4da">clear_and_dealloc</a>();</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="comment">// NOTE(user): Alternatively, our capacity could inherit from the other</span></div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="comment">// vector's capacity, which can be (much) greater than its size.</span></div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  capacity_ = other.size_;</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  base_ = static_cast<T*>(malloc(2LL * capacity_ * <span class="keyword">sizeof</span>(T)));</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  CHECK(base_ != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  base_ += capacity_;</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  } <span class="keywordflow">else</span> { <span class="comment">// capacity_ >= other.size</span></div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <a class="code" href="classutil_1_1SVector.html#a06ed1003be01209763bb15e923399fc7">clear</a>();</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  }</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="comment">// Perform the actual copy of the payload.</span></div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  size_ = other.size_;</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = -size_; i < size_; ++i) {</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keyword">new</span> (base_ + i) T(other.base_[i]);</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  }</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  }</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span> </div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="comment">// Move constructor and move assignment operator.</span></div><div class="line"><a name="l00801"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#abba34108f60eb020d0cc94ea8bd24c8f"> 801</a></span>  <a class="code" href="classutil_1_1SVector.html#abba34108f60eb020d0cc94ea8bd24c8f">SVector</a>(<a class="code" href="classutil_1_1SVector.html">SVector</a>&& other) : <a class="code" href="classutil_1_1SVector.html">SVector</a>() { <a class="code" href="classutil_1_1SVector.html#acee1cc8d243acbdad8d30f97c5d54a5f">swap</a>(other); }</div><div class="line"><a name="l00802"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#a9e1927755201f418ac04ac1ad4b4660d"> 802</a></span>  <a class="code" href="classutil_1_1SVector.html">SVector</a>& <a class="code" href="classutil_1_1SVector.html#a9e1927755201f418ac04ac1ad4b4660d">operator=</a>(<a class="code" href="classutil_1_1SVector.html">SVector</a>&& other) {</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="comment">// NOTE(user): We could just swap() and let the other's destruction take</span></div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="comment">// care of the clean-up, but it is probably less bug-prone to perform the</span></div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="comment">// destruction immediately.</span></div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <a class="code" href="classutil_1_1SVector.html#a36d88784d1f797dcf76845c47d74a4da">clear_and_dealloc</a>();</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <a class="code" href="classutil_1_1SVector.html#acee1cc8d243acbdad8d30f97c5d54a5f">swap</a>(other);</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  }</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span> </div><div class="line"><a name="l00811"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#a6270e7d8614fca867c7f935b7a3e9cd3"> 811</a></span>  T& <a class="code" href="classutil_1_1SVector.html#a6270e7d8614fca867c7f935b7a3e9cd3">operator[]</a>(<span class="keywordtype">int</span> n) {</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  DCHECK_LT(n, size_);</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  DCHECK_GE(n, -size_);</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="keywordflow">return</span> base_[n];</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  }</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span> </div><div class="line"><a name="l00817"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#a01c346b7779b313b6ff1099a10946ed0"> 817</a></span>  <span class="keyword">const</span> T& <a class="code" href="classutil_1_1SVector.html#a01c346b7779b313b6ff1099a10946ed0">operator[]</a>(<span class="keywordtype">int</span> n)<span class="keyword"> const </span>{</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  DCHECK_LT(n, size_);</div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  DCHECK_GE(n, -size_);</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="keywordflow">return</span> base_[n];</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  }</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span> </div><div class="line"><a name="l00823"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#af0059304ee5c601207e97b1c742d5e84"> 823</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1SVector.html#af0059304ee5c601207e97b1c742d5e84">resize</a>(<span class="keywordtype">int</span> n) {</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <a class="code" href="classutil_1_1SVector.html#a287f9791ba2e68e137d53fc038bbe432">reserve</a>(n);</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = -n; i < -size_; ++i) {</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <span class="keyword">new</span> (base_ + i) T();</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  }</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = size_; i < n; ++i) {</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <span class="keyword">new</span> (base_ + i) T();</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  }</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = -size_; i < -n; ++i) {</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  base_[i].~T();</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  }</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = n; i < size_; ++i) {</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  base_[i].~T();</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  }</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  size_ = n;</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  }</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span> </div><div class="line"><a name="l00840"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#a06ed1003be01209763bb15e923399fc7"> 840</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1SVector.html#a06ed1003be01209763bb15e923399fc7">clear</a>() { <a class="code" href="classutil_1_1SVector.html#af0059304ee5c601207e97b1c742d5e84">resize</a>(0); }</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span> </div><div class="line"><a name="l00842"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#a25fc0f822d7e2a5eedab230ed56be07f"> 842</a></span>  T* <a class="code" href="classutil_1_1SVector.html#a25fc0f822d7e2a5eedab230ed56be07f">data</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> base_; }</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span> </div><div class="line"><a name="l00844"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#acee1cc8d243acbdad8d30f97c5d54a5f"> 844</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1SVector.html#acee1cc8d243acbdad8d30f97c5d54a5f">swap</a>(<a class="code" href="classutil_1_1SVector.html">SVector<T></a>& x) {</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  std::swap(base_, x.base_);</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  std::swap(size_, x.size_);</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  std::swap(capacity_, x.capacity_);</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  }</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span> </div><div class="line"><a name="l00850"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#a287f9791ba2e68e137d53fc038bbe432"> 850</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1SVector.html#a287f9791ba2e68e137d53fc038bbe432">reserve</a>(<span class="keywordtype">int</span> n) {</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  DCHECK_GE(n, 0);</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  DCHECK_LE(n, <a class="code" href="classutil_1_1SVector.html#add718a46fe9ba1db673f69b2c02ec2a2">max_size</a>());</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="keywordflow">if</span> (n > capacity_) {</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> new_capacity = std::min(n, <a class="code" href="classutil_1_1SVector.html#add718a46fe9ba1db673f69b2c02ec2a2">max_size</a>());</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  T* new_storage = static_cast<T*>(malloc(2LL * new_capacity * <span class="keyword">sizeof</span>(T)));</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  CHECK(new_storage != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  T* new_base = new_storage + new_capacity;</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="comment">// TODO(user): in C++17 we could use std::uninitialized_move instead</span></div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="comment">// of this loop.</span></div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = -size_; i < size_; ++i) {</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keyword">new</span> (new_base + i) T(std::move(base_[i]));</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  }</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <span class="keywordtype">int</span> saved_size = size_;</div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <a class="code" href="classutil_1_1SVector.html#a36d88784d1f797dcf76845c47d74a4da">clear_and_dealloc</a>();</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  size_ = saved_size;</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  base_ = new_base;</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  capacity_ = new_capacity;</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  }</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  }</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span> </div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <span class="comment">// NOTE(user): This doesn't currently support movable-only objects, but we</span></div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="comment">// could fix that.</span></div><div class="line"><a name="l00873"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#ac34dbebcbd795b04b51dbfd96292d671"> 873</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1SVector.html#ac34dbebcbd795b04b51dbfd96292d671">grow</a>(<span class="keyword">const</span> T& left = T(), <span class="keyword">const</span> T& right = T()) {</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <span class="keywordflow">if</span> (size_ == capacity_) {</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="comment">// We have to copy the elements because they are allowed to be element of</span></div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="comment">// *this.</span></div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  T left_copy(left); <span class="comment">// NOLINT</span></div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  T right_copy(right); <span class="comment">// NOLINT</span></div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <a class="code" href="classutil_1_1SVector.html#a287f9791ba2e68e137d53fc038bbe432">reserve</a>(NewCapacity(1));</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keyword">new</span> (base_ + size_) T(right_copy);</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="keyword">new</span> (base_ - size_ - 1) T(left_copy);</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  ++size_;</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <span class="keyword">new</span> (base_ + size_) T(right);</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="keyword">new</span> (base_ - size_ - 1) T(left);</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  ++size_;</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  }</div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  }</div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span> </div><div class="line"><a name="l00890"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#afaad0723c70ab98c88d4a0441e1f98e4"> 890</a></span>  <span class="keywordtype">int</span> <a class="code" href="classutil_1_1SVector.html#afaad0723c70ab98c88d4a0441e1f98e4">size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> size_; }</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span> </div><div class="line"><a name="l00892"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#a5d3d8b4f10e9d40e85fbd54d04c33611"> 892</a></span>  <span class="keywordtype">int</span> <a class="code" href="classutil_1_1SVector.html#a5d3d8b4f10e9d40e85fbd54d04c33611">capacity</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> capacity_; }</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span> </div><div class="line"><a name="l00894"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#add718a46fe9ba1db673f69b2c02ec2a2"> 894</a></span>  <span class="keywordtype">int</span> <a class="code" href="classutil_1_1SVector.html#add718a46fe9ba1db673f69b2c02ec2a2">max_size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> std::numeric_limits<int>::max(); }</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span> </div><div class="line"><a name="l00896"></a><span class="lineno"><a class="line" href="classutil_1_1SVector.html#a36d88784d1f797dcf76845c47d74a4da"> 896</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1SVector.html#a36d88784d1f797dcf76845c47d74a4da">clear_and_dealloc</a>() {</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keywordflow">if</span> (base_ == <span class="keyword">nullptr</span>) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <a class="code" href="classutil_1_1SVector.html#a06ed1003be01209763bb15e923399fc7">clear</a>();</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <span class="keywordflow">if</span> (capacity_ > 0) {</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  free(base_ - capacity_);</div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  }</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  capacity_ = 0;</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  base_ = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  }</div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span> </div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  <span class="keywordtype">int</span> NewCapacity(<span class="keywordtype">int</span> delta) {</div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  <span class="comment">// TODO(user): check validity.</span></div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="keywordtype">double</span> candidate = 1.3 * static_cast<double>(capacity_);</div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="keywordflow">if</span> (candidate > static_cast<double>(<a class="code" href="classutil_1_1SVector.html#add718a46fe9ba1db673f69b2c02ec2a2">max_size</a>())) {</div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  candidate = static_cast<double>(<a class="code" href="classutil_1_1SVector.html#add718a46fe9ba1db673f69b2c02ec2a2">max_size</a>());</div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  }</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="keywordtype">int</span> new_capacity = static_cast<int>(candidate);</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keywordflow">if</span> (new_capacity > capacity_ + delta) {</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="keywordflow">return</span> new_capacity;</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  }</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keywordflow">return</span> capacity_ + delta;</div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  }</div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span> </div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  T* base_; <span class="comment">// Pointer to the element of index 0.</span></div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="keywordtype">int</span> size_; <span class="comment">// Valid index are [- size_, size_).</span></div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="keywordtype">int</span> capacity_; <span class="comment">// Reserved index are [- capacity_, capacity_).</span></div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span> };</div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span> </div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span> <span class="comment">// BaseGraph implementation ----------------------------------------------------</span></div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span> </div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keywordtype">bool</span> HasReverseArcs></div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span> IntegerRange<NodeIndexType></div><div class="line"><a name="l00929"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#a32ba4a5ca9a4b89f750eb2dc56518b02"> 929</a></span> <a class="code" href="classutil_1_1BaseGraph.html#a32ba4a5ca9a4b89f750eb2dc56518b02">BaseGraph<NodeIndexType, ArcIndexType, HasReverseArcs>::AllNodes</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="keywordflow">return</span> IntegerRange<NodeIndexType>(0, num_nodes_);</div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span> }</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span> </div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keywordtype">bool</span> HasReverseArcs></div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span> IntegerRange<ArcIndexType></div><div class="line"><a name="l00935"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#abcfd7c21143e5ed38573c0dd60826dd8"> 935</a></span> <a class="code" href="classutil_1_1BaseGraph.html#abcfd7c21143e5ed38573c0dd60826dd8">BaseGraph<NodeIndexType, ArcIndexType, HasReverseArcs>::AllForwardArcs</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="keywordflow">return</span> IntegerRange<ArcIndexType>(0, num_arcs_);</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span> }</div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span> </div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keywordtype">bool</span> HasReverseArcs></div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span> <span class="keyword">const</span> NodeIndexType</div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  <a class="code" href="classutil_1_1BaseGraph.html">BaseGraph<NodeIndexType, ArcIndexType, HasReverseArcs>::kNilNode</a> =</div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  std::numeric_limits<NodeIndexType>::max();</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span> </div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keywordtype">bool</span> HasReverseArcs></div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span> <span class="keyword">const</span> ArcIndexType</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <a class="code" href="classutil_1_1BaseGraph.html">BaseGraph<NodeIndexType, ArcIndexType, HasReverseArcs>::kNilArc</a> =</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  std::numeric_limits<ArcIndexType>::max();</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span> </div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keywordtype">bool</span> HasReverseArcs></div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span> NodeIndexType</div><div class="line"><a name="l00951"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#a463d57480c9563a7a707c5d0928c9946"> 951</a></span> <a class="code" href="classutil_1_1BaseGraph.html#a463d57480c9563a7a707c5d0928c9946">BaseGraph<NodeIndexType, ArcIndexType, HasReverseArcs>::node_capacity</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <span class="comment">// TODO(user): Is it needed? remove completely? return the real capacities</span></div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="comment">// at the cost of having a different implementation for each graphs?</span></div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <span class="keywordflow">return</span> node_capacity_ > num_nodes_ ? node_capacity_ : num_nodes_;</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span> }</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span> </div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keywordtype">bool</span> HasReverseArcs></div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span> ArcIndexType</div><div class="line"><a name="l00959"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#a92ffd852b2ab2e5241f9832e71a2de71"> 959</a></span> <a class="code" href="classutil_1_1BaseGraph.html#a92ffd852b2ab2e5241f9832e71a2de71">BaseGraph<NodeIndexType, ArcIndexType, HasReverseArcs>::arc_capacity</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="comment">// TODO(user): Same questions as the ones in node_capacity().</span></div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  <span class="keywordflow">return</span> arc_capacity_ > num_arcs_ ? arc_capacity_ : num_arcs_;</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span> }</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span> </div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keywordtype">bool</span> HasReverseArcs></div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1BaseGraph.html">BaseGraph</a><NodeIndexType, ArcIndexType,</div><div class="line"><a name="l00966"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#aa3bd051d1e141b09dda17aa9b5f24f69"> 966</a></span>  HasReverseArcs>::FreezeCapacities() {</div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="comment">// TODO(user): Only define this in debug mode at the cost of having a lot</span></div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  <span class="comment">// of ifndef NDEBUG all over the place? remove the function completely ?</span></div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  const_capacities_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  node_capacity_ = std::max(node_capacity_, num_nodes_);</div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  arc_capacity_ = std::max(arc_capacity_, num_arcs_);</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span> }</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span> </div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span> <span class="comment">// Computes the cummulative sum of the entry in v. We only use it with</span></div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span> <span class="comment">// in/out degree distribution, hence the Check() at the end.</span></div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keywordtype">bool</span> HasReverseArcs></div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1BaseGraph.html#ac47030fcb75a3220f8cf9ed79697056e">BaseGraph<NodeIndexType, ArcIndexType, HasReverseArcs>::</a></div><div class="line"><a name="l00978"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#ac47030fcb75a3220f8cf9ed79697056e"> 978</a></span> <a class="code" href="classutil_1_1BaseGraph.html#ac47030fcb75a3220f8cf9ed79697056e"> ComputeCumulativeSum</a>(std::vector<ArcIndexType>* v) {</div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  ArcIndexType sum = 0;</div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_nodes_; ++i) {</div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  ArcIndexType temp = (*v)[i];</div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  (*v)[i] = sum;</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  sum += temp;</div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  }</div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  DCHECK(sum == num_arcs_);</div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span> }</div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span> </div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span> <span class="comment">// Given the tail of arc #i in (*head)[i] and the head of arc #i in (*head)[~i]</span></div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span> <span class="comment">// - Reorder the arc by increasing tail.</span></div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span> <span class="comment">// - Put the head of the new arc #i in (*head)[i].</span></div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span> <span class="comment">// - Put in start[i] the index of the first arc with tail >= i.</span></div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span> <span class="comment">// - Update "permutation" to reflect the change, unless it is NULL.</span></div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keywordtype">bool</span> HasReverseArcs></div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1BaseGraph.html#a63fd586eed6c345866317e2f0faf377e">BaseGraph<NodeIndexType, ArcIndexType, HasReverseArcs>::</a></div><div class="line"><a name="l00995"></a><span class="lineno"><a class="line" href="classutil_1_1BaseGraph.html#a63fd586eed6c345866317e2f0faf377e"> 995</a></span> <a class="code" href="classutil_1_1BaseGraph.html#a63fd586eed6c345866317e2f0faf377e"> BuildStartAndForwardHead</a>(<a class="code" href="classutil_1_1SVector.html">SVector<NodeIndexType></a>* head,</div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  std::vector<ArcIndexType>* start,</div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  std::vector<ArcIndexType>* permutation) {</div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <span class="comment">// Computes the outgoing degree of each nodes and check if we need to permute</span></div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <span class="comment">// something or not. Note that the tails are currently stored in the positive</span></div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  <span class="comment">// range of the SVector head.</span></div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  start->assign(num_nodes_, 0);</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <span class="keywordtype">int</span> last_tail_seen = 0;</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  <span class="keywordtype">bool</span> permutation_needed = <span class="keyword">false</span>;</div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_arcs_; ++i) {</div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  NodeIndexType tail = (*head)[i];</div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  <span class="keywordflow">if</span> (!permutation_needed) {</div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  permutation_needed = tail < last_tail_seen;</div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  last_tail_seen = tail;</div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  }</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  (*start)[tail]++;</div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  }</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  ComputeCumulativeSum(start);</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span> </div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  <span class="comment">// Abort early if we do not need the permutation: we only need to put the</span></div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  <span class="comment">// heads in the positive range.</span></div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <span class="keywordflow">if</span> (!permutation_needed) {</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_arcs_; ++i) {</div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  (*head)[i] = (*head)[~i];</div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  }</div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  <span class="keywordflow">if</span> (permutation != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  permutation->clear();</div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  }</div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  }</div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span> </div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  <span class="comment">// Computes the forward arc permutation.</span></div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  <span class="comment">// Note that this temporarily alters the start vector.</span></div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  std::vector<ArcIndexType> perm(num_arcs_);</div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_arcs_; ++i) {</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  perm[i] = (*start)[(*head)[i]]++;</div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  }</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span> </div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <span class="comment">// Restore in (*start)[i] the index of the first arc with tail >= i.</span></div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = num_nodes_ - 1; i > 0; --i) {</div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  (*start)[i] = (*start)[i - 1];</div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  }</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  (*start)[0] = 0;</div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span> </div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <span class="comment">// Permutes the head into their final position in head.</span></div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  <span class="comment">// We do not need the tails anymore at this point.</span></div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_arcs_; ++i) {</div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  (*head)[perm[i]] = (*head)[~i];</div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  }</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  <span class="keywordflow">if</span> (permutation != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  permutation->swap(perm);</div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  }</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span> }</div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span> </div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span> <span class="comment">// ---------------------------------------------------------------------------</span></div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span> <span class="comment">// Macros to wrap old style iteration into the new range-based for loop style.</span></div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span> <span class="comment">// ---------------------------------------------------------------------------</span></div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span> </div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span> <span class="comment">// The parameters are:</span></div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span> <span class="comment">// - c: the class name.</span></div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span> <span class="comment">// - t: the iteration type (Outgoing, Incoming, OutgoingOrOppositeIncoming</span></div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span> <span class="comment">// or OppositeIncoming).</span></div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span> <span class="comment">// - e: the "end" ArcIndexType.</span></div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span> <span class="preprocessor">#define DEFINE_RANGE_BASED_ARC_ITERATION(c, t, e) \</span></div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span> <span class="preprocessor"> template <typename NodeIndexType, typename ArcIndexType> \</span></div><div class="line"><a name="l01060"></a><span class="lineno"><a class="line" href="graph_8h.html#a48a8a7aa004fc40d0d1d0ba63311cece"> 1060</a></span> <span class="preprocessor"> BeginEndWrapper<typename c<NodeIndexType, ArcIndexType>::t##ArcIterator> \</span></div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span> <span class="preprocessor"> c<NodeIndexType, ArcIndexType>::t##Arcs(NodeIndexType node) const { \</span></div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span> <span class="preprocessor"> return BeginEndWrapper<t##ArcIterator>(t##ArcIterator(*this, node), \</span></div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span> <span class="preprocessor"> t##ArcIterator(*this, node, e)); \</span></div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span> <span class="preprocessor"> template <typename NodeIndexType, typename ArcIndexType> \</span></div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span> <span class="preprocessor"> BeginEndWrapper<typename c<NodeIndexType, ArcIndexType>::t##ArcIterator> \</span></div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span> <span class="preprocessor"> c<NodeIndexType, ArcIndexType>::t##ArcsStartingFrom( \</span></div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span> <span class="preprocessor"> NodeIndexType node, ArcIndexType from) const { \</span></div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span> <span class="preprocessor"> return BeginEndWrapper<t##ArcIterator>(t##ArcIterator(*this, node, from), \</span></div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span> <span class="preprocessor"> t##ArcIterator(*this, node, e)); \</span></div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span> <span class="preprocessor"> }</span></div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span> </div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span> <span class="comment">// Adapt our old iteration style to support range-based for loops. Add typedefs</span></div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span> <span class="comment">// required by std::iterator_traits.</span></div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span> <span class="preprocessor">#define DEFINE_STL_ITERATOR_FUNCTIONS(iterator_class_name) \</span></div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span> <span class="preprocessor"> using iterator_category = std::input_iterator_tag; \</span></div><div class="line"><a name="l01077"></a><span class="lineno"><a class="line" href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0"> 1077</a></span> <span class="preprocessor"> using difference_type = ptrdiff_t; \</span></div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span> <span class="preprocessor"> using pointer = const ArcIndexType*; \</span></div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span> <span class="preprocessor"> using reference = const ArcIndexType&; \</span></div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span> <span class="preprocessor"> using value_type = ArcIndexType; \</span></div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span> <span class="preprocessor"> bool operator!=(const iterator_class_name& other) const { \</span></div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span> <span class="preprocessor"> return this->index_ != other.index_; \</span></div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span> <span class="preprocessor"> bool operator==(const iterator_class_name& other) const { \</span></div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span> <span class="preprocessor"> return this->index_ == other.index_; \</span></div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span> <span class="preprocessor"> } \</span></div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span> <span class="preprocessor"> ArcIndexType operator*() const { return this->Index(); } \</span></div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span> <span class="preprocessor"> void operator++() { this->Next(); }</span></div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span> </div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span> <span class="comment">// ListGraph implementation ----------------------------------------------------</span></div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span> </div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span> <a class="code" href="namespaceutil.html#a37be0131ae922e30a286797a0bef0c96">DEFINE_RANGE_BASED_ARC_ITERATION</a>(ListGraph, Outgoing, Base::kNilArc);</div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span> </div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span> <a class="code" href="iterators_8h.html#af3f6bc803bbe87af730cf9e41a35cf68">BeginEndWrapper</a><</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  <span class="keyword">typename</span> ListGraph<NodeIndexType, ArcIndexType>::OutgoingHeadIterator></div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  <a class="code" href="classutil_1_1ListGraph.html#a1565480b94bf179067e81d762916ed52">ListGraph<NodeIndexType, ArcIndexType>::operator[]</a>(</div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01099"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph.html#a1565480b94bf179067e81d762916ed52"> 1099</a></span>  <span class="keywordflow">return</span> BeginEndWrapper<OutgoingHeadIterator>(</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <a class="code" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html">OutgoingHeadIterator</a>(*<span class="keyword">this</span>, node),</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <a class="code" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html">OutgoingHeadIterator</a>(*<span class="keyword">this</span>, node, Base::kNilArc));</div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span> }</div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span> </div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span> NodeIndexType <a class="code" href="classutil_1_1ListGraph.html#aba03f198f690155bca2ab23b039cea54">ListGraph<NodeIndexType, ArcIndexType>::Tail</a>(</div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01107"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph.html#aba03f198f690155bca2ab23b039cea54"> 1107</a></span>  DCHECK(IsArcValid(arc));</div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="keywordflow">return</span> tail_[arc];</div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span> }</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span> </div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span> NodeIndexType <a class="code" href="classutil_1_1ListGraph.html#ad7d3d076d3c154d89f1eda855a34b487">ListGraph<NodeIndexType, ArcIndexType>::Head</a>(</div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01114"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph.html#ad7d3d076d3c154d89f1eda855a34b487"> 1114</a></span>  DCHECK(IsArcValid(arc));</div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  <span class="keywordflow">return</span> head_[arc];</div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span> }</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span> </div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span> ArcIndexType <a class="code" href="classutil_1_1ListGraph.html#ac52db792129da62b7ab25372ab90647c">ListGraph<NodeIndexType, ArcIndexType>::OutDegree</a>(</div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01121"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph.html#ac52db792129da62b7ab25372ab90647c"> 1121</a></span>  ArcIndexType degree(0);</div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> arc ABSL_ATTRIBUTE_UNUSED : OutgoingArcs(node)) ++degree;</div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  <span class="keywordflow">return</span> degree;</div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span> }</div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span> </div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ListGraph.html#a6af38e88610400b54e8f28ab6f880908">ListGraph<NodeIndexType, ArcIndexType>::AddNode</a>(NodeIndexType node) {</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  <span class="keywordflow">if</span> (node < num_nodes_) <span class="keywordflow">return</span>;</div><div class="line"><a name="l01129"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph.html#a6af38e88610400b54e8f28ab6f880908"> 1129</a></span>  DCHECK(!const_capacities_ || node < node_capacity_);</div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  num_nodes_ = node + 1;</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  start_.resize(num_nodes_, Base::kNilArc);</div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span> }</div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span> </div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span> ArcIndexType <a class="code" href="classutil_1_1ListGraph.html#ac1aa8c7591bb033a49bab79c21c9f496">ListGraph<NodeIndexType, ArcIndexType>::AddArc</a>(</div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  NodeIndexType tail, NodeIndexType head) {</div><div class="line"><a name="l01137"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph.html#ac1aa8c7591bb033a49bab79c21c9f496"> 1137</a></span>  DCHECK_GE(tail, 0);</div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  DCHECK_GE(head, 0);</div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  AddNode(tail > head ? tail : head);</div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  head_.push_back(head);</div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  tail_.push_back(tail);</div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  next_.push_back(start_[tail]);</div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  start_[tail] = num_arcs_;</div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  DCHECK(!const_capacities_ || num_arcs_ < arc_capacity_);</div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  <span class="keywordflow">return</span> num_arcs_++;</div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span> }</div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span> </div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ListGraph.html#aefd885a0eba3ec33568137533190ba5b">ListGraph<NodeIndexType, ArcIndexType>::ReserveNodes</a>(NodeIndexType bound) {</div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  Base::ReserveNodes(bound);</div><div class="line"><a name="l01151"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph.html#aefd885a0eba3ec33568137533190ba5b"> 1151</a></span>  <span class="keywordflow">if</span> (bound <= num_nodes_) <span class="keywordflow">return</span>;</div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  start_.reserve(bound);</div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span> }</div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span> </div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ListGraph.html#af637e16c3c7604f0354a6fa317358a15">ListGraph<NodeIndexType, ArcIndexType>::ReserveArcs</a>(ArcIndexType bound) {</div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  Base::ReserveArcs(bound);</div><div class="line"><a name="l01158"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph.html#af637e16c3c7604f0354a6fa317358a15"> 1158</a></span>  <span class="keywordflow">if</span> (bound <= num_arcs_) <span class="keywordflow">return</span>;</div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  head_.reserve(bound);</div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  tail_.reserve(bound);</div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  next_.reserve(bound);</div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span> }</div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span> </div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ListGraph.html#a777ff917f03a31da77f275d536578afa">ListGraph<NodeIndexType, ArcIndexType>::Build</a>(</div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  std::vector<ArcIndexType>* permutation) {</div><div class="line"><a name="l01167"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph.html#a55c0cd4ab76f4501d0a2b9bbdb308d00"> 1167</a></span>  <span class="keywordflow">if</span> (permutation != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  permutation->clear();</div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  }</div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span> }</div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span> </div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span> <span class="keyword">class </span>ListGraph<NodeIndexType, ArcIndexType>::OutgoingArcIterator {</div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01175"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingArcIterator.html"> 1175</a></span>  <a class="code" href="classutil_1_1ListGraph_1_1OutgoingArcIterator.html">OutgoingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ListGraph.html">ListGraph</a>& graph, NodeIndexType node)</div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  : graph_(graph), index_(graph.start_[node]) {</div><div class="line"><a name="l01177"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingArcIterator.html#a9b772c46ab2530be02708f9695d6f3a3"> 1177</a></span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  }</div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <a class="code" href="classutil_1_1ListGraph_1_1OutgoingArcIterator.html">OutgoingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ListGraph.html">ListGraph</a>& graph, NodeIndexType node,</div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  ArcIndexType arc)</div><div class="line"><a name="l01181"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingArcIterator.html#a6c9470ceecfb37e2aff9641ec622ed80"> 1181</a></span>  : graph_(graph), index_(arc) {</div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  DCHECK(arc == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a> || graph.Tail(arc) == node);</div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  }</div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  <span class="keywordtype">bool</span> Ok()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_ != <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a>; }</div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  ArcIndexType Index()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_; }</div><div class="line"><a name="l01187"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingArcIterator.html#afbbd6b0f0e799203943668813100794c"> 1187</a></span>  <span class="keywordtype">void</span> <a class="code" href="one__tree__lower__bound_8h.html#a3947d19ac087ef2cd68c2409920339c4">Next</a>() {</div><div class="line"><a name="l01188"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingArcIterator.html#a5929fff81892ec6ba4db776ca3bcae63"> 1188</a></span>  DCHECK(Ok());</div><div class="line"><a name="l01189"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingArcIterator.html#aeb6459511875abb327a28591e0b5c172"> 1189</a></span>  index_ = graph_.next_[index_];</div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  }</div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span> </div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <a class="code" href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0">DEFINE_STL_ITERATOR_FUNCTIONS</a>(<a class="code" href="classutil_1_1ListGraph_1_1OutgoingArcIterator.html">OutgoingArcIterator</a>);</div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span> </div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  <span class="keyword">const</span> <a class="code" href="classutil_1_1ListGraph.html">ListGraph</a>& graph_;</div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  ArcIndexType index_;</div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span> };</div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span> </div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span> <span class="keyword">class </span><a class="code" href="classutil_1_1ListGraph.html">ListGraph</a><NodeIndexType, ArcIndexType>::OutgoingHeadIterator {</div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01202"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html"> 1202</a></span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#a2672503e6869d2d2585047c3f5bf28ed">iterator_category</a> = std::input_iterator_tag;</div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#a31e54d4ae7d4b93c43ea64f950221328">difference_type</a> = ptrdiff_t;</div><div class="line"><a name="l01204"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#a2672503e6869d2d2585047c3f5bf28ed"> 1204</a></span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#a6bd5b4ffde55cadc4e58c80a08066e2d">pointer</a> = <span class="keyword">const</span> NodeIndexType*;</div><div class="line"><a name="l01205"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#a31e54d4ae7d4b93c43ea64f950221328"> 1205</a></span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#ad37fb276585027d2996d3fbebc7984db">reference</a> = <span class="keyword">const</span> NodeIndexType&;</div><div class="line"><a name="l01206"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#a6bd5b4ffde55cadc4e58c80a08066e2d"> 1206</a></span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#ae46346c25624805c3daee4d82904afbe">value_type</a> = NodeIndexType;</div><div class="line"><a name="l01207"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#ad37fb276585027d2996d3fbebc7984db"> 1207</a></span> </div><div class="line"><a name="l01208"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#ae46346c25624805c3daee4d82904afbe"> 1208</a></span>  <a class="code" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html">OutgoingHeadIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ListGraph.html">ListGraph</a>& graph, NodeIndexType node)</div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  : graph_(graph), index_(graph.start_[node]) {</div><div class="line"><a name="l01210"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#a0af1c5f92e923e3a8b118b3bf6ebb2c2"> 1210</a></span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  }</div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  <a class="code" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html">OutgoingHeadIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ListGraph.html">ListGraph</a>& graph, NodeIndexType node,</div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  ArcIndexType arc)</div><div class="line"><a name="l01214"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#a97a4cc7fa4bade46b2fc7c6105c0a4d8"> 1214</a></span>  : graph_(graph), index_(arc) {</div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  DCHECK(arc == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a> || graph.Tail(arc) == node);</div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  }</div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  <span class="keywordtype">bool</span> Ok()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_ != <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a>; }</div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  NodeIndexType Index()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> graph_.Head(index_); }</div><div class="line"><a name="l01220"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#af226be77ff7f280952f37377e12edbf5"> 1220</a></span>  <span class="keywordtype">void</span> <a class="code" href="one__tree__lower__bound_8h.html#a3947d19ac087ef2cd68c2409920339c4">Next</a>() {</div><div class="line"><a name="l01221"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#a37a2180b903e8a6de06b6fc7bc053ec9"> 1221</a></span>  DCHECK(Ok());</div><div class="line"><a name="l01222"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#a32219a5b2ba68d54fdad480b0ddc85ec"> 1222</a></span>  index_ = graph_.next_[index_];</div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  }</div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span> </div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  <span class="keywordtype">bool</span> operator!=(</div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classutil_1_1ListGraph.html">ListGraph</a><</div><div class="line"><a name="l01227"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#ab65b44c6c2202b62ce0010c0b0a17db2"> 1227</a></span>  NodeIndexType, ArcIndexType>::<a class="code" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html">OutgoingHeadIterator</a>& other)<span class="keyword"> const </span>{</div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  <span class="keywordflow">return</span> index_ != other.index_;</div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  }</div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  NodeIndexType operator*()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> Index(); }</div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  <span class="keywordtype">void</span> operator++() { <a class="code" href="one__tree__lower__bound_8h.html#a3947d19ac087ef2cd68c2409920339c4">Next</a>(); }</div><div class="line"><a name="l01232"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#ad746758b0ebb63bfdd58c1717fe02f67"> 1232</a></span> </div><div class="line"><a name="l01233"></a><span class="lineno"><a class="line" href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#ac18c4a7cd6790c5f4bc86e360b27e71d"> 1233</a></span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  <span class="keyword">const</span> <a class="code" href="classutil_1_1ListGraph.html">ListGraph</a>& graph_;</div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  ArcIndexType index_;</div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span> };</div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span> </div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span> <span class="comment">// StaticGraph implementation --------------------------------------------------</span></div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span> </div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span> <a class="code" href="namespaceutil.html#a37be0131ae922e30a286797a0bef0c96">DEFINE_RANGE_BASED_ARC_ITERATION</a>(<a class="code" href="classutil_1_1StaticGraph.html">StaticGraph</a>, Outgoing, DirectArcLimit(node));</div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span> </div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span> BeginEndWrapper<NodeIndexType const*></div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  <a class="code" href="classutil_1_1StaticGraph.html#a160bf25732e2b1a19e8bf6d853014070">StaticGraph<NodeIndexType, ArcIndexType>::operator[]</a>(</div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01246"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph.html#a160bf25732e2b1a19e8bf6d853014070"> 1246</a></span>  <span class="keywordflow">return</span> BeginEndWrapper<NodeIndexType const*>(</div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  head_.data() + start_[node], head_.data() + DirectArcLimit(node));</div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span> }</div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span> </div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span> ArcIndexType <a class="code" href="classutil_1_1StaticGraph.html#a7241e6e63df39df439a5ebb4fe28773e">StaticGraph<NodeIndexType, ArcIndexType>::OutDegree</a>(</div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01253"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph.html#a7241e6e63df39df439a5ebb4fe28773e"> 1253</a></span>  <span class="keywordflow">return</span> DirectArcLimit(node) - start_[node];</div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span> }</div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span> </div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1StaticGraph.html#a9b1c856f35140cb8902b94374a43d368">StaticGraph<NodeIndexType, ArcIndexType>::ReserveNodes</a>(</div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  NodeIndexType bound) {</div><div class="line"><a name="l01259"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph.html#a9b1c856f35140cb8902b94374a43d368"> 1259</a></span>  Base::ReserveNodes(bound);</div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  <span class="keywordflow">if</span> (bound <= num_nodes_) <span class="keywordflow">return</span>;</div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  start_.reserve(bound);</div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span> }</div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span> </div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1StaticGraph.html#a98f11aaa1013df49976fcb5433538ff5">StaticGraph<NodeIndexType, ArcIndexType>::ReserveArcs</a>(ArcIndexType bound) {</div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  Base::ReserveArcs(bound);</div><div class="line"><a name="l01267"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph.html#a98f11aaa1013df49976fcb5433538ff5"> 1267</a></span>  <span class="keywordflow">if</span> (bound <= num_arcs_) <span class="keywordflow">return</span>;</div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  head_.reserve(bound);</div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  tail_.reserve(bound);</div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span> }</div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span> </div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1StaticGraph.html#aa2a879f538b488698183a860bdb88596">StaticGraph<NodeIndexType, ArcIndexType>::AddNode</a>(NodeIndexType node) {</div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  <span class="keywordflow">if</span> (node < num_nodes_) <span class="keywordflow">return</span>;</div><div class="line"><a name="l01275"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph.html#aa2a879f538b488698183a860bdb88596"> 1275</a></span>  DCHECK(!const_capacities_ || node < node_capacity_) << node;</div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  num_nodes_ = node + 1;</div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  start_.resize(num_nodes_, 0);</div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span> }</div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span> </div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span> ArcIndexType <a class="code" href="classutil_1_1StaticGraph.html#a10d877b38553e9d2d0ce6fcfc4427df4">StaticGraph<NodeIndexType, ArcIndexType>::AddArc</a>(</div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  NodeIndexType tail, NodeIndexType head) {</div><div class="line"><a name="l01283"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph.html#a10d877b38553e9d2d0ce6fcfc4427df4"> 1283</a></span>  DCHECK_GE(tail, 0);</div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  DCHECK_GE(head, 0);</div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  DCHECK(!is_built_);</div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  AddNode(tail > head ? tail : head);</div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  <span class="keywordflow">if</span> (arc_in_order_) {</div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  <span class="keywordflow">if</span> (tail >= last_tail_seen_) {</div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  start_[tail]++;</div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  last_tail_seen_ = tail;</div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  arc_in_order_ = <span class="keyword">false</span>;</div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  }</div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  }</div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  tail_.push_back(tail);</div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  head_.push_back(head);</div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  DCHECK(!const_capacities_ || num_arcs_ < arc_capacity_);</div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  <span class="keywordflow">return</span> num_arcs_++;</div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span> }</div><div class="line"><a name="l01300"></a><span class="lineno"> 1300</span> </div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span> NodeIndexType <a class="code" href="classutil_1_1StaticGraph.html#a9615f3c590e39f40ca5158bd4f37b5b4">StaticGraph<NodeIndexType, ArcIndexType>::Tail</a>(</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01304"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph.html#a9615f3c590e39f40ca5158bd4f37b5b4"> 1304</a></span>  DCHECK(IsArcValid(arc));</div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  <span class="keywordflow">return</span> tail_[arc];</div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span> }</div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span> </div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span> NodeIndexType <a class="code" href="classutil_1_1StaticGraph.html#aefeec121033f3271585a059f0b5fbd3c">StaticGraph<NodeIndexType, ArcIndexType>::Head</a>(</div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01311"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph.html#aefeec121033f3271585a059f0b5fbd3c"> 1311</a></span>  DCHECK(IsArcValid(arc));</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  <span class="keywordflow">return</span> head_[arc];</div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span> }</div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span> </div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span> <span class="comment">// Implementation details: A reader may be surprised that we do many passes</span></div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span> <span class="comment">// into the data where things could be done in one pass. For instance, during</span></div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span> <span class="comment">// construction, we store the edges first, and then do a second pass at the</span></div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span> <span class="comment">// end to compute the degree distribution.</span></div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span> <span class="comment">//</span></div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span> <span class="comment">// This is because it is a lot more efficient cache-wise to do it this way.</span></div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span> <span class="comment">// This was determined by various experiments, but can also be understood:</span></div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span> <span class="comment">// - during repetitive call to AddArc() a client usually accesses various</span></div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span> <span class="comment">// areas of memory, and there is no reason to polute the cache with</span></div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span> <span class="comment">// possibly random access to degree[i].</span></div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span> <span class="comment">// - When the degrees are needed, we compute them in one go, maximizing the</span></div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span> <span class="comment">// chance of cache hit during the computation.</span></div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1StaticGraph.html#a0b8444bcee7138b5702880a882d29283">StaticGraph<NodeIndexType, ArcIndexType>::Build</a>(</div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  std::vector<ArcIndexType>* permutation) {</div><div class="line"><a name="l01330"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph.html#abfa63fa219b3d8c73a324977312182eb"> 1330</a></span>  DCHECK(!is_built_);</div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  <span class="keywordflow">if</span> (is_built_) <span class="keywordflow">return</span>;</div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  is_built_ = <span class="keyword">true</span>;</div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  node_capacity_ = num_nodes_;</div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  arc_capacity_ = num_arcs_;</div><div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  this->FreezeCapacities();</div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span> </div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  <span class="comment">// If Arc are in order, start_ already contains the degree distribution.</span></div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  <span class="keywordflow">if</span> (arc_in_order_) {</div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  <span class="keywordflow">if</span> (permutation != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  permutation->clear();</div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  }</div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  this->ComputeCumulativeSum(&start_);</div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  }</div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span> </div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  <span class="comment">// Computes outgoing degree of each nodes. We have to clear start_, since</span></div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  <span class="comment">// at least the first arc was processed with arc_in_order_ == true.</span></div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  start_.assign(num_nodes_, 0);</div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_arcs_; ++i) {</div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  start_[tail_[i]]++;</div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  }</div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  this->ComputeCumulativeSum(&start_);</div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span> </div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  <span class="comment">// Computes the forward arc permutation.</span></div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  <span class="comment">// Note that this temporarily alters the start_ vector.</span></div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  std::vector<ArcIndexType> perm(num_arcs_);</div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_arcs_; ++i) {</div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  perm[i] = start_[tail_[i]]++;</div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  }</div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span> </div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  <span class="comment">// We use "tail_" (which now contains rubbish) to permute "head_" faster.</span></div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  CHECK_EQ(tail_.size(), num_arcs_);</div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  tail_.swap(head_);</div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_arcs_; ++i) {</div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  head_[perm[i]] = tail_[i];</div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  }</div><div class="line"><a name="l01367"></a><span class="lineno"> 1367</span> </div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  <span class="keywordflow">if</span> (permutation != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  permutation->swap(perm);</div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  }</div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span> </div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  <span class="comment">// Restore in start_[i] the index of the first arc with tail >= i.</span></div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = num_nodes_ - 1; i > 0; --i) {</div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  start_[i] = start_[i - 1];</div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  }</div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  start_[0] = 0;</div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span> </div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  <span class="comment">// Recompute the correct tail_ vector</span></div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> NodeIndexType node : Base::AllNodes()) {</div><div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ArcIndexType arc : OutgoingArcs(node)) {</div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  tail_[arc] = node;</div><div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  }</div><div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  }</div><div class="line"><a name="l01384"></a><span class="lineno"> 1384</span> }</div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span> </div><div class="line"><a name="l01386"></a><span class="lineno"> 1386</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01387"></a><span class="lineno"> 1387</span> <span class="keyword">class </span>StaticGraph<NodeIndexType, ArcIndexType>::OutgoingArcIterator {</div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01389"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph_1_1OutgoingArcIterator.html"> 1389</a></span>  <a class="code" href="classutil_1_1StaticGraph_1_1OutgoingArcIterator.html">OutgoingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1StaticGraph.html">StaticGraph</a>& graph, NodeIndexType node)</div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  : index_(graph.start_[node]), limit_(graph.DirectArcLimit(node)) {}</div><div class="line"><a name="l01391"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph_1_1OutgoingArcIterator.html#a15d6bd250626ba7eb0c0ca869e80e82e"> 1391</a></span>  <a class="code" href="classutil_1_1StaticGraph_1_1OutgoingArcIterator.html#a15d6bd250626ba7eb0c0ca869e80e82e">OutgoingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1StaticGraph.html">StaticGraph</a>& graph, NodeIndexType node,</div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  ArcIndexType arc)</div><div class="line"><a name="l01393"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph_1_1OutgoingArcIterator.html#a9daf27c5c2732ffaeb63dccfa31ffebd"> 1393</a></span>  : index_(arc), limit_(graph.DirectArcLimit(node)) {</div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  DCHECK_GE(arc, graph.start_[node]);</div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  }</div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span> </div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  <span class="keywordtype">bool</span> Ok()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_ < limit_; }</div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  ArcIndexType Index()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_; }</div><div class="line"><a name="l01399"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph_1_1OutgoingArcIterator.html#a86560381d51296c469edd57e933ecf79"> 1399</a></span>  <span class="keywordtype">void</span> <a class="code" href="one__tree__lower__bound_8h.html#a3947d19ac087ef2cd68c2409920339c4">Next</a>() {</div><div class="line"><a name="l01400"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph_1_1OutgoingArcIterator.html#af5c520ba6fbcd2d229d7a61745ba7cf5"> 1400</a></span>  DCHECK(Ok());</div><div class="line"><a name="l01401"></a><span class="lineno"><a class="line" href="classutil_1_1StaticGraph_1_1OutgoingArcIterator.html#a2815013e93921b115683cf9c95df8bc4"> 1401</a></span>  index_++;</div><div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  }</div><div class="line"><a name="l01403"></a><span class="lineno"> 1403</span> </div><div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>  <span class="comment">// Note(user): we lose a bit by returning a BeginEndWrapper<> on top of</span></div><div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  <span class="comment">// this iterator rather than a simple IntegerRange<> on the arc indices.</span></div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  <span class="comment">// On my computer: around 420M arcs/sec instead of 440M arcs/sec.</span></div><div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  <span class="comment">//</span></div><div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  <span class="comment">// However, it is slightly more consistent to do it this way, and we don't</span></div><div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  <span class="comment">// have two different codes depending on the way a client iterates on the</span></div><div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  <span class="comment">// arcs.</span></div><div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  <a class="code" href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0">DEFINE_STL_ITERATOR_FUNCTIONS</a>(<a class="code" href="classutil_1_1StaticGraph_1_1OutgoingArcIterator.html">OutgoingArcIterator</a>);</div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span> </div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  ArcIndexType index_;</div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  <span class="keyword">const</span> ArcIndexType limit_;</div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span> };</div><div class="line"><a name="l01417"></a><span class="lineno"> 1417</span> </div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span> <span class="comment">// ReverseArcListGraph implementation ------------------------------------------</span></div><div class="line"><a name="l01419"></a><span class="lineno"> 1419</span> </div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span> <a class="code" href="namespaceutil.html#a37be0131ae922e30a286797a0bef0c96">DEFINE_RANGE_BASED_ARC_ITERATION</a>(<a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>, Outgoing, Base::kNilArc);</div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span> <a class="code" href="namespaceutil.html#a37be0131ae922e30a286797a0bef0c96">DEFINE_RANGE_BASED_ARC_ITERATION</a>(<a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>, Incoming, Base::kNilArc);</div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span> <a class="code" href="namespaceutil.html#a37be0131ae922e30a286797a0bef0c96">DEFINE_RANGE_BASED_ARC_ITERATION</a>(<a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>,</div><div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  OutgoingOrOppositeIncoming, Base::kNilArc);</div><div class="line"><a name="l01424"></a><span class="lineno"> 1424</span> <a class="code" href="namespaceutil.html#a37be0131ae922e30a286797a0bef0c96">DEFINE_RANGE_BASED_ARC_ITERATION</a>(<a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>, OppositeIncoming,</div><div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  Base::kNilArc);</div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span> </div><div class="line"><a name="l01427"></a><span class="lineno"> 1427</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span> <a class="code" href="iterators_8h.html#af3f6bc803bbe87af730cf9e41a35cf68">BeginEndWrapper</a><<span class="keyword">typename</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a><</div><div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  NodeIndexType, ArcIndexType>::OutgoingHeadIterator></div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  <a class="code" href="classutil_1_1ReverseArcListGraph.html#a28d6f97b2135e9d51bad632c2556fa56">ReverseArcListGraph<NodeIndexType, ArcIndexType>::operator[]</a>(</div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01432"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph.html#a28d6f97b2135e9d51bad632c2556fa56"> 1432</a></span>  <span class="keywordflow">return</span> BeginEndWrapper<OutgoingHeadIterator>(</div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  <a class="code" href="classutil_1_1ReverseArcListGraph_1_1OutgoingHeadIterator.html">OutgoingHeadIterator</a>(*<span class="keyword">this</span>, node),</div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  <a class="code" href="classutil_1_1ReverseArcListGraph_1_1OutgoingHeadIterator.html">OutgoingHeadIterator</a>(*<span class="keyword">this</span>, node, Base::kNilArc));</div><div class="line"><a name="l01435"></a><span class="lineno"> 1435</span> }</div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span> </div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span> ArcIndexType <a class="code" href="classutil_1_1ReverseArcListGraph.html#ad25429b667ebd6e2ac662b76f3e02eae">ReverseArcListGraph<NodeIndexType, ArcIndexType>::OutDegree</a>(</div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01440"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph.html#ad25429b667ebd6e2ac662b76f3e02eae"> 1440</a></span>  ArcIndexType degree(0);</div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> arc ABSL_ATTRIBUTE_UNUSED : OutgoingArcs(node)) ++degree;</div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  <span class="keywordflow">return</span> degree;</div><div class="line"><a name="l01443"></a><span class="lineno"> 1443</span> }</div><div class="line"><a name="l01444"></a><span class="lineno"> 1444</span> </div><div class="line"><a name="l01445"></a><span class="lineno"> 1445</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span> ArcIndexType <a class="code" href="classutil_1_1ReverseArcListGraph.html#aeffdaa7d0a6c7b6355ee1dab33524961">ReverseArcListGraph<NodeIndexType, ArcIndexType>::InDegree</a>(</div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01448"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph.html#aeffdaa7d0a6c7b6355ee1dab33524961"> 1448</a></span>  ArcIndexType degree(0);</div><div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> arc ABSL_ATTRIBUTE_UNUSED : OppositeIncomingArcs(node)) ++degree;</div><div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  <span class="keywordflow">return</span> degree;</div><div class="line"><a name="l01451"></a><span class="lineno"> 1451</span> }</div><div class="line"><a name="l01452"></a><span class="lineno"> 1452</span> </div><div class="line"><a name="l01453"></a><span class="lineno"> 1453</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01454"></a><span class="lineno"> 1454</span> ArcIndexType <a class="code" href="classutil_1_1ReverseArcListGraph.html#aa3306c75dd28ca037205f382ac832b2a">ReverseArcListGraph<NodeIndexType, ArcIndexType>::OppositeArc</a>(</div><div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01456"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph.html#aa3306c75dd28ca037205f382ac832b2a"> 1456</a></span>  DCHECK(IsArcValid(arc));</div><div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  <span class="keywordflow">return</span> ~arc;</div><div class="line"><a name="l01458"></a><span class="lineno"> 1458</span> }</div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span> </div><div class="line"><a name="l01460"></a><span class="lineno"> 1460</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01461"></a><span class="lineno"> 1461</span> NodeIndexType <a class="code" href="classutil_1_1ReverseArcListGraph.html#a2fdb48f771da93712d9386c60615cf04">ReverseArcListGraph<NodeIndexType, ArcIndexType>::Head</a>(</div><div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01463"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph.html#a2fdb48f771da93712d9386c60615cf04"> 1463</a></span>  DCHECK(IsArcValid(arc));</div><div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  <span class="keywordflow">return</span> head_[arc];</div><div class="line"><a name="l01465"></a><span class="lineno"> 1465</span> }</div><div class="line"><a name="l01466"></a><span class="lineno"> 1466</span> </div><div class="line"><a name="l01467"></a><span class="lineno"> 1467</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01468"></a><span class="lineno"> 1468</span> NodeIndexType <a class="code" href="classutil_1_1ReverseArcListGraph.html#ac7b475304d3677d4a29c676e64c3e09c">ReverseArcListGraph<NodeIndexType, ArcIndexType>::Tail</a>(</div><div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01470"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph.html#ac7b475304d3677d4a29c676e64c3e09c"> 1470</a></span>  <span class="keywordflow">return</span> head_[OppositeArc(arc)];</div><div class="line"><a name="l01471"></a><span class="lineno"> 1471</span> }</div><div class="line"><a name="l01472"></a><span class="lineno"> 1472</span> </div><div class="line"><a name="l01473"></a><span class="lineno"> 1473</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01474"></a><span class="lineno"> 1474</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html#ae7734e3c4b1930b2859b4813bf6e238b">ReverseArcListGraph<NodeIndexType, ArcIndexType>::ReserveNodes</a>(</div><div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>  NodeIndexType bound) {</div><div class="line"><a name="l01476"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph.html#ae7734e3c4b1930b2859b4813bf6e238b"> 1476</a></span>  Base::ReserveNodes(bound);</div><div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  <span class="keywordflow">if</span> (bound <= num_nodes_) <span class="keywordflow">return</span>;</div><div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  start_.reserve(bound);</div><div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  reverse_start_.reserve(bound);</div><div class="line"><a name="l01480"></a><span class="lineno"> 1480</span> }</div><div class="line"><a name="l01481"></a><span class="lineno"> 1481</span> </div><div class="line"><a name="l01482"></a><span class="lineno"> 1482</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01483"></a><span class="lineno"> 1483</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html#a6409e1c967f2062aa83b4bde26a931f1">ReverseArcListGraph<NodeIndexType, ArcIndexType>::ReserveArcs</a>(</div><div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  ArcIndexType bound) {</div><div class="line"><a name="l01485"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph.html#a6409e1c967f2062aa83b4bde26a931f1"> 1485</a></span>  Base::ReserveArcs(bound);</div><div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  <span class="keywordflow">if</span> (bound <= num_arcs_) <span class="keywordflow">return</span>;</div><div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  head_.reserve(bound);</div><div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  next_.reserve(bound);</div><div class="line"><a name="l01489"></a><span class="lineno"> 1489</span> }</div><div class="line"><a name="l01490"></a><span class="lineno"> 1490</span> </div><div class="line"><a name="l01491"></a><span class="lineno"> 1491</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01492"></a><span class="lineno"> 1492</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html#aadf05a4b2729e2844c3251d82b9e862c">ReverseArcListGraph<NodeIndexType, ArcIndexType>::AddNode</a>(</div><div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  NodeIndexType node) {</div><div class="line"><a name="l01494"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph.html#aadf05a4b2729e2844c3251d82b9e862c"> 1494</a></span>  <span class="keywordflow">if</span> (node < num_nodes_) <span class="keywordflow">return</span>;</div><div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  DCHECK(!const_capacities_ || node < node_capacity_);</div><div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  num_nodes_ = node + 1;</div><div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  start_.resize(num_nodes_, Base::kNilArc);</div><div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>  reverse_start_.resize(num_nodes_, Base::kNilArc);</div><div class="line"><a name="l01499"></a><span class="lineno"> 1499</span> }</div><div class="line"><a name="l01500"></a><span class="lineno"> 1500</span> </div><div class="line"><a name="l01501"></a><span class="lineno"> 1501</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01502"></a><span class="lineno"> 1502</span> ArcIndexType <a class="code" href="classutil_1_1ReverseArcListGraph.html#a79291a548af693328d0e4e8f64cdc745">ReverseArcListGraph<NodeIndexType, ArcIndexType>::AddArc</a>(</div><div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  NodeIndexType tail, NodeIndexType head) {</div><div class="line"><a name="l01504"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph.html#a79291a548af693328d0e4e8f64cdc745"> 1504</a></span>  DCHECK_GE(tail, 0);</div><div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  DCHECK_GE(head, 0);</div><div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>  AddNode(tail > head ? tail : head);</div><div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  head_.grow(tail, head);</div><div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  next_.grow(reverse_start_[head], start_[tail]);</div><div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  start_[tail] = num_arcs_;</div><div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  reverse_start_[head] = ~num_arcs_;</div><div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  DCHECK(!const_capacities_ || num_arcs_ < arc_capacity_);</div><div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  <span class="keywordflow">return</span> num_arcs_++;</div><div class="line"><a name="l01513"></a><span class="lineno"> 1513</span> }</div><div class="line"><a name="l01514"></a><span class="lineno"> 1514</span> </div><div class="line"><a name="l01515"></a><span class="lineno"> 1515</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01516"></a><span class="lineno"> 1516</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html#a25d91ab3a2ced7900dd2f5cbcf1ed587">ReverseArcListGraph<NodeIndexType, ArcIndexType>::Build</a>(</div><div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  std::vector<ArcIndexType>* permutation) {</div><div class="line"><a name="l01518"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph.html#a52c31a4ce66ba0c4a24cbe884fda377c"> 1518</a></span>  <span class="keywordflow">if</span> (permutation != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  permutation->clear();</div><div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  }</div><div class="line"><a name="l01521"></a><span class="lineno"> 1521</span> }</div><div class="line"><a name="l01522"></a><span class="lineno"> 1522</span> </div><div class="line"><a name="l01523"></a><span class="lineno"> 1523</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01524"></a><span class="lineno"> 1524</span> <span class="keyword">class </span>ReverseArcListGraph<NodeIndexType, ArcIndexType>::OutgoingArcIterator {</div><div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01526"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingArcIterator.html"> 1526</a></span>  <a class="code" href="classutil_1_1ReverseArcListGraph_1_1OutgoingArcIterator.html">OutgoingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>& graph, NodeIndexType node)</div><div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  : graph_(graph), index_(graph.start_[node]) {</div><div class="line"><a name="l01528"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingArcIterator.html#a3fdd14f693dbdbbeab976f840cb32392"> 1528</a></span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  }</div><div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  <a class="code" href="classutil_1_1ReverseArcListGraph_1_1OutgoingArcIterator.html">OutgoingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>& graph, NodeIndexType node,</div><div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  ArcIndexType arc)</div><div class="line"><a name="l01532"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingArcIterator.html#a78b56030574415d76b1e2d6ebb106fbd"> 1532</a></span>  : graph_(graph), index_(arc) {</div><div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  DCHECK(arc == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a> || arc >= 0);</div><div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  DCHECK(arc == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a> || graph.Tail(arc) == node);</div><div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  }</div><div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  <span class="keywordtype">bool</span> Ok()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_ != <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a>; }</div><div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  ArcIndexType Index()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_; }</div><div class="line"><a name="l01539"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingArcIterator.html#afd40fe3493c52b31693d2bbbedf840d4"> 1539</a></span>  <span class="keywordtype">void</span> <a class="code" href="one__tree__lower__bound_8h.html#a3947d19ac087ef2cd68c2409920339c4">Next</a>() {</div><div class="line"><a name="l01540"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingArcIterator.html#abb96a5d77ae6d00140095ec1cfb90b29"> 1540</a></span>  DCHECK(Ok());</div><div class="line"><a name="l01541"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingArcIterator.html#aad0edaa44248b5f9ac54f94dc120fcc1"> 1541</a></span>  index_ = graph_.next_[index_];</div><div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  }</div><div class="line"><a name="l01543"></a><span class="lineno"> 1543</span> </div><div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  <a class="code" href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0">DEFINE_STL_ITERATOR_FUNCTIONS</a>(<a class="code" href="classutil_1_1ReverseArcListGraph_1_1OutgoingArcIterator.html">OutgoingArcIterator</a>);</div><div class="line"><a name="l01545"></a><span class="lineno"> 1545</span> </div><div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>  <span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>& graph_;</div><div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  ArcIndexType index_;</div><div class="line"><a name="l01549"></a><span class="lineno"> 1549</span> };</div><div class="line"><a name="l01550"></a><span class="lineno"> 1550</span> </div><div class="line"><a name="l01551"></a><span class="lineno"> 1551</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01552"></a><span class="lineno"> 1552</span> <span class="keyword">class </span><a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a><NodeIndexType,</div><div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  ArcIndexType>::OppositeIncomingArcIterator {</div><div class="line"><a name="l01554"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html"> 1554</a></span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  <a class="code" href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>& graph,</div><div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  NodeIndexType node)</div><div class="line"><a name="l01557"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html#af1777cce54ddf621ce58c23b07f04644"> 1557</a></span>  : graph_(graph), index_(graph.reverse_start_[node]) {</div><div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  }</div><div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  <a class="code" href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>& graph,</div><div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  NodeIndexType node, ArcIndexType arc)</div><div class="line"><a name="l01562"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html#a93441dfe63ef7f8ea19c28b90b363472"> 1562</a></span>  : graph_(graph), index_(arc) {</div><div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  DCHECK(arc == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a> || arc < 0);</div><div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  DCHECK(arc == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a> || graph.Tail(arc) == node);</div><div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  }</div><div class="line"><a name="l01567"></a><span class="lineno"> 1567</span> </div><div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  <span class="keywordtype">bool</span> Ok()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_ != <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a>; }</div><div class="line"><a name="l01569"></a><span class="lineno"> 1569</span>  ArcIndexType Index()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_; }</div><div class="line"><a name="l01570"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html#ab32e51a40e51e10e2b6bfb8bf63dbc87"> 1570</a></span>  <span class="keywordtype">void</span> <a class="code" href="one__tree__lower__bound_8h.html#a3947d19ac087ef2cd68c2409920339c4">Next</a>() {</div><div class="line"><a name="l01571"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html#ab7213231061932f430f3fa421bce1d08"> 1571</a></span>  DCHECK(Ok());</div><div class="line"><a name="l01572"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html#af79e306f4c5d2c04b46983e8c53fca49"> 1572</a></span>  index_ = graph_.next_[index_];</div><div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  }</div><div class="line"><a name="l01574"></a><span class="lineno"> 1574</span> </div><div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  <a class="code" href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0">DEFINE_STL_ITERATOR_FUNCTIONS</a>(<a class="code" href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a>);</div><div class="line"><a name="l01576"></a><span class="lineno"> 1576</span> </div><div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  <span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>& graph_;</div><div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  ArcIndexType index_;</div><div class="line"><a name="l01580"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html#a6cc6151c5935827350ec7b9574ad3545"> 1580</a></span> };</div><div class="line"><a name="l01581"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html#adadde330a68f381bab2c87d8e85faebf"> 1581</a></span> </div><div class="line"><a name="l01582"></a><span class="lineno"> 1582</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01583"></a><span class="lineno"> 1583</span> <span class="keyword">class </span><a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a><NodeIndexType, ArcIndexType>::<a class="code" href="classutil_1_1ReverseArcListGraph_1_1IncomingArcIterator.html">IncomingArcIterator</a></div><div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  : <span class="keyword">public</span> <a class="code" href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a> {</div><div class="line"><a name="l01585"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1IncomingArcIterator.html"> 1585</a></span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>  <a class="code" href="classutil_1_1ReverseArcListGraph_1_1IncomingArcIterator.html">IncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>& graph, NodeIndexType node)</div><div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  : <a class="code" href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a>(graph, node) {}</div><div class="line"><a name="l01588"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1IncomingArcIterator.html#aeb78ff088b5309b3573d15bb30178212"> 1588</a></span>  <a class="code" href="classutil_1_1ReverseArcListGraph_1_1IncomingArcIterator.html#aeb78ff088b5309b3573d15bb30178212">IncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>& graph, NodeIndexType node,</div><div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  ArcIndexType arc)</div><div class="line"><a name="l01590"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1IncomingArcIterator.html#ac346c11ba0e038e8bd19ce53000ed627"> 1590</a></span>  : <a class="code" href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a>(</div><div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  graph, node,</div><div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  arc == <a class="code" href="classutil_1_1BaseGraph.html">Base</a>::<a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">kNilArc</a> ? <a class="code" href="classutil_1_1BaseGraph.html">Base</a>::<a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">kNilArc</a> : graph.<a class="code" href="classutil_1_1ReverseArcListGraph.html#aa3306c75dd28ca037205f382ac832b2a">OppositeArc</a>(arc)) {}</div><div class="line"><a name="l01593"></a><span class="lineno"> 1593</span> </div><div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  <span class="comment">// We overwrite OppositeIncomingArcIterator::Index() here.</span></div><div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  ArcIndexType Index()<span class="keyword"> const </span>{</div><div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  <span class="keywordflow">return</span> this->index_ == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a></div><div class="line"><a name="l01597"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1IncomingArcIterator.html#a70ac2dd4710f5ead124c6bcb47a32f16"> 1597</a></span>  ? <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a></div><div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>  : this->graph_.OppositeArc(this->index_);</div><div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>  }</div><div class="line"><a name="l01600"></a><span class="lineno"> 1600</span> </div><div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>  <a class="code" href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0">DEFINE_STL_ITERATOR_FUNCTIONS</a>(<a class="code" href="classutil_1_1ReverseArcListGraph_1_1IncomingArcIterator.html">IncomingArcIterator</a>);</div><div class="line"><a name="l01602"></a><span class="lineno"> 1602</span> };</div><div class="line"><a name="l01603"></a><span class="lineno"> 1603</span> </div><div class="line"><a name="l01604"></a><span class="lineno"> 1604</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01605"></a><span class="lineno"> 1605</span> <span class="keyword">class </span><a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a><NodeIndexType,</div><div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>  ArcIndexType>::OutgoingOrOppositeIncomingArcIterator {</div><div class="line"><a name="l01607"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingOrOppositeIncomingArcIterator.html"> 1607</a></span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  <a class="code" href="classutil_1_1ReverseArcListGraph_1_1OutgoingOrOppositeIncomingArcIterator.html">OutgoingOrOppositeIncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>& graph,</div><div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  NodeIndexType node)</div><div class="line"><a name="l01610"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#af413badb2f4d154c6308a731ab45c4a5"> 1610</a></span>  : graph_(graph), index_(graph.reverse_start_[node]), node_(node) {</div><div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  <span class="keywordflow">if</span> (index_ == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a>) index_ = graph.start_[node];</div><div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  }</div><div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  <a class="code" href="classutil_1_1ReverseArcListGraph_1_1OutgoingOrOppositeIncomingArcIterator.html">OutgoingOrOppositeIncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>& graph,</div><div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  NodeIndexType node, ArcIndexType arc)</div><div class="line"><a name="l01616"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#a1ff541be19a673afa1bc0f797dcfb7ef"> 1616</a></span>  : graph_(graph), index_(arc), node_(node) {</div><div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  DCHECK(arc == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a> || graph.Tail(arc) == node);</div><div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  }</div><div class="line"><a name="l01620"></a><span class="lineno"> 1620</span> </div><div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>  <span class="keywordtype">bool</span> Ok()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_ != <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a>; }</div><div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  ArcIndexType Index()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_; }</div><div class="line"><a name="l01623"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#a1161e8aa1251ada08027562c6ed05f08"> 1623</a></span>  <span class="keywordtype">void</span> <a class="code" href="one__tree__lower__bound_8h.html#a3947d19ac087ef2cd68c2409920339c4">Next</a>() {</div><div class="line"><a name="l01624"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#a2cb0eea9e8b502a6d8313667d76ab3ef"> 1624</a></span>  DCHECK(Ok());</div><div class="line"><a name="l01625"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#ade64e3094b79d73fba19a7539e41439a"> 1625</a></span>  <span class="keywordflow">if</span> (index_ < 0) {</div><div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>  index_ = graph_.next_[index_];</div><div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>  <span class="keywordflow">if</span> (index_ == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a>) {</div><div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>  index_ = graph_.start_[node_];</div><div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>  }</div><div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>  index_ = graph_.next_[index_];</div><div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>  }</div><div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  }</div><div class="line"><a name="l01634"></a><span class="lineno"> 1634</span> </div><div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  <a class="code" href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0">DEFINE_STL_ITERATOR_FUNCTIONS</a>(OutgoingOrOppositeIncomingArcIterator);</div><div class="line"><a name="l01636"></a><span class="lineno"> 1636</span> </div><div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>  <span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html#ac553bb63399815ac609976e5a3bd8732">ReverseArcListGraph</a>& graph_;</div><div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>  ArcIndexType index_;</div><div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>  <span class="keyword">const</span> NodeIndexType node_;</div><div class="line"><a name="l01641"></a><span class="lineno"> 1641</span> };</div><div class="line"><a name="l01642"></a><span class="lineno"> 1642</span> </div><div class="line"><a name="l01643"></a><span class="lineno"> 1643</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01644"></a><span class="lineno"> 1644</span> <span class="keyword">class </span>ReverseArcListGraph<NodeIndexType, ArcIndexType>::OutgoingHeadIterator {</div><div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01646"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingHeadIterator.html"> 1646</a></span>  <a class="code" href="classutil_1_1ReverseArcListGraph_1_1OutgoingHeadIterator.html">OutgoingHeadIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>& graph, NodeIndexType node)</div><div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  : graph_(&graph), index_(graph.start_[node]) {</div><div class="line"><a name="l01648"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingHeadIterator.html#a543ea066e34c54339beab44e7e535602"> 1648</a></span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  }</div><div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  <a class="code" href="classutil_1_1ReverseArcListGraph_1_1OutgoingHeadIterator.html">OutgoingHeadIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>& graph, NodeIndexType node,</div><div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>  ArcIndexType arc)</div><div class="line"><a name="l01652"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingHeadIterator.html#a6cfd2d2e68032ff097430ffc24c296ec"> 1652</a></span>  : graph_(&graph), index_(arc) {</div><div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>  DCHECK(arc == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a> || arc >= 0);</div><div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>  DCHECK(arc == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a> || graph.Tail(arc) == node);</div><div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>  }</div><div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>  <span class="keywordtype">bool</span> Ok()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_ != <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a>; }</div><div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>  ArcIndexType Index()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> graph_->Head(index_); }</div><div class="line"><a name="l01659"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingHeadIterator.html#aebe7b896a8348608a5480a30183319b4"> 1659</a></span>  <span class="keywordtype">void</span> <a class="code" href="one__tree__lower__bound_8h.html#a3947d19ac087ef2cd68c2409920339c4">Next</a>() {</div><div class="line"><a name="l01660"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingHeadIterator.html#abc53834789579a19c77f36885d3c51e4"> 1660</a></span>  DCHECK(Ok());</div><div class="line"><a name="l01661"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcListGraph_1_1OutgoingHeadIterator.html#a2aaa9df08e2df6d5b3b58ff68aaa89a5"> 1661</a></span>  index_ = graph_->next_[index_];</div><div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>  }</div><div class="line"><a name="l01663"></a><span class="lineno"> 1663</span> </div><div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>  <a class="code" href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0">DEFINE_STL_ITERATOR_FUNCTIONS</a>(<a class="code" href="classutil_1_1ReverseArcListGraph_1_1OutgoingHeadIterator.html">OutgoingHeadIterator</a>);</div><div class="line"><a name="l01665"></a><span class="lineno"> 1665</span> </div><div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>  <span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcListGraph.html">ReverseArcListGraph</a>* graph_;</div><div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>  ArcIndexType index_;</div><div class="line"><a name="l01669"></a><span class="lineno"> 1669</span> };</div><div class="line"><a name="l01670"></a><span class="lineno"> 1670</span> </div><div class="line"><a name="l01671"></a><span class="lineno"> 1671</span> <span class="comment">// ReverseArcStaticGraph implementation ----------------------------------------</span></div><div class="line"><a name="l01672"></a><span class="lineno"> 1672</span> </div><div class="line"><a name="l01673"></a><span class="lineno"> 1673</span> <a class="code" href="namespaceutil.html#a37be0131ae922e30a286797a0bef0c96">DEFINE_RANGE_BASED_ARC_ITERATION</a>(<a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a>, Outgoing,</div><div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  DirectArcLimit(node));</div><div class="line"><a name="l01675"></a><span class="lineno"> 1675</span> <a class="code" href="namespaceutil.html#a37be0131ae922e30a286797a0bef0c96">DEFINE_RANGE_BASED_ARC_ITERATION</a>(<a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a>, Incoming,</div><div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>  ReverseArcLimit(node));</div><div class="line"><a name="l01677"></a><span class="lineno"> 1677</span> <a class="code" href="namespaceutil.html#a37be0131ae922e30a286797a0bef0c96">DEFINE_RANGE_BASED_ARC_ITERATION</a>(<a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a>,</div><div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>  OutgoingOrOppositeIncoming,</div><div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>  DirectArcLimit(node));</div><div class="line"><a name="l01680"></a><span class="lineno"> 1680</span> <a class="code" href="namespaceutil.html#a37be0131ae922e30a286797a0bef0c96">DEFINE_RANGE_BASED_ARC_ITERATION</a>(<a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a>, OppositeIncoming,</div><div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>  ReverseArcLimit(node));</div><div class="line"><a name="l01682"></a><span class="lineno"> 1682</span> </div><div class="line"><a name="l01683"></a><span class="lineno"> 1683</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01684"></a><span class="lineno"> 1684</span> ArcIndexType <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#aa9ec825f0a93d13a5c93e82b42cc1088">ReverseArcStaticGraph<NodeIndexType, ArcIndexType>::OutDegree</a>(</div><div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01686"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph.html#aa9ec825f0a93d13a5c93e82b42cc1088"> 1686</a></span>  <span class="keywordflow">return</span> DirectArcLimit(node) - start_[node];</div><div class="line"><a name="l01687"></a><span class="lineno"> 1687</span> }</div><div class="line"><a name="l01688"></a><span class="lineno"> 1688</span> </div><div class="line"><a name="l01689"></a><span class="lineno"> 1689</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01690"></a><span class="lineno"> 1690</span> ArcIndexType <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#aacb8fc16527ae0e30a874393a94cd8ee">ReverseArcStaticGraph<NodeIndexType, ArcIndexType>::InDegree</a>(</div><div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01692"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph.html#aacb8fc16527ae0e30a874393a94cd8ee"> 1692</a></span>  <span class="keywordflow">return</span> ReverseArcLimit(node) - reverse_start_[node];</div><div class="line"><a name="l01693"></a><span class="lineno"> 1693</span> }</div><div class="line"><a name="l01694"></a><span class="lineno"> 1694</span> </div><div class="line"><a name="l01695"></a><span class="lineno"> 1695</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01696"></a><span class="lineno"> 1696</span> BeginEndWrapper<NodeIndexType const*></div><div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>  <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a0ff94f595442b19c2de253a2685fe27f">ReverseArcStaticGraph<NodeIndexType, ArcIndexType>::operator[]</a>(</div><div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01699"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph.html#a0ff94f595442b19c2de253a2685fe27f"> 1699</a></span>  <span class="keywordflow">return</span> BeginEndWrapper<NodeIndexType const*>(</div><div class="line"><a name="l01700"></a><span class="lineno"> 1700</span>  head_.data() + start_[node], head_.data() + DirectArcLimit(node));</div><div class="line"><a name="l01701"></a><span class="lineno"> 1701</span> }</div><div class="line"><a name="l01702"></a><span class="lineno"> 1702</span> </div><div class="line"><a name="l01703"></a><span class="lineno"> 1703</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01704"></a><span class="lineno"> 1704</span> ArcIndexType <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a2f8dc1bf8f2242b19aacc876301365a6">ReverseArcStaticGraph<NodeIndexType, ArcIndexType>::OppositeArc</a>(</div><div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01706"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph.html#a2f8dc1bf8f2242b19aacc876301365a6"> 1706</a></span>  DCHECK(is_built_);</div><div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>  DCHECK(IsArcValid(arc));</div><div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>  <span class="keywordflow">return</span> opposite_[arc];</div><div class="line"><a name="l01709"></a><span class="lineno"> 1709</span> }</div><div class="line"><a name="l01710"></a><span class="lineno"> 1710</span> </div><div class="line"><a name="l01711"></a><span class="lineno"> 1711</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01712"></a><span class="lineno"> 1712</span> NodeIndexType <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a72e8ed03fe3f8ff27d156622a86900aa">ReverseArcStaticGraph<NodeIndexType, ArcIndexType>::Head</a>(</div><div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01714"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph.html#a72e8ed03fe3f8ff27d156622a86900aa"> 1714</a></span>  DCHECK(is_built_);</div><div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>  DCHECK(IsArcValid(arc));</div><div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>  <span class="keywordflow">return</span> head_[arc];</div><div class="line"><a name="l01717"></a><span class="lineno"> 1717</span> }</div><div class="line"><a name="l01718"></a><span class="lineno"> 1718</span> </div><div class="line"><a name="l01719"></a><span class="lineno"> 1719</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01720"></a><span class="lineno"> 1720</span> NodeIndexType <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a12cf8d1312236cac409d9a1a934c1ad3">ReverseArcStaticGraph<NodeIndexType, ArcIndexType>::Tail</a>(</div><div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01722"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph.html#a12cf8d1312236cac409d9a1a934c1ad3"> 1722</a></span>  DCHECK(is_built_);</div><div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>  <span class="keywordflow">return</span> head_[OppositeArc(arc)];</div><div class="line"><a name="l01724"></a><span class="lineno"> 1724</span> }</div><div class="line"><a name="l01725"></a><span class="lineno"> 1725</span> </div><div class="line"><a name="l01726"></a><span class="lineno"> 1726</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01727"></a><span class="lineno"> 1727</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a950e85c43ad31af8dd24a15e895c77c7">ReverseArcStaticGraph<NodeIndexType, ArcIndexType>::ReserveArcs</a>(</div><div class="line"><a name="l01728"></a><span class="lineno"> 1728</span>  ArcIndexType bound) {</div><div class="line"><a name="l01729"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph.html#a950e85c43ad31af8dd24a15e895c77c7"> 1729</a></span>  Base::ReserveArcs(bound);</div><div class="line"><a name="l01730"></a><span class="lineno"> 1730</span>  <span class="keywordflow">if</span> (bound <= num_arcs_) <span class="keywordflow">return</span>;</div><div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>  head_.reserve(bound);</div><div class="line"><a name="l01732"></a><span class="lineno"> 1732</span> }</div><div class="line"><a name="l01733"></a><span class="lineno"> 1733</span> </div><div class="line"><a name="l01734"></a><span class="lineno"> 1734</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01735"></a><span class="lineno"> 1735</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#af83383a45904db07bed45418199ff2dc">ReverseArcStaticGraph<NodeIndexType, ArcIndexType>::AddNode</a>(</div><div class="line"><a name="l01736"></a><span class="lineno"> 1736</span>  NodeIndexType node) {</div><div class="line"><a name="l01737"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph.html#af83383a45904db07bed45418199ff2dc"> 1737</a></span>  <span class="keywordflow">if</span> (node < num_nodes_) <span class="keywordflow">return</span>;</div><div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>  DCHECK(!const_capacities_ || node < node_capacity_);</div><div class="line"><a name="l01739"></a><span class="lineno"> 1739</span>  num_nodes_ = node + 1;</div><div class="line"><a name="l01740"></a><span class="lineno"> 1740</span> }</div><div class="line"><a name="l01741"></a><span class="lineno"> 1741</span> </div><div class="line"><a name="l01742"></a><span class="lineno"> 1742</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01743"></a><span class="lineno"> 1743</span> ArcIndexType <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a0b801f8cece53ce666b90be4a8b76ae6">ReverseArcStaticGraph<NodeIndexType, ArcIndexType>::AddArc</a>(</div><div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>  NodeIndexType tail, NodeIndexType head) {</div><div class="line"><a name="l01745"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph.html#a0b801f8cece53ce666b90be4a8b76ae6"> 1745</a></span>  DCHECK_GE(tail, 0);</div><div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>  DCHECK_GE(head, 0);</div><div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>  AddNode(tail > head ? tail : head);</div><div class="line"><a name="l01748"></a><span class="lineno"> 1748</span> </div><div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>  <span class="comment">// We inverse head and tail here because it is more convenient this way</span></div><div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>  <span class="comment">// during build time, see Build().</span></div><div class="line"><a name="l01751"></a><span class="lineno"> 1751</span>  head_.grow(head, tail);</div><div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>  DCHECK(!const_capacities_ || num_arcs_ < arc_capacity_);</div><div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>  <span class="keywordflow">return</span> num_arcs_++;</div><div class="line"><a name="l01754"></a><span class="lineno"> 1754</span> }</div><div class="line"><a name="l01755"></a><span class="lineno"> 1755</span> </div><div class="line"><a name="l01756"></a><span class="lineno"> 1756</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01757"></a><span class="lineno"> 1757</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a485803d141f9c80beaaae7094548d672">ReverseArcStaticGraph<NodeIndexType, ArcIndexType>::Build</a>(</div><div class="line"><a name="l01758"></a><span class="lineno"> 1758</span>  std::vector<ArcIndexType>* permutation) {</div><div class="line"><a name="l01759"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph.html#a590ee70b96ce87433ba89b067495aa5f"> 1759</a></span>  DCHECK(!is_built_);</div><div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>  <span class="keywordflow">if</span> (is_built_) <span class="keywordflow">return</span>;</div><div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>  is_built_ = <span class="keyword">true</span>;</div><div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>  node_capacity_ = num_nodes_;</div><div class="line"><a name="l01763"></a><span class="lineno"> 1763</span>  arc_capacity_ = num_arcs_;</div><div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  this->FreezeCapacities();</div><div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>  this->BuildStartAndForwardHead(&head_, &start_, permutation);</div><div class="line"><a name="l01766"></a><span class="lineno"> 1766</span> </div><div class="line"><a name="l01767"></a><span class="lineno"> 1767</span>  <span class="comment">// Computes incoming degree of each nodes.</span></div><div class="line"><a name="l01768"></a><span class="lineno"> 1768</span>  reverse_start_.assign(num_nodes_, 0);</div><div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_arcs_; ++i) {</div><div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>  reverse_start_[head_[i]]++;</div><div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>  }</div><div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>  this->ComputeCumulativeSum(&reverse_start_);</div><div class="line"><a name="l01773"></a><span class="lineno"> 1773</span> </div><div class="line"><a name="l01774"></a><span class="lineno"> 1774</span>  <span class="comment">// Computes the reverse arcs of the forward arcs.</span></div><div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>  <span class="comment">// Note that this sort the reverse arcs with the same tail by head.</span></div><div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>  opposite_.reserve(num_arcs_);</div><div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_arcs_; ++i) {</div><div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>  <span class="comment">// TODO(user): the 0 is wasted here, but minor optimisation.</span></div><div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>  opposite_.grow(0, reverse_start_[head_[i]]++ - num_arcs_);</div><div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>  }</div><div class="line"><a name="l01781"></a><span class="lineno"> 1781</span> </div><div class="line"><a name="l01782"></a><span class="lineno"> 1782</span>  <span class="comment">// Computes in reverse_start_ the start index of the reverse arcs.</span></div><div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = num_nodes_ - 1; i > 0; --i) {</div><div class="line"><a name="l01784"></a><span class="lineno"> 1784</span>  reverse_start_[i] = reverse_start_[i - 1] - num_arcs_;</div><div class="line"><a name="l01785"></a><span class="lineno"> 1785</span>  }</div><div class="line"><a name="l01786"></a><span class="lineno"> 1786</span>  <span class="keywordflow">if</span> (num_nodes_ != 0) {</div><div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>  reverse_start_[0] = -num_arcs_;</div><div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>  }</div><div class="line"><a name="l01789"></a><span class="lineno"> 1789</span> </div><div class="line"><a name="l01790"></a><span class="lineno"> 1790</span>  <span class="comment">// Fill reverse arc information.</span></div><div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_arcs_; ++i) {</div><div class="line"><a name="l01792"></a><span class="lineno"> 1792</span>  opposite_[opposite_[i]] = i;</div><div class="line"><a name="l01793"></a><span class="lineno"> 1793</span>  }</div><div class="line"><a name="l01794"></a><span class="lineno"> 1794</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> NodeIndexType node : Base::AllNodes()) {</div><div class="line"><a name="l01795"></a><span class="lineno"> 1795</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ArcIndexType arc : OutgoingArcs(node)) {</div><div class="line"><a name="l01796"></a><span class="lineno"> 1796</span>  head_[opposite_[arc]] = node;</div><div class="line"><a name="l01797"></a><span class="lineno"> 1797</span>  }</div><div class="line"><a name="l01798"></a><span class="lineno"> 1798</span>  }</div><div class="line"><a name="l01799"></a><span class="lineno"> 1799</span> }</div><div class="line"><a name="l01800"></a><span class="lineno"> 1800</span> </div><div class="line"><a name="l01801"></a><span class="lineno"> 1801</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01802"></a><span class="lineno"> 1802</span> <span class="keyword">class </span>ReverseArcStaticGraph<NodeIndexType, ArcIndexType>::OutgoingArcIterator {</div><div class="line"><a name="l01803"></a><span class="lineno"> 1803</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01804"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingArcIterator.html"> 1804</a></span>  <a class="code" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingArcIterator.html">OutgoingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a>& graph, NodeIndexType node)</div><div class="line"><a name="l01805"></a><span class="lineno"> 1805</span>  : index_(graph.start_[node]), limit_(graph.DirectArcLimit(node)) {}</div><div class="line"><a name="l01806"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingArcIterator.html#a70d282f950c2f8e4c7aebc8809682661"> 1806</a></span>  <a class="code" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingArcIterator.html#a70d282f950c2f8e4c7aebc8809682661">OutgoingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a>& graph, NodeIndexType node,</div><div class="line"><a name="l01807"></a><span class="lineno"> 1807</span>  ArcIndexType arc)</div><div class="line"><a name="l01808"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingArcIterator.html#aeaeb8e993daf64d4d0423c09b2afd501"> 1808</a></span>  : index_(arc), limit_(graph.DirectArcLimit(node)) {</div><div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>  DCHECK_GE(arc, graph.start_[node]);</div><div class="line"><a name="l01810"></a><span class="lineno"> 1810</span>  }</div><div class="line"><a name="l01811"></a><span class="lineno"> 1811</span> </div><div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>  <span class="keywordtype">bool</span> Ok()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_ < limit_; }</div><div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>  ArcIndexType Index()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_; }</div><div class="line"><a name="l01814"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingArcIterator.html#afed4eb7b5114e63cf61c50357ebb2e58"> 1814</a></span>  <span class="keywordtype">void</span> <a class="code" href="one__tree__lower__bound_8h.html#a3947d19ac087ef2cd68c2409920339c4">Next</a>() {</div><div class="line"><a name="l01815"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingArcIterator.html#a3a2d3ea00412e3914f4ec1bc2c087c0e"> 1815</a></span>  DCHECK(Ok());</div><div class="line"><a name="l01816"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingArcIterator.html#a63db75a3bdcd0c16af17aa319e6e1ad5"> 1816</a></span>  index_++;</div><div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>  }</div><div class="line"><a name="l01818"></a><span class="lineno"> 1818</span> </div><div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>  <span class="comment">// TODO(user): we lose a bit by returning a BeginEndWrapper<> on top of this</span></div><div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>  <span class="comment">// iterator rather than a simple IntegerRange on the arc indices.</span></div><div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>  <a class="code" href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0">DEFINE_STL_ITERATOR_FUNCTIONS</a>(<a class="code" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingArcIterator.html">OutgoingArcIterator</a>);</div><div class="line"><a name="l01822"></a><span class="lineno"> 1822</span> </div><div class="line"><a name="l01823"></a><span class="lineno"> 1823</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>  ArcIndexType index_;</div><div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>  <span class="keyword">const</span> ArcIndexType limit_;</div><div class="line"><a name="l01826"></a><span class="lineno"> 1826</span> };</div><div class="line"><a name="l01827"></a><span class="lineno"> 1827</span> </div><div class="line"><a name="l01828"></a><span class="lineno"> 1828</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01829"></a><span class="lineno"> 1829</span> <span class="keyword">class </span><a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a><NodeIndexType,</div><div class="line"><a name="l01830"></a><span class="lineno"> 1830</span>  ArcIndexType>::OppositeIncomingArcIterator {</div><div class="line"><a name="l01831"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html"> 1831</a></span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>  <a class="code" href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a>& graph,</div><div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>  NodeIndexType node)</div><div class="line"><a name="l01834"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html#aad411a93142ff085a68a0d599524c3a1"> 1834</a></span>  : graph_(graph),</div><div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>  limit_(graph.ReverseArcLimit(node)),</div><div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  index_(graph.reverse_start_[node]) {</div><div class="line"><a name="l01837"></a><span class="lineno"> 1837</span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  DCHECK_LE(index_, limit_);</div><div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>  }</div><div class="line"><a name="l01840"></a><span class="lineno"> 1840</span>  <a class="code" href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a>& graph,</div><div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  NodeIndexType node, ArcIndexType arc)</div><div class="line"><a name="l01842"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html#abf88ffe44a8c97009a3a14af7ac02d9d"> 1842</a></span>  : graph_(graph), limit_(graph.ReverseArcLimit(node)), index_(arc) {</div><div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>  DCHECK_GE(index_, graph.reverse_start_[node]);</div><div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>  DCHECK_LE(index_, limit_);</div><div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>  }</div><div class="line"><a name="l01847"></a><span class="lineno"> 1847</span> </div><div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>  <span class="keywordtype">bool</span> Ok()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_ < limit_; }</div><div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>  ArcIndexType Index()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_; }</div><div class="line"><a name="l01850"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html#acc521bdcf77d31c02f46130de62abbd6"> 1850</a></span>  <span class="keywordtype">void</span> <a class="code" href="one__tree__lower__bound_8h.html#a3947d19ac087ef2cd68c2409920339c4">Next</a>() {</div><div class="line"><a name="l01851"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html#a7671d99b9b1eccee171ea381efbf6306"> 1851</a></span>  DCHECK(Ok());</div><div class="line"><a name="l01852"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html#af44b76c2269e81f5dfcc61825fbb1b9f"> 1852</a></span>  index_++;</div><div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>  }</div><div class="line"><a name="l01854"></a><span class="lineno"> 1854</span> </div><div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>  <a class="code" href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0">DEFINE_STL_ITERATOR_FUNCTIONS</a>(<a class="code" href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a>);</div><div class="line"><a name="l01856"></a><span class="lineno"> 1856</span> </div><div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>  <span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a>& graph_;</div><div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>  <span class="keyword">const</span> ArcIndexType limit_;</div><div class="line"><a name="l01860"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html#a0dd89a6500a8ab3018be5cbe34ad11b2"> 1860</a></span>  ArcIndexType index_;</div><div class="line"><a name="l01861"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html#a3a1dd084ad6093422cffb58da43de685"> 1861</a></span> };</div><div class="line"><a name="l01862"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html#a4c6d6e4b71f0237dffe7d4ed2541edf1"> 1862</a></span> </div><div class="line"><a name="l01863"></a><span class="lineno"> 1863</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01864"></a><span class="lineno"> 1864</span> <span class="keyword">class </span><a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a><NodeIndexType, ArcIndexType>::<a class="code" href="classutil_1_1ReverseArcStaticGraph_1_1IncomingArcIterator.html">IncomingArcIterator</a></div><div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>  : <span class="keyword">public</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a> {</div><div class="line"><a name="l01866"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1IncomingArcIterator.html"> 1866</a></span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01867"></a><span class="lineno"> 1867</span>  <a class="code" href="classutil_1_1ReverseArcStaticGraph_1_1IncomingArcIterator.html">IncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a>& graph, NodeIndexType node)</div><div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>  : <a class="code" href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a>(graph, node) {}</div><div class="line"><a name="l01869"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1IncomingArcIterator.html#a287ddcb43f060b53bceef9434834e9ed"> 1869</a></span>  <a class="code" href="classutil_1_1ReverseArcStaticGraph_1_1IncomingArcIterator.html#a287ddcb43f060b53bceef9434834e9ed">IncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a>& graph, NodeIndexType node,</div><div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>  ArcIndexType arc)</div><div class="line"><a name="l01871"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1IncomingArcIterator.html#ae7b420ee39369471aeee86c9a6d1818a"> 1871</a></span>  : <a class="code" href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a>(graph, node,</div><div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>  arc == graph.ReverseArcLimit(node)</div><div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>  ? graph.ReverseArcLimit(node)</div><div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>  : graph.<a class="code" href="classutil_1_1ReverseArcStaticGraph.html#a2f8dc1bf8f2242b19aacc876301365a6">OppositeArc</a>(arc)) {}</div><div class="line"><a name="l01875"></a><span class="lineno"> 1875</span> </div><div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>  ArcIndexType Index()<span class="keyword"> const </span>{</div><div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>  <span class="keywordflow">return</span> this->index_ == this->limit_</div><div class="line"><a name="l01878"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1IncomingArcIterator.html#a3aef6ddf066be477b4acea40ef998557"> 1878</a></span>  ? this->limit_</div><div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>  : this->graph_.OppositeArc(this->index_);</div><div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>  }</div><div class="line"><a name="l01881"></a><span class="lineno"> 1881</span> </div><div class="line"><a name="l01882"></a><span class="lineno"> 1882</span>  <a class="code" href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0">DEFINE_STL_ITERATOR_FUNCTIONS</a>(<a class="code" href="classutil_1_1ReverseArcStaticGraph_1_1IncomingArcIterator.html">IncomingArcIterator</a>);</div><div class="line"><a name="l01883"></a><span class="lineno"> 1883</span> };</div><div class="line"><a name="l01884"></a><span class="lineno"> 1884</span> </div><div class="line"><a name="l01885"></a><span class="lineno"> 1885</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01886"></a><span class="lineno"> 1886</span> <span class="keyword">class </span><a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a><</div><div class="line"><a name="l01887"></a><span class="lineno"> 1887</span>  NodeIndexType, ArcIndexType>::OutgoingOrOppositeIncomingArcIterator {</div><div class="line"><a name="l01888"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingOrOppositeIncomingArcIterator.html"> 1888</a></span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01889"></a><span class="lineno"> 1889</span>  <a class="code" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingOrOppositeIncomingArcIterator.html">OutgoingOrOppositeIncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a>& graph,</div><div class="line"><a name="l01890"></a><span class="lineno"> 1890</span>  NodeIndexType node)</div><div class="line"><a name="l01891"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#a8e0aa831c04c3dd5c8b9a755ebc24fc5"> 1891</a></span>  : index_(graph.reverse_start_[node]),</div><div class="line"><a name="l01892"></a><span class="lineno"> 1892</span>  first_limit_(graph.ReverseArcLimit(node)),</div><div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>  next_start_(graph.start_[node]),</div><div class="line"><a name="l01894"></a><span class="lineno"> 1894</span>  limit_(graph.DirectArcLimit(node)) {</div><div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>  <span class="keywordflow">if</span> (index_ == first_limit_) index_ = next_start_;</div><div class="line"><a name="l01896"></a><span class="lineno"> 1896</span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l01897"></a><span class="lineno"> 1897</span>  DCHECK((index_ < first_limit_) || (index_ >= next_start_));</div><div class="line"><a name="l01898"></a><span class="lineno"> 1898</span>  }</div><div class="line"><a name="l01899"></a><span class="lineno"> 1899</span>  <a class="code" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingOrOppositeIncomingArcIterator.html">OutgoingOrOppositeIncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcStaticGraph.html">ReverseArcStaticGraph</a>& graph,</div><div class="line"><a name="l01900"></a><span class="lineno"> 1900</span>  NodeIndexType node, ArcIndexType arc)</div><div class="line"><a name="l01901"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#a8c3a7b41bd5314226d4517b920525fb8"> 1901</a></span>  : index_(arc),</div><div class="line"><a name="l01902"></a><span class="lineno"> 1902</span>  first_limit_(graph.ReverseArcLimit(node)),</div><div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>  next_start_(graph.start_[node]),</div><div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>  limit_(graph.DirectArcLimit(node)) {</div><div class="line"><a name="l01905"></a><span class="lineno"> 1905</span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>  DCHECK((index_ >= graph.reverse_start_[node] && index_ < first_limit_) ||</div><div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>  (index_ >= next_start_));</div><div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>  }</div><div class="line"><a name="l01909"></a><span class="lineno"> 1909</span> </div><div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>  ArcIndexType Index()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_; }</div><div class="line"><a name="l01911"></a><span class="lineno"> 1911</span>  <span class="keywordtype">bool</span> Ok()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_ < limit_; }</div><div class="line"><a name="l01912"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#a6ff22ab544af24017b576a3f583e4d48"> 1912</a></span>  <span class="keywordtype">void</span> <a class="code" href="one__tree__lower__bound_8h.html#a3947d19ac087ef2cd68c2409920339c4">Next</a>() {</div><div class="line"><a name="l01913"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#ad1f79b2ac841f3856578d6840e2bf25a"> 1913</a></span>  DCHECK(<a class="code" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#ad1f79b2ac841f3856578d6840e2bf25a">Ok</a>());</div><div class="line"><a name="l01914"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#ac3219fdc6b75a59fcf8752219f0fa959"> 1914</a></span>  index_++;</div><div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>  <span class="keywordflow">if</span> (index_ == first_limit_) {</div><div class="line"><a name="l01916"></a><span class="lineno"> 1916</span>  index_ = next_start_;</div><div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>  }</div><div class="line"><a name="l01918"></a><span class="lineno"> 1918</span>  }</div><div class="line"><a name="l01919"></a><span class="lineno"> 1919</span> </div><div class="line"><a name="l01920"></a><span class="lineno"> 1920</span>  <a class="code" href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0">DEFINE_STL_ITERATOR_FUNCTIONS</a>(OutgoingOrOppositeIncomingArcIterator);</div><div class="line"><a name="l01921"></a><span class="lineno"> 1921</span> </div><div class="line"><a name="l01922"></a><span class="lineno"> 1922</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01923"></a><span class="lineno"> 1923</span>  ArcIndexType index_;</div><div class="line"><a name="l01924"></a><span class="lineno"> 1924</span>  <span class="keyword">const</span> ArcIndexType first_limit_;</div><div class="line"><a name="l01925"></a><span class="lineno"> 1925</span>  <span class="keyword">const</span> ArcIndexType next_start_;</div><div class="line"><a name="l01926"></a><span class="lineno"> 1926</span>  <span class="keyword">const</span> ArcIndexType limit_;</div><div class="line"><a name="l01927"></a><span class="lineno"> 1927</span> };</div><div class="line"><a name="l01928"></a><span class="lineno"> 1928</span> </div><div class="line"><a name="l01929"></a><span class="lineno"> 1929</span> <span class="comment">// ReverseArcMixedGraph implementation -----------------------------------------</span></div><div class="line"><a name="l01930"></a><span class="lineno"> 1930</span> </div><div class="line"><a name="l01931"></a><span class="lineno"> 1931</span> <a class="code" href="namespaceutil.html#a37be0131ae922e30a286797a0bef0c96">DEFINE_RANGE_BASED_ARC_ITERATION</a>(ReverseArcMixedGraph, Outgoing,</div><div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>  DirectArcLimit(node));</div><div class="line"><a name="l01933"></a><span class="lineno"> 1933</span> <a class="code" href="namespaceutil.html#a37be0131ae922e30a286797a0bef0c96">DEFINE_RANGE_BASED_ARC_ITERATION</a>(ReverseArcMixedGraph, Incoming, Base::kNilArc);</div><div class="line"><a name="l01934"></a><span class="lineno"> 1934</span> <a class="code" href="namespaceutil.html#a37be0131ae922e30a286797a0bef0c96">DEFINE_RANGE_BASED_ARC_ITERATION</a>(ReverseArcMixedGraph,</div><div class="line"><a name="l01935"></a><span class="lineno"> 1935</span>  OutgoingOrOppositeIncoming,</div><div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>  DirectArcLimit(node));</div><div class="line"><a name="l01937"></a><span class="lineno"> 1937</span> <a class="code" href="namespaceutil.html#a37be0131ae922e30a286797a0bef0c96">DEFINE_RANGE_BASED_ARC_ITERATION</a>(ReverseArcMixedGraph, OppositeIncoming,</div><div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>  Base::kNilArc);</div><div class="line"><a name="l01939"></a><span class="lineno"> 1939</span> </div><div class="line"><a name="l01940"></a><span class="lineno"> 1940</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01941"></a><span class="lineno"> 1941</span> ArcIndexType <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#addeb94680d05c79b1be501edc5823209">ReverseArcMixedGraph<NodeIndexType, ArcIndexType>::OutDegree</a>(</div><div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01943"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph.html#addeb94680d05c79b1be501edc5823209"> 1943</a></span>  <span class="keywordflow">return</span> DirectArcLimit(node) - start_[node];</div><div class="line"><a name="l01944"></a><span class="lineno"> 1944</span> }</div><div class="line"><a name="l01945"></a><span class="lineno"> 1945</span> </div><div class="line"><a name="l01946"></a><span class="lineno"> 1946</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01947"></a><span class="lineno"> 1947</span> ArcIndexType <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#ae5ea8fcc78ca9b142e07665d447ad2bd">ReverseArcMixedGraph<NodeIndexType, ArcIndexType>::InDegree</a>(</div><div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01949"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph.html#ae5ea8fcc78ca9b142e07665d447ad2bd"> 1949</a></span>  ArcIndexType degree(0);</div><div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> arc ABSL_ATTRIBUTE_UNUSED : OppositeIncomingArcs(node)) ++degree;</div><div class="line"><a name="l01951"></a><span class="lineno"> 1951</span>  <span class="keywordflow">return</span> degree;</div><div class="line"><a name="l01952"></a><span class="lineno"> 1952</span> }</div><div class="line"><a name="l01953"></a><span class="lineno"> 1953</span> </div><div class="line"><a name="l01954"></a><span class="lineno"> 1954</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01955"></a><span class="lineno"> 1955</span> BeginEndWrapper<NodeIndexType const*></div><div class="line"><a name="l01956"></a><span class="lineno"> 1956</span>  <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#aff7c6ef395dfc941edac13b29e154b54">ReverseArcMixedGraph<NodeIndexType, ArcIndexType>::operator[]</a>(</div><div class="line"><a name="l01957"></a><span class="lineno"> 1957</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01958"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph.html#aff7c6ef395dfc941edac13b29e154b54"> 1958</a></span>  <span class="keywordflow">return</span> BeginEndWrapper<NodeIndexType const*>(</div><div class="line"><a name="l01959"></a><span class="lineno"> 1959</span>  head_.data() + start_[node], head_.data() + DirectArcLimit(node));</div><div class="line"><a name="l01960"></a><span class="lineno"> 1960</span> }</div><div class="line"><a name="l01961"></a><span class="lineno"> 1961</span> </div><div class="line"><a name="l01962"></a><span class="lineno"> 1962</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01963"></a><span class="lineno"> 1963</span> ArcIndexType <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a86effffe3928593a808edf548dd6b832">ReverseArcMixedGraph<NodeIndexType, ArcIndexType>::OppositeArc</a>(</div><div class="line"><a name="l01964"></a><span class="lineno"> 1964</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01965"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph.html#a86effffe3928593a808edf548dd6b832"> 1965</a></span>  DCHECK(IsArcValid(arc));</div><div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>  <span class="keywordflow">return</span> ~arc;</div><div class="line"><a name="l01967"></a><span class="lineno"> 1967</span> }</div><div class="line"><a name="l01968"></a><span class="lineno"> 1968</span> </div><div class="line"><a name="l01969"></a><span class="lineno"> 1969</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01970"></a><span class="lineno"> 1970</span> NodeIndexType <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a5ebe11f2abcd78ad1f5606e27d1688bb">ReverseArcMixedGraph<NodeIndexType, ArcIndexType>::Head</a>(</div><div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01972"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph.html#a5ebe11f2abcd78ad1f5606e27d1688bb"> 1972</a></span>  DCHECK(is_built_);</div><div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>  DCHECK(IsArcValid(arc));</div><div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>  <span class="keywordflow">return</span> head_[arc];</div><div class="line"><a name="l01975"></a><span class="lineno"> 1975</span> }</div><div class="line"><a name="l01976"></a><span class="lineno"> 1976</span> </div><div class="line"><a name="l01977"></a><span class="lineno"> 1977</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01978"></a><span class="lineno"> 1978</span> NodeIndexType <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a351cbc3c0c79e22f010e697bf65d7100">ReverseArcMixedGraph<NodeIndexType, ArcIndexType>::Tail</a>(</div><div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01980"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph.html#a351cbc3c0c79e22f010e697bf65d7100"> 1980</a></span>  DCHECK(is_built_);</div><div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>  <span class="keywordflow">return</span> head_[OppositeArc(arc)];</div><div class="line"><a name="l01982"></a><span class="lineno"> 1982</span> }</div><div class="line"><a name="l01983"></a><span class="lineno"> 1983</span> </div><div class="line"><a name="l01984"></a><span class="lineno"> 1984</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01985"></a><span class="lineno"> 1985</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#ad39d8df784046ecfb6192ac0a0b5da44">ReverseArcMixedGraph<NodeIndexType, ArcIndexType>::ReserveArcs</a>(</div><div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>  ArcIndexType bound) {</div><div class="line"><a name="l01987"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph.html#ad39d8df784046ecfb6192ac0a0b5da44"> 1987</a></span>  Base::ReserveArcs(bound);</div><div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>  <span class="keywordflow">if</span> (bound <= num_arcs_) <span class="keywordflow">return</span>;</div><div class="line"><a name="l01989"></a><span class="lineno"> 1989</span>  head_.reserve(bound);</div><div class="line"><a name="l01990"></a><span class="lineno"> 1990</span> }</div><div class="line"><a name="l01991"></a><span class="lineno"> 1991</span> </div><div class="line"><a name="l01992"></a><span class="lineno"> 1992</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01993"></a><span class="lineno"> 1993</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#aab290c8728947d80dbf9fec6e320c3d1">ReverseArcMixedGraph<NodeIndexType, ArcIndexType>::AddNode</a>(</div><div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>  NodeIndexType node) {</div><div class="line"><a name="l01995"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph.html#aab290c8728947d80dbf9fec6e320c3d1"> 1995</a></span>  <span class="keywordflow">if</span> (node < num_nodes_) <span class="keywordflow">return</span>;</div><div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>  DCHECK(!const_capacities_ || node < node_capacity_);</div><div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>  num_nodes_ = node + 1;</div><div class="line"><a name="l01998"></a><span class="lineno"> 1998</span> }</div><div class="line"><a name="l01999"></a><span class="lineno"> 1999</span> </div><div class="line"><a name="l02000"></a><span class="lineno"> 2000</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02001"></a><span class="lineno"> 2001</span> ArcIndexType <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a362fa49b586ff223477aab7a53d17f14">ReverseArcMixedGraph<NodeIndexType, ArcIndexType>::AddArc</a>(</div><div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>  NodeIndexType tail, NodeIndexType head) {</div><div class="line"><a name="l02003"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph.html#a362fa49b586ff223477aab7a53d17f14"> 2003</a></span>  DCHECK_GE(tail, 0);</div><div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>  DCHECK_GE(head, 0);</div><div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>  AddNode(tail > head ? tail : head);</div><div class="line"><a name="l02006"></a><span class="lineno"> 2006</span> </div><div class="line"><a name="l02007"></a><span class="lineno"> 2007</span>  <span class="comment">// We inverse head and tail here because it is more convenient this way</span></div><div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>  <span class="comment">// during build time, see Build().</span></div><div class="line"><a name="l02009"></a><span class="lineno"> 2009</span>  head_.grow(head, tail);</div><div class="line"><a name="l02010"></a><span class="lineno"> 2010</span>  DCHECK(!const_capacities_ || num_arcs_ < arc_capacity_);</div><div class="line"><a name="l02011"></a><span class="lineno"> 2011</span>  <span class="keywordflow">return</span> num_arcs_++;</div><div class="line"><a name="l02012"></a><span class="lineno"> 2012</span> }</div><div class="line"><a name="l02013"></a><span class="lineno"> 2013</span> </div><div class="line"><a name="l02014"></a><span class="lineno"> 2014</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02015"></a><span class="lineno"> 2015</span> <span class="keywordtype">void</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a06e56a529396bbd2595f5c32c2f73142">ReverseArcMixedGraph<NodeIndexType, ArcIndexType>::Build</a>(</div><div class="line"><a name="l02016"></a><span class="lineno"> 2016</span>  std::vector<ArcIndexType>* permutation) {</div><div class="line"><a name="l02017"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph.html#aba7702cbe355fc0d1c7d1a67d07ba2bc"> 2017</a></span>  DCHECK(!is_built_);</div><div class="line"><a name="l02018"></a><span class="lineno"> 2018</span>  <span class="keywordflow">if</span> (is_built_) <span class="keywordflow">return</span>;</div><div class="line"><a name="l02019"></a><span class="lineno"> 2019</span>  is_built_ = <span class="keyword">true</span>;</div><div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>  node_capacity_ = num_nodes_;</div><div class="line"><a name="l02021"></a><span class="lineno"> 2021</span>  arc_capacity_ = num_arcs_;</div><div class="line"><a name="l02022"></a><span class="lineno"> 2022</span>  this->FreezeCapacities();</div><div class="line"><a name="l02023"></a><span class="lineno"> 2023</span>  this->BuildStartAndForwardHead(&head_, &start_, permutation);</div><div class="line"><a name="l02024"></a><span class="lineno"> 2024</span> </div><div class="line"><a name="l02025"></a><span class="lineno"> 2025</span>  <span class="comment">// Fill tails.</span></div><div class="line"><a name="l02026"></a><span class="lineno"> 2026</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> NodeIndexType node : Base::AllNodes()) {</div><div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ArcIndexType arc : OutgoingArcs(node)) {</div><div class="line"><a name="l02028"></a><span class="lineno"> 2028</span>  head_[~arc] = node;</div><div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>  }</div><div class="line"><a name="l02030"></a><span class="lineno"> 2030</span>  }</div><div class="line"><a name="l02031"></a><span class="lineno"> 2031</span> </div><div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>  <span class="comment">// Fill information for iterating over reverse arcs.</span></div><div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>  reverse_start_.assign(num_nodes_, Base::kNilArc);</div><div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>  next_.reserve(num_arcs_);</div><div class="line"><a name="l02035"></a><span class="lineno"> 2035</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ArcIndexType arc : Base::AllForwardArcs()) {</div><div class="line"><a name="l02036"></a><span class="lineno"> 2036</span>  next_.push_back(reverse_start_[Head(arc)]);</div><div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>  reverse_start_[Head(arc)] = -next_.size();</div><div class="line"><a name="l02038"></a><span class="lineno"> 2038</span>  }</div><div class="line"><a name="l02039"></a><span class="lineno"> 2039</span> }</div><div class="line"><a name="l02040"></a><span class="lineno"> 2040</span> </div><div class="line"><a name="l02041"></a><span class="lineno"> 2041</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02042"></a><span class="lineno"> 2042</span> <span class="keyword">class </span>ReverseArcMixedGraph<NodeIndexType, ArcIndexType>::OutgoingArcIterator {</div><div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l02044"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingArcIterator.html"> 2044</a></span>  <a class="code" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingArcIterator.html">OutgoingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html">ReverseArcMixedGraph</a>& graph, NodeIndexType node)</div><div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>  : index_(graph.start_[node]), limit_(graph.DirectArcLimit(node)) {}</div><div class="line"><a name="l02046"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingArcIterator.html#a13eb1d6a9e203dbcc707e1b226a3fc2d"> 2046</a></span>  <a class="code" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingArcIterator.html#a13eb1d6a9e203dbcc707e1b226a3fc2d">OutgoingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html">ReverseArcMixedGraph</a>& graph, NodeIndexType node,</div><div class="line"><a name="l02047"></a><span class="lineno"> 2047</span>  ArcIndexType arc)</div><div class="line"><a name="l02048"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingArcIterator.html#a9c3b33ea848d57f4acf0673b9e239919"> 2048</a></span>  : index_(arc), limit_(graph.DirectArcLimit(node)) {</div><div class="line"><a name="l02049"></a><span class="lineno"> 2049</span>  DCHECK_GE(arc, graph.start_[node]);</div><div class="line"><a name="l02050"></a><span class="lineno"> 2050</span>  }</div><div class="line"><a name="l02051"></a><span class="lineno"> 2051</span> </div><div class="line"><a name="l02052"></a><span class="lineno"> 2052</span>  <span class="keywordtype">bool</span> Ok()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_ < limit_; }</div><div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>  ArcIndexType Index()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_; }</div><div class="line"><a name="l02054"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingArcIterator.html#a2f4eeac98c28c959041b6632f7a56d24"> 2054</a></span>  <span class="keywordtype">void</span> <a class="code" href="one__tree__lower__bound_8h.html#a3947d19ac087ef2cd68c2409920339c4">Next</a>() {</div><div class="line"><a name="l02055"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingArcIterator.html#a82101ea1e7f7a3c7ea7b9b12cef57caf"> 2055</a></span>  DCHECK(Ok());</div><div class="line"><a name="l02056"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingArcIterator.html#a172d9883e9d4efe61c986ff0648a1f3d"> 2056</a></span>  index_++;</div><div class="line"><a name="l02057"></a><span class="lineno"> 2057</span>  }</div><div class="line"><a name="l02058"></a><span class="lineno"> 2058</span> </div><div class="line"><a name="l02059"></a><span class="lineno"> 2059</span>  <span class="comment">// TODO(user): we lose a bit by returning a BeginEndWrapper<> on top of this</span></div><div class="line"><a name="l02060"></a><span class="lineno"> 2060</span>  <span class="comment">// iterator rather than a simple IntegerRange on the arc indices.</span></div><div class="line"><a name="l02061"></a><span class="lineno"> 2061</span>  <a class="code" href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0">DEFINE_STL_ITERATOR_FUNCTIONS</a>(<a class="code" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingArcIterator.html">OutgoingArcIterator</a>);</div><div class="line"><a name="l02062"></a><span class="lineno"> 2062</span> </div><div class="line"><a name="l02063"></a><span class="lineno"> 2063</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l02064"></a><span class="lineno"> 2064</span>  ArcIndexType index_;</div><div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>  <span class="keyword">const</span> ArcIndexType limit_;</div><div class="line"><a name="l02066"></a><span class="lineno"> 2066</span> };</div><div class="line"><a name="l02067"></a><span class="lineno"> 2067</span> </div><div class="line"><a name="l02068"></a><span class="lineno"> 2068</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02069"></a><span class="lineno"> 2069</span> <span class="keyword">class </span><a class="code" href="classutil_1_1ReverseArcMixedGraph.html">ReverseArcMixedGraph</a><NodeIndexType,</div><div class="line"><a name="l02070"></a><span class="lineno"> 2070</span>  ArcIndexType>::OppositeIncomingArcIterator {</div><div class="line"><a name="l02071"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html"> 2071</a></span>  <span class="keyword">public</span>:</div><div class="line"><a name="l02072"></a><span class="lineno"> 2072</span>  <a class="code" href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html">ReverseArcMixedGraph</a>& graph,</div><div class="line"><a name="l02073"></a><span class="lineno"> 2073</span>  NodeIndexType node)</div><div class="line"><a name="l02074"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html#af5d41536081e936a3a2075ea225f8853"> 2074</a></span>  : graph_(&graph) {</div><div class="line"><a name="l02075"></a><span class="lineno"> 2075</span>  DCHECK(graph.is_built_);</div><div class="line"><a name="l02076"></a><span class="lineno"> 2076</span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l02077"></a><span class="lineno"> 2077</span>  index_ = graph.reverse_start_[node];</div><div class="line"><a name="l02078"></a><span class="lineno"> 2078</span>  }</div><div class="line"><a name="l02079"></a><span class="lineno"> 2079</span>  <a class="code" href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html">ReverseArcMixedGraph</a>& graph,</div><div class="line"><a name="l02080"></a><span class="lineno"> 2080</span>  NodeIndexType node, ArcIndexType arc)</div><div class="line"><a name="l02081"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html#a882d40b046e4c26955b28965019df078"> 2081</a></span>  : graph_(&graph), index_(arc) {</div><div class="line"><a name="l02082"></a><span class="lineno"> 2082</span>  DCHECK(graph.is_built_);</div><div class="line"><a name="l02083"></a><span class="lineno"> 2083</span>  DCHECK(graph.IsNodeValid(node));</div><div class="line"><a name="l02084"></a><span class="lineno"> 2084</span>  DCHECK(arc == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a> || arc < 0);</div><div class="line"><a name="l02085"></a><span class="lineno"> 2085</span>  DCHECK(arc == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a> || graph.Tail(arc) == node);</div><div class="line"><a name="l02086"></a><span class="lineno"> 2086</span>  }</div><div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>  <span class="keywordtype">bool</span> Ok()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_ != <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a>; }</div><div class="line"><a name="l02088"></a><span class="lineno"> 2088</span>  ArcIndexType Index()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_; }</div><div class="line"><a name="l02089"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html#aec415bacb2abe19796f3aadee8c81443"> 2089</a></span>  <span class="keywordtype">void</span> <a class="code" href="one__tree__lower__bound_8h.html#a3947d19ac087ef2cd68c2409920339c4">Next</a>() {</div><div class="line"><a name="l02090"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html#a74bc7e56984af8afd7d65f8e77588778"> 2090</a></span>  DCHECK(Ok());</div><div class="line"><a name="l02091"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html#a8dd74217ea5f69b6e8b9ee60d630ac44"> 2091</a></span>  index_ = graph_->next_[~index_];</div><div class="line"><a name="l02092"></a><span class="lineno"> 2092</span>  }</div><div class="line"><a name="l02093"></a><span class="lineno"> 2093</span> </div><div class="line"><a name="l02094"></a><span class="lineno"> 2094</span>  <a class="code" href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0">DEFINE_STL_ITERATOR_FUNCTIONS</a>(<a class="code" href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a>);</div><div class="line"><a name="l02095"></a><span class="lineno"> 2095</span> </div><div class="line"><a name="l02096"></a><span class="lineno"> 2096</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l02097"></a><span class="lineno"> 2097</span>  <span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html">ReverseArcMixedGraph</a>* graph_;</div><div class="line"><a name="l02098"></a><span class="lineno"> 2098</span>  ArcIndexType index_;</div><div class="line"><a name="l02099"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html#a53f8e0b613096680b6c1aa72b04ef02a"> 2099</a></span> };</div><div class="line"><a name="l02100"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html#a3795cf3a06e595f99910b3ff9269c4b7"> 2100</a></span> </div><div class="line"><a name="l02101"></a><span class="lineno"> 2101</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02102"></a><span class="lineno"> 2102</span> <span class="keyword">class </span><a class="code" href="classutil_1_1ReverseArcMixedGraph.html">ReverseArcMixedGraph</a><NodeIndexType, ArcIndexType>::<a class="code" href="classutil_1_1ReverseArcMixedGraph_1_1IncomingArcIterator.html">IncomingArcIterator</a></div><div class="line"><a name="l02103"></a><span class="lineno"> 2103</span>  : <span class="keyword">public</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a> {</div><div class="line"><a name="l02104"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1IncomingArcIterator.html"> 2104</a></span>  <span class="keyword">public</span>:</div><div class="line"><a name="l02105"></a><span class="lineno"> 2105</span>  <a class="code" href="classutil_1_1ReverseArcMixedGraph_1_1IncomingArcIterator.html">IncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html">ReverseArcMixedGraph</a>& graph, NodeIndexType node)</div><div class="line"><a name="l02106"></a><span class="lineno"> 2106</span>  : <a class="code" href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a>(graph, node) {}</div><div class="line"><a name="l02107"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1IncomingArcIterator.html#a50b5c385ecfc9ebc4e13b0bc667d0cff"> 2107</a></span>  <a class="code" href="classutil_1_1ReverseArcMixedGraph_1_1IncomingArcIterator.html#a50b5c385ecfc9ebc4e13b0bc667d0cff">IncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html">ReverseArcMixedGraph</a>& graph, NodeIndexType node,</div><div class="line"><a name="l02108"></a><span class="lineno"> 2108</span>  ArcIndexType arc)</div><div class="line"><a name="l02109"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1IncomingArcIterator.html#aba6ef39793d4ac8a059665c6de3c1f0b"> 2109</a></span>  : <a class="code" href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html">OppositeIncomingArcIterator</a>(</div><div class="line"><a name="l02110"></a><span class="lineno"> 2110</span>  graph, node, arc == <a class="code" href="classutil_1_1BaseGraph.html">Base</a>::<a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">kNilArc</a> ? arc : graph.<a class="code" href="classutil_1_1ReverseArcMixedGraph.html#a86effffe3928593a808edf548dd6b832">OppositeArc</a>(arc)) {}</div><div class="line"><a name="l02111"></a><span class="lineno"> 2111</span>  ArcIndexType Index()<span class="keyword"> const </span>{</div><div class="line"><a name="l02112"></a><span class="lineno"> 2112</span>  <span class="keywordflow">return</span> this->index_ == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a></div><div class="line"><a name="l02113"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1IncomingArcIterator.html#a6946d286256386efdfab71806f2b3122"> 2113</a></span>  ? <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a></div><div class="line"><a name="l02114"></a><span class="lineno"> 2114</span>  : this->graph_->OppositeArc(this->index_);</div><div class="line"><a name="l02115"></a><span class="lineno"> 2115</span>  }</div><div class="line"><a name="l02116"></a><span class="lineno"> 2116</span> </div><div class="line"><a name="l02117"></a><span class="lineno"> 2117</span>  <a class="code" href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0">DEFINE_STL_ITERATOR_FUNCTIONS</a>(<a class="code" href="classutil_1_1ReverseArcMixedGraph_1_1IncomingArcIterator.html">IncomingArcIterator</a>);</div><div class="line"><a name="l02118"></a><span class="lineno"> 2118</span> };</div><div class="line"><a name="l02119"></a><span class="lineno"> 2119</span> </div><div class="line"><a name="l02120"></a><span class="lineno"> 2120</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02121"></a><span class="lineno"> 2121</span> <span class="keyword">class </span><a class="code" href="classutil_1_1ReverseArcMixedGraph.html">ReverseArcMixedGraph</a><</div><div class="line"><a name="l02122"></a><span class="lineno"> 2122</span>  NodeIndexType, ArcIndexType>::OutgoingOrOppositeIncomingArcIterator {</div><div class="line"><a name="l02123"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingOrOppositeIncomingArcIterator.html"> 2123</a></span>  <span class="keyword">public</span>:</div><div class="line"><a name="l02124"></a><span class="lineno"> 2124</span>  <a class="code" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingOrOppositeIncomingArcIterator.html">OutgoingOrOppositeIncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html">ReverseArcMixedGraph</a>& graph,</div><div class="line"><a name="l02125"></a><span class="lineno"> 2125</span>  NodeIndexType node)</div><div class="line"><a name="l02126"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#aff95fdc437a0d963e9b4937cc4ad10b4"> 2126</a></span>  : graph_(&graph) {</div><div class="line"><a name="l02127"></a><span class="lineno"> 2127</span>  limit_ = graph.DirectArcLimit(node); <span class="comment">// also DCHECKs node and is_built_.</span></div><div class="line"><a name="l02128"></a><span class="lineno"> 2128</span>  index_ = graph.reverse_start_[node];</div><div class="line"><a name="l02129"></a><span class="lineno"> 2129</span>  restart_ = graph.start_[node];</div><div class="line"><a name="l02130"></a><span class="lineno"> 2130</span>  <span class="keywordflow">if</span> (index_ == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a>) {</div><div class="line"><a name="l02131"></a><span class="lineno"> 2131</span>  index_ = restart_;</div><div class="line"><a name="l02132"></a><span class="lineno"> 2132</span>  }</div><div class="line"><a name="l02133"></a><span class="lineno"> 2133</span>  }</div><div class="line"><a name="l02134"></a><span class="lineno"> 2134</span>  <a class="code" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingOrOppositeIncomingArcIterator.html">OutgoingOrOppositeIncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html">ReverseArcMixedGraph</a>& graph,</div><div class="line"><a name="l02135"></a><span class="lineno"> 2135</span>  NodeIndexType node, ArcIndexType arc)</div><div class="line"><a name="l02136"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#af353e150020f4320d272c334bcae08c5"> 2136</a></span>  : graph_(&graph) {</div><div class="line"><a name="l02137"></a><span class="lineno"> 2137</span>  limit_ = graph.DirectArcLimit(node);</div><div class="line"><a name="l02138"></a><span class="lineno"> 2138</span>  index_ = arc;</div><div class="line"><a name="l02139"></a><span class="lineno"> 2139</span>  restart_ = graph.start_[node];</div><div class="line"><a name="l02140"></a><span class="lineno"> 2140</span>  DCHECK(arc == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a> || arc == limit_ || graph.Tail(arc) == node);</div><div class="line"><a name="l02141"></a><span class="lineno"> 2141</span>  }</div><div class="line"><a name="l02142"></a><span class="lineno"> 2142</span>  <span class="keywordtype">bool</span> Ok()<span class="keyword"> const </span>{</div><div class="line"><a name="l02143"></a><span class="lineno"> 2143</span>  <span class="comment">// Note that we always have limit_ <= Base::kNilArc.</span></div><div class="line"><a name="l02144"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#a2ce27aff47f5f917d2638855a11006b6"> 2144</a></span>  <span class="keywordflow">return</span> index_ < limit_;</div><div class="line"><a name="l02145"></a><span class="lineno"> 2145</span>  }</div><div class="line"><a name="l02146"></a><span class="lineno"> 2146</span>  ArcIndexType Index()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_; }</div><div class="line"><a name="l02147"></a><span class="lineno"> 2147</span>  <span class="keywordtype">void</span> <a class="code" href="one__tree__lower__bound_8h.html#a3947d19ac087ef2cd68c2409920339c4">Next</a>() {</div><div class="line"><a name="l02148"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#a07692556f6a74a6ec520e943ce00e980"> 2148</a></span>  DCHECK(Ok());</div><div class="line"><a name="l02149"></a><span class="lineno"><a class="line" href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#a9b465c88524b5b71c10d0d78dc3015f3"> 2149</a></span>  <span class="keywordflow">if</span> (index_ < 0) {</div><div class="line"><a name="l02150"></a><span class="lineno"> 2150</span>  index_ = graph_->next_[graph_->OppositeArc(index_)];</div><div class="line"><a name="l02151"></a><span class="lineno"> 2151</span>  <span class="keywordflow">if</span> (index_ == <a class="code" href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">Base::kNilArc</a>) {</div><div class="line"><a name="l02152"></a><span class="lineno"> 2152</span>  index_ = restart_;</div><div class="line"><a name="l02153"></a><span class="lineno"> 2153</span>  }</div><div class="line"><a name="l02154"></a><span class="lineno"> 2154</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l02155"></a><span class="lineno"> 2155</span>  index_++;</div><div class="line"><a name="l02156"></a><span class="lineno"> 2156</span>  }</div><div class="line"><a name="l02157"></a><span class="lineno"> 2157</span>  }</div><div class="line"><a name="l02158"></a><span class="lineno"> 2158</span> </div><div class="line"><a name="l02159"></a><span class="lineno"> 2159</span>  <a class="code" href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0">DEFINE_STL_ITERATOR_FUNCTIONS</a>(OutgoingOrOppositeIncomingArcIterator);</div><div class="line"><a name="l02160"></a><span class="lineno"> 2160</span> </div><div class="line"><a name="l02161"></a><span class="lineno"> 2161</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l02162"></a><span class="lineno"> 2162</span>  <span class="keyword">const</span> <a class="code" href="classutil_1_1ReverseArcMixedGraph.html#af10d16de8964a7abf555759bb9f257aa">ReverseArcMixedGraph</a>* graph_;</div><div class="line"><a name="l02163"></a><span class="lineno"> 2163</span>  ArcIndexType index_;</div><div class="line"><a name="l02164"></a><span class="lineno"> 2164</span>  ArcIndexType restart_;</div><div class="line"><a name="l02165"></a><span class="lineno"> 2165</span>  ArcIndexType limit_;</div><div class="line"><a name="l02166"></a><span class="lineno"> 2166</span> };</div><div class="line"><a name="l02167"></a><span class="lineno"> 2167</span> </div><div class="line"><a name="l02168"></a><span class="lineno"> 2168</span> <span class="comment">// CompleteGraph implementation ------------------------------------------------</span></div><div class="line"><a name="l02169"></a><span class="lineno"> 2169</span> <span class="comment">// Nodes and arcs are implicit and not stored.</span></div><div class="line"><a name="l02170"></a><span class="lineno"> 2170</span> </div><div class="line"><a name="l02171"></a><span class="lineno"> 2171</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType = <span class="keywordtype">int</span>32, <span class="keyword">typename</span> ArcIndexType = <span class="keywordtype">int</span>32></div><div class="line"><a name="l02172"></a><span class="lineno"> 2172</span> <span class="keyword">class </span>CompleteGraph : <span class="keyword">public</span> BaseGraph<NodeIndexType, ArcIndexType, false> {</div><div class="line"><a name="l02173"></a><span class="lineno"> 2173</span>  <span class="keyword">typedef</span> BaseGraph<NodeIndexType, ArcIndexType, false> Base;</div><div class="line"><a name="l02174"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteGraph.html"> 2174</a></span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a895e891d1ad52ce3efcfeb7ba11194c7">Base::arc_capacity_</a>;</div><div class="line"><a name="l02175"></a><span class="lineno"> 2175</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#aa980e5526b9ded17a83928fc339c71e4">Base::const_capacities_</a>;</div><div class="line"><a name="l02176"></a><span class="lineno"> 2176</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a424bd34a9767e7edeaf3a60ecd3cb000">Base::node_capacity_</a>;</div><div class="line"><a name="l02177"></a><span class="lineno"> 2177</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">Base::num_arcs_</a>;</div><div class="line"><a name="l02178"></a><span class="lineno"> 2178</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">Base::num_nodes_</a>;</div><div class="line"><a name="l02179"></a><span class="lineno"> 2179</span> </div><div class="line"><a name="l02180"></a><span class="lineno"> 2180</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l02181"></a><span class="lineno"> 2181</span>  <span class="comment">// Builds a complete graph with num_nodes nodes.</span></div><div class="line"><a name="l02182"></a><span class="lineno"> 2182</span>  <span class="keyword">explicit</span> <a class="code" href="classutil_1_1CompleteGraph.html#ad3401c3d9df9b08cd9be279464029a32">CompleteGraph</a>(NodeIndexType <a class="code" href="classutil_1_1BaseGraph.html#a0f551c921fa0b5aaa334a6e36f61db4a">num_nodes</a>) {</div><div class="line"><a name="l02183"></a><span class="lineno"> 2183</span>  this-><a class="code" href="classutil_1_1BaseGraph.html#ab731ca5c638e7b1b0a2c459c94a90f55">Reserve</a>(num_nodes, <a class="code" href="classutil_1_1BaseGraph.html#a0f551c921fa0b5aaa334a6e36f61db4a">num_nodes</a> * <a class="code" href="classutil_1_1BaseGraph.html#a0f551c921fa0b5aaa334a6e36f61db4a">num_nodes</a>);</div><div class="line"><a name="l02184"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteGraph.html#ad3401c3d9df9b08cd9be279464029a32"> 2184</a></span>  this-><a class="code" href="classutil_1_1BaseGraph.html#aa3bd051d1e141b09dda17aa9b5f24f69">FreezeCapacities</a>();</div><div class="line"><a name="l02185"></a><span class="lineno"> 2185</span>  <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">num_nodes_</a> = <a class="code" href="classutil_1_1BaseGraph.html#a0f551c921fa0b5aaa334a6e36f61db4a">num_nodes</a>;</div><div class="line"><a name="l02186"></a><span class="lineno"> 2186</span>  num_arcs_ = <a class="code" href="classutil_1_1BaseGraph.html#a0f551c921fa0b5aaa334a6e36f61db4a">num_nodes</a> * <a class="code" href="classutil_1_1BaseGraph.html#a0f551c921fa0b5aaa334a6e36f61db4a">num_nodes</a>;</div><div class="line"><a name="l02187"></a><span class="lineno"> 2187</span>  }</div><div class="line"><a name="l02188"></a><span class="lineno"> 2188</span> </div><div class="line"><a name="l02189"></a><span class="lineno"> 2189</span>  NodeIndexType <a class="code" href="classutil_1_1CompleteGraph.html#af32d9f7de8ae0ccb7a859794a8fa7329">Head</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l02190"></a><span class="lineno"> 2190</span>  NodeIndexType <a class="code" href="classutil_1_1CompleteGraph.html#aa6dc77def1cc80ffd14cb931a3043e52">Tail</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l02191"></a><span class="lineno"> 2191</span>  ArcIndexType <a class="code" href="classutil_1_1CompleteGraph.html#a715345c684f1cbeb1896f09ebd989dd1">OutDegree</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l02192"></a><span class="lineno"> 2192</span>  IntegerRange<ArcIndexType> <a class="code" href="classutil_1_1CompleteGraph.html#aa5561d57ac19a632ed3086e7f96fdbe6">OutgoingArcs</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l02193"></a><span class="lineno"> 2193</span>  IntegerRange<ArcIndexType> <a class="code" href="classutil_1_1CompleteGraph.html#a77b6facc3e744aa4ff764c9b9725e2d8">OutgoingArcsStartingFrom</a>(NodeIndexType node,</div><div class="line"><a name="l02194"></a><span class="lineno"> 2194</span>  ArcIndexType from) <span class="keyword">const</span>;</div><div class="line"><a name="l02195"></a><span class="lineno"> 2195</span>  IntegerRange<NodeIndexType> <a class="code" href="classutil_1_1CompleteGraph.html#ab12a266c0c091c00a150667619f491d4">operator[]</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l02196"></a><span class="lineno"> 2196</span> };</div><div class="line"><a name="l02197"></a><span class="lineno"> 2197</span> </div><div class="line"><a name="l02198"></a><span class="lineno"> 2198</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02199"></a><span class="lineno"> 2199</span> NodeIndexType <a class="code" href="classutil_1_1CompleteGraph.html#af32d9f7de8ae0ccb7a859794a8fa7329">CompleteGraph<NodeIndexType, ArcIndexType>::Head</a>(</div><div class="line"><a name="l02200"></a><span class="lineno"> 2200</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l02201"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteGraph.html#af32d9f7de8ae0ccb7a859794a8fa7329"> 2201</a></span>  DCHECK(this->IsArcValid(arc));</div><div class="line"><a name="l02202"></a><span class="lineno"> 2202</span>  <span class="keywordflow">return</span> arc % num_nodes_;</div><div class="line"><a name="l02203"></a><span class="lineno"> 2203</span> }</div><div class="line"><a name="l02204"></a><span class="lineno"> 2204</span> </div><div class="line"><a name="l02205"></a><span class="lineno"> 2205</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02206"></a><span class="lineno"> 2206</span> NodeIndexType <a class="code" href="classutil_1_1CompleteGraph.html#aa6dc77def1cc80ffd14cb931a3043e52">CompleteGraph<NodeIndexType, ArcIndexType>::Tail</a>(</div><div class="line"><a name="l02207"></a><span class="lineno"> 2207</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l02208"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteGraph.html#aa6dc77def1cc80ffd14cb931a3043e52"> 2208</a></span>  DCHECK(this->IsArcValid(arc));</div><div class="line"><a name="l02209"></a><span class="lineno"> 2209</span>  <span class="keywordflow">return</span> arc / num_nodes_;</div><div class="line"><a name="l02210"></a><span class="lineno"> 2210</span> }</div><div class="line"><a name="l02211"></a><span class="lineno"> 2211</span> </div><div class="line"><a name="l02212"></a><span class="lineno"> 2212</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02213"></a><span class="lineno"> 2213</span> ArcIndexType <a class="code" href="classutil_1_1CompleteGraph.html#a715345c684f1cbeb1896f09ebd989dd1">CompleteGraph<NodeIndexType, ArcIndexType>::OutDegree</a>(</div><div class="line"><a name="l02214"></a><span class="lineno"> 2214</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l02215"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteGraph.html#a715345c684f1cbeb1896f09ebd989dd1"> 2215</a></span>  <span class="keywordflow">return</span> num_nodes_;</div><div class="line"><a name="l02216"></a><span class="lineno"> 2216</span> }</div><div class="line"><a name="l02217"></a><span class="lineno"> 2217</span> </div><div class="line"><a name="l02218"></a><span class="lineno"> 2218</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02219"></a><span class="lineno"> 2219</span> IntegerRange<ArcIndexType></div><div class="line"><a name="l02220"></a><span class="lineno"> 2220</span> <a class="code" href="classutil_1_1CompleteGraph.html#aa5561d57ac19a632ed3086e7f96fdbe6">CompleteGraph<NodeIndexType, ArcIndexType>::OutgoingArcs</a>(</div><div class="line"><a name="l02221"></a><span class="lineno"> 2221</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l02222"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteGraph.html#aa5561d57ac19a632ed3086e7f96fdbe6"> 2222</a></span>  DCHECK_LT(node, num_nodes_);</div><div class="line"><a name="l02223"></a><span class="lineno"> 2223</span>  <span class="keywordflow">return</span> IntegerRange<ArcIndexType>(</div><div class="line"><a name="l02224"></a><span class="lineno"> 2224</span>  static_cast<ArcIndexType>(num_nodes_) * node,</div><div class="line"><a name="l02225"></a><span class="lineno"> 2225</span>  static_cast<ArcIndexType>(num_nodes_) * (node + 1));</div><div class="line"><a name="l02226"></a><span class="lineno"> 2226</span> }</div><div class="line"><a name="l02227"></a><span class="lineno"> 2227</span> </div><div class="line"><a name="l02228"></a><span class="lineno"> 2228</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02229"></a><span class="lineno"> 2229</span> IntegerRange<ArcIndexType></div><div class="line"><a name="l02230"></a><span class="lineno"> 2230</span> <a class="code" href="classutil_1_1CompleteGraph.html#a77b6facc3e744aa4ff764c9b9725e2d8">CompleteGraph<NodeIndexType, ArcIndexType>::OutgoingArcsStartingFrom</a>(</div><div class="line"><a name="l02231"></a><span class="lineno"> 2231</span>  NodeIndexType node, ArcIndexType from)<span class="keyword"> const </span>{</div><div class="line"><a name="l02232"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteGraph.html#a77b6facc3e744aa4ff764c9b9725e2d8"> 2232</a></span>  DCHECK_LT(node, num_nodes_);</div><div class="line"><a name="l02233"></a><span class="lineno"> 2233</span>  <span class="keywordflow">return</span> IntegerRange<ArcIndexType>(</div><div class="line"><a name="l02234"></a><span class="lineno"> 2234</span>  from, static_cast<ArcIndexType>(num_nodes_) * (node + 1));</div><div class="line"><a name="l02235"></a><span class="lineno"> 2235</span> }</div><div class="line"><a name="l02236"></a><span class="lineno"> 2236</span> </div><div class="line"><a name="l02237"></a><span class="lineno"> 2237</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02238"></a><span class="lineno"> 2238</span> IntegerRange<NodeIndexType></div><div class="line"><a name="l02239"></a><span class="lineno"> 2239</span>  <a class="code" href="classutil_1_1CompleteGraph.html#ab12a266c0c091c00a150667619f491d4">CompleteGraph<NodeIndexType, ArcIndexType>::operator[]</a>(</div><div class="line"><a name="l02240"></a><span class="lineno"> 2240</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l02241"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteGraph.html#ab12a266c0c091c00a150667619f491d4"> 2241</a></span>  DCHECK_LT(node, num_nodes_);</div><div class="line"><a name="l02242"></a><span class="lineno"> 2242</span>  <span class="keywordflow">return</span> IntegerRange<NodeIndexType>(0, num_nodes_);</div><div class="line"><a name="l02243"></a><span class="lineno"> 2243</span> }</div><div class="line"><a name="l02244"></a><span class="lineno"> 2244</span> </div><div class="line"><a name="l02245"></a><span class="lineno"> 2245</span> <span class="comment">// CompleteBipartiteGraph implementation ---------------------------------------</span></div><div class="line"><a name="l02246"></a><span class="lineno"> 2246</span> <span class="comment">// Nodes and arcs are implicit and not stored.</span></div><div class="line"><a name="l02247"></a><span class="lineno"> 2247</span> </div><div class="line"><a name="l02248"></a><span class="lineno"> 2248</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType = <span class="keywordtype">int</span>32, <span class="keyword">typename</span> ArcIndexType = <span class="keywordtype">int</span>32></div><div class="line"><a name="l02249"></a><span class="lineno"> 2249</span> <span class="keyword">class </span><a class="code" href="classutil_1_1CompleteBipartiteGraph.html">CompleteBipartiteGraph</a></div><div class="line"><a name="l02250"></a><span class="lineno"> 2250</span>  : <span class="keyword">public</span> <a class="code" href="classutil_1_1BaseGraph.html">BaseGraph</a><NodeIndexType, ArcIndexType, false> {</div><div class="line"><a name="l02251"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteBipartiteGraph.html"> 2251</a></span>  <span class="keyword">typedef</span> <a class="code" href="classutil_1_1BaseGraph.html">BaseGraph<NodeIndexType, ArcIndexType, false></a> <a class="code" href="classutil_1_1BaseGraph.html">Base</a>;</div><div class="line"><a name="l02252"></a><span class="lineno"> 2252</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a895e891d1ad52ce3efcfeb7ba11194c7">Base::arc_capacity_</a>;</div><div class="line"><a name="l02253"></a><span class="lineno"> 2253</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#aa980e5526b9ded17a83928fc339c71e4">Base::const_capacities_</a>;</div><div class="line"><a name="l02254"></a><span class="lineno"> 2254</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a424bd34a9767e7edeaf3a60ecd3cb000">Base::node_capacity_</a>;</div><div class="line"><a name="l02255"></a><span class="lineno"> 2255</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">Base::num_arcs_</a>;</div><div class="line"><a name="l02256"></a><span class="lineno"> 2256</span>  <span class="keyword">using</span> <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">Base::num_nodes_</a>;</div><div class="line"><a name="l02257"></a><span class="lineno"> 2257</span> </div><div class="line"><a name="l02258"></a><span class="lineno"> 2258</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l02259"></a><span class="lineno"> 2259</span>  <span class="comment">// Builds a complete bipartite graph from a set of left nodes to a set of</span></div><div class="line"><a name="l02260"></a><span class="lineno"> 2260</span>  <span class="comment">// right nodes.</span></div><div class="line"><a name="l02261"></a><span class="lineno"> 2261</span>  <span class="comment">// Indices of left nodes of the bipartite graph range from 0 to left_nodes-1;</span></div><div class="line"><a name="l02262"></a><span class="lineno"> 2262</span>  <span class="comment">// indices of right nodes range from left_nodes to left_nodes+right_nodes-1.</span></div><div class="line"><a name="l02263"></a><span class="lineno"> 2263</span>  <a class="code" href="classutil_1_1CompleteBipartiteGraph.html#a63dffe1efb9b218697c5658752d2f557">CompleteBipartiteGraph</a>(NodeIndexType left_nodes, NodeIndexType right_nodes)</div><div class="line"><a name="l02264"></a><span class="lineno"> 2264</span>  : left_nodes_(left_nodes), right_nodes_(right_nodes) {</div><div class="line"><a name="l02265"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteBipartiteGraph.html#a63dffe1efb9b218697c5658752d2f557"> 2265</a></span>  this-><a class="code" href="classutil_1_1BaseGraph.html#ab731ca5c638e7b1b0a2c459c94a90f55">Reserve</a>(left_nodes + right_nodes, left_nodes * right_nodes);</div><div class="line"><a name="l02266"></a><span class="lineno"> 2266</span>  this-><a class="code" href="classutil_1_1BaseGraph.html#aa3bd051d1e141b09dda17aa9b5f24f69">FreezeCapacities</a>();</div><div class="line"><a name="l02267"></a><span class="lineno"> 2267</span>  <a class="code" href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">num_nodes_</a> = left_nodes + right_nodes;</div><div class="line"><a name="l02268"></a><span class="lineno"> 2268</span>  <a class="code" href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">num_arcs_</a> = left_nodes * right_nodes;</div><div class="line"><a name="l02269"></a><span class="lineno"> 2269</span>  }</div><div class="line"><a name="l02270"></a><span class="lineno"> 2270</span> </div><div class="line"><a name="l02271"></a><span class="lineno"> 2271</span>  NodeIndexType <a class="code" href="classutil_1_1CompleteBipartiteGraph.html#ad68ad92884b0ed0e3b2eb6888a6eebea">Head</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l02272"></a><span class="lineno"> 2272</span>  NodeIndexType <a class="code" href="classutil_1_1CompleteBipartiteGraph.html#a31e96f6c4453535f09ba76224fd4628a">Tail</a>(ArcIndexType arc) <span class="keyword">const</span>;</div><div class="line"><a name="l02273"></a><span class="lineno"> 2273</span>  ArcIndexType <a class="code" href="classutil_1_1CompleteBipartiteGraph.html#acf1c65e6f320741ffab9a8717ac4ba28">OutDegree</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l02274"></a><span class="lineno"> 2274</span>  IntegerRange<ArcIndexType> <a class="code" href="classutil_1_1CompleteBipartiteGraph.html#a8e4bf50d021c9ed65c6da43b6ed014ae">OutgoingArcs</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l02275"></a><span class="lineno"> 2275</span>  IntegerRange<ArcIndexType> <a class="code" href="classutil_1_1CompleteBipartiteGraph.html#a6c20eacdf4ddd2af4c40b1fcce27ada9">OutgoingArcsStartingFrom</a>(NodeIndexType node,</div><div class="line"><a name="l02276"></a><span class="lineno"> 2276</span>  ArcIndexType from) <span class="keyword">const</span>;</div><div class="line"><a name="l02277"></a><span class="lineno"> 2277</span>  IntegerRange<NodeIndexType> <a class="code" href="classutil_1_1CompleteBipartiteGraph.html#ae2e3523b6d6cdff67cbca55bdc2bcc4b">operator[]</a>(NodeIndexType node) <span class="keyword">const</span>;</div><div class="line"><a name="l02278"></a><span class="lineno"> 2278</span> </div><div class="line"><a name="l02279"></a><span class="lineno"> 2279</span>  <span class="comment">// Deprecated interface.</span></div><div class="line"><a name="l02280"></a><span class="lineno"> 2280</span>  <span class="keyword">class </span>OutgoingArcIterator {</div><div class="line"><a name="l02281"></a><span class="lineno"> 2281</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l02282"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator.html"> 2282</a></span>  <a class="code" href="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator.html#a0708b60d3463601fa36d682f1429f78a">OutgoingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1CompleteBipartiteGraph.html">CompleteBipartiteGraph</a>& graph, NodeIndexType node)</div><div class="line"><a name="l02283"></a><span class="lineno"> 2283</span>  : index_(graph.right_nodes_ * node),</div><div class="line"><a name="l02284"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator.html#a0708b60d3463601fa36d682f1429f78a"> 2284</a></span>  limit_(node >= graph.left_nodes_ ? index_</div><div class="line"><a name="l02285"></a><span class="lineno"> 2285</span>  : graph.right_nodes_ * (node + 1)) {}</div><div class="line"><a name="l02286"></a><span class="lineno"> 2286</span> </div><div class="line"><a name="l02287"></a><span class="lineno"> 2287</span>  <span class="keywordtype">bool</span> <a class="code" href="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator.html#a50be2d4453f8536677b936c48251ed71">Ok</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_ < limit_; }</div><div class="line"><a name="l02288"></a><span class="lineno"> 2288</span>  ArcIndexType <a class="code" href="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator.html#a87f4a00a8b306480db02d93fa87bf223">Index</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index_; }</div><div class="line"><a name="l02289"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator.html#a50be2d4453f8536677b936c48251ed71"> 2289</a></span>  <span class="keywordtype">void</span> <a class="code" href="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator.html#a35eeda0546643fca60129e9fa15e2a61">Next</a>() { index_++; }</div><div class="line"><a name="l02290"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator.html#a87f4a00a8b306480db02d93fa87bf223"> 2290</a></span> </div><div class="line"><a name="l02291"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator.html#a35eeda0546643fca60129e9fa15e2a61"> 2291</a></span>  <span class="keyword">private</span>:</div><div class="line"><a name="l02292"></a><span class="lineno"> 2292</span>  ArcIndexType index_;</div><div class="line"><a name="l02293"></a><span class="lineno"> 2293</span>  <span class="keyword">const</span> ArcIndexType limit_;</div><div class="line"><a name="l02294"></a><span class="lineno"> 2294</span>  };</div><div class="line"><a name="l02295"></a><span class="lineno"> 2295</span> </div><div class="line"><a name="l02296"></a><span class="lineno"> 2296</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l02297"></a><span class="lineno"> 2297</span>  <span class="keyword">const</span> NodeIndexType left_nodes_;</div><div class="line"><a name="l02298"></a><span class="lineno"> 2298</span>  <span class="keyword">const</span> NodeIndexType right_nodes_;</div><div class="line"><a name="l02299"></a><span class="lineno"> 2299</span> };</div><div class="line"><a name="l02300"></a><span class="lineno"> 2300</span> </div><div class="line"><a name="l02301"></a><span class="lineno"> 2301</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02302"></a><span class="lineno"> 2302</span> NodeIndexType <a class="code" href="classutil_1_1CompleteBipartiteGraph.html#ad68ad92884b0ed0e3b2eb6888a6eebea">CompleteBipartiteGraph<NodeIndexType, ArcIndexType>::Head</a>(</div><div class="line"><a name="l02303"></a><span class="lineno"> 2303</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l02304"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteBipartiteGraph.html#ad68ad92884b0ed0e3b2eb6888a6eebea"> 2304</a></span>  DCHECK(this->IsArcValid(arc));</div><div class="line"><a name="l02305"></a><span class="lineno"> 2305</span>  <span class="keywordflow">return</span> left_nodes_ + arc % right_nodes_;</div><div class="line"><a name="l02306"></a><span class="lineno"> 2306</span> }</div><div class="line"><a name="l02307"></a><span class="lineno"> 2307</span> </div><div class="line"><a name="l02308"></a><span class="lineno"> 2308</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02309"></a><span class="lineno"> 2309</span> NodeIndexType <a class="code" href="classutil_1_1CompleteBipartiteGraph.html#a31e96f6c4453535f09ba76224fd4628a">CompleteBipartiteGraph<NodeIndexType, ArcIndexType>::Tail</a>(</div><div class="line"><a name="l02310"></a><span class="lineno"> 2310</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l02311"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteBipartiteGraph.html#a31e96f6c4453535f09ba76224fd4628a"> 2311</a></span>  DCHECK(this->IsArcValid(arc));</div><div class="line"><a name="l02312"></a><span class="lineno"> 2312</span>  <span class="keywordflow">return</span> arc / right_nodes_;</div><div class="line"><a name="l02313"></a><span class="lineno"> 2313</span> }</div><div class="line"><a name="l02314"></a><span class="lineno"> 2314</span> </div><div class="line"><a name="l02315"></a><span class="lineno"> 2315</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02316"></a><span class="lineno"> 2316</span> ArcIndexType <a class="code" href="classutil_1_1CompleteBipartiteGraph.html#acf1c65e6f320741ffab9a8717ac4ba28">CompleteBipartiteGraph<NodeIndexType, ArcIndexType>::OutDegree</a>(</div><div class="line"><a name="l02317"></a><span class="lineno"> 2317</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l02318"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteBipartiteGraph.html#acf1c65e6f320741ffab9a8717ac4ba28"> 2318</a></span>  <span class="keywordflow">return</span> (node < left_nodes_) ? right_nodes_ : 0;</div><div class="line"><a name="l02319"></a><span class="lineno"> 2319</span> }</div><div class="line"><a name="l02320"></a><span class="lineno"> 2320</span> </div><div class="line"><a name="l02321"></a><span class="lineno"> 2321</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02322"></a><span class="lineno"> 2322</span> IntegerRange<ArcIndexType></div><div class="line"><a name="l02323"></a><span class="lineno"> 2323</span> <a class="code" href="classutil_1_1CompleteBipartiteGraph.html#a8e4bf50d021c9ed65c6da43b6ed014ae">CompleteBipartiteGraph<NodeIndexType, ArcIndexType>::OutgoingArcs</a>(</div><div class="line"><a name="l02324"></a><span class="lineno"> 2324</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l02325"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteBipartiteGraph.html#a8e4bf50d021c9ed65c6da43b6ed014ae"> 2325</a></span>  <span class="keywordflow">if</span> (node < left_nodes_) {</div><div class="line"><a name="l02326"></a><span class="lineno"> 2326</span>  <span class="keywordflow">return</span> IntegerRange<ArcIndexType>(right_nodes_ * node,</div><div class="line"><a name="l02327"></a><span class="lineno"> 2327</span>  right_nodes_ * (node + 1));</div><div class="line"><a name="l02328"></a><span class="lineno"> 2328</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l02329"></a><span class="lineno"> 2329</span>  <span class="keywordflow">return</span> IntegerRange<ArcIndexType>(0, 0);</div><div class="line"><a name="l02330"></a><span class="lineno"> 2330</span>  }</div><div class="line"><a name="l02331"></a><span class="lineno"> 2331</span> }</div><div class="line"><a name="l02332"></a><span class="lineno"> 2332</span> </div><div class="line"><a name="l02333"></a><span class="lineno"> 2333</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02334"></a><span class="lineno"> 2334</span> IntegerRange<ArcIndexType></div><div class="line"><a name="l02335"></a><span class="lineno"> 2335</span> <a class="code" href="classutil_1_1CompleteBipartiteGraph.html#a6c20eacdf4ddd2af4c40b1fcce27ada9">CompleteBipartiteGraph<NodeIndexType, ArcIndexType>::OutgoingArcsStartingFrom</a>(</div><div class="line"><a name="l02336"></a><span class="lineno"> 2336</span>  NodeIndexType node, ArcIndexType from)<span class="keyword"> const </span>{</div><div class="line"><a name="l02337"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteBipartiteGraph.html#a6c20eacdf4ddd2af4c40b1fcce27ada9"> 2337</a></span>  <span class="keywordflow">if</span> (node < left_nodes_) {</div><div class="line"><a name="l02338"></a><span class="lineno"> 2338</span>  <span class="keywordflow">return</span> IntegerRange<ArcIndexType>(from, right_nodes_ * (node + 1));</div><div class="line"><a name="l02339"></a><span class="lineno"> 2339</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l02340"></a><span class="lineno"> 2340</span>  <span class="keywordflow">return</span> IntegerRange<ArcIndexType>(0, 0);</div><div class="line"><a name="l02341"></a><span class="lineno"> 2341</span>  }</div><div class="line"><a name="l02342"></a><span class="lineno"> 2342</span> }</div><div class="line"><a name="l02343"></a><span class="lineno"> 2343</span> </div><div class="line"><a name="l02344"></a><span class="lineno"> 2344</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l02345"></a><span class="lineno"> 2345</span> IntegerRange<NodeIndexType></div><div class="line"><a name="l02346"></a><span class="lineno"> 2346</span>  <a class="code" href="classutil_1_1CompleteBipartiteGraph.html#ae2e3523b6d6cdff67cbca55bdc2bcc4b">CompleteBipartiteGraph<NodeIndexType, ArcIndexType>::operator[]</a>(</div><div class="line"><a name="l02347"></a><span class="lineno"> 2347</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l02348"></a><span class="lineno"><a class="line" href="classutil_1_1CompleteBipartiteGraph.html#ae2e3523b6d6cdff67cbca55bdc2bcc4b"> 2348</a></span>  <span class="keywordflow">if</span> (node < left_nodes_) {</div><div class="line"><a name="l02349"></a><span class="lineno"> 2349</span>  <span class="keywordflow">return</span> IntegerRange<NodeIndexType>(left_nodes_, left_nodes_ + right_nodes_);</div><div class="line"><a name="l02350"></a><span class="lineno"> 2350</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l02351"></a><span class="lineno"> 2351</span>  <span class="keywordflow">return</span> IntegerRange<NodeIndexType>(0, 0);</div><div class="line"><a name="l02352"></a><span class="lineno"> 2352</span>  }</div><div class="line"><a name="l02353"></a><span class="lineno"> 2353</span> }</div><div class="line"><a name="l02354"></a><span class="lineno"> 2354</span> </div><div class="line"><a name="l02355"></a><span class="lineno"> 2355</span> <span class="comment">// Defining the simplest Graph interface as Graph for convenience.</span></div><div class="line"><a name="l02356"></a><span class="lineno"> 2356</span> <span class="keyword">typedef</span> ListGraph<> <a class="code" href="namespaceutil.html#ae76339cb2dcd3bc05ad762146f91fdda">Graph</a>;</div><div class="line"><a name="l02357"></a><span class="lineno"> 2357</span> </div><div class="line"><a name="l02358"></a><span class="lineno"><a class="line" href="namespaceutil.html#ae76339cb2dcd3bc05ad762146f91fdda"> 2358</a></span> } <span class="comment">// namespace util</span></div><div class="line"><a name="l02359"></a><span class="lineno"> 2359</span> </div><div class="line"><a name="l02360"></a><span class="lineno"> 2360</span> <span class="preprocessor">#undef DEFINE_RANGE_BASED_ARC_ITERATION</span></div><div class="line"><a name="l02361"></a><span class="lineno"> 2361</span> <span class="preprocessor">#undef DEFINE_STL_ITERATOR_FUNCTIONS</span></div><div class="line"><a name="l02362"></a><span class="lineno"> 2362</span> </div><div class="line"><a name="l02363"></a><span class="lineno"> 2363</span> <span class="preprocessor">#endif // UTIL_GRAPH_GRAPH_H_</span></div><div class="ttc" id="classutil_1_1ListGraph_1_1OutgoingArcIterator_html"><div class="ttname"><a href="classutil_1_1ListGraph_1_1OutgoingArcIterator.html">util::ListGraph::OutgoingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01175">graph.h:1175</a></div></div>
|
|
<div class="ttc" id="namespaceutil_html_a37be0131ae922e30a286797a0bef0c96"><div class="ttname"><a href="namespaceutil.html#a37be0131ae922e30a286797a0bef0c96">util::DEFINE_RANGE_BASED_ARC_ITERATION</a></div><div class="ttdeci">DEFINE_RANGE_BASED_ARC_ITERATION(ListGraph, Outgoing, Base::kNilArc)</div><div class="ttdoc">ListGraph implementation -------------------------------------------------—.</div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_abcfd7c21143e5ed38573c0dd60826dd8"><div class="ttname"><a href="classutil_1_1BaseGraph.html#abcfd7c21143e5ed38573c0dd60826dd8">util::BaseGraph::AllForwardArcs</a></div><div class="ttdeci">IntegerRange< ArcIndex > AllForwardArcs() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00935">graph.h:935</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_a383413966b4ee3790931137c44916bd3"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#a383413966b4ee3790931137c44916bd3">util::ReverseArcStaticGraph::OutgoingOrOppositeIncomingArcs</a></div><div class="ttdeci">BeginEndWrapper< OutgoingOrOppositeIncomingArcIterator > OutgoingOrOppositeIncomingArcs(NodeIndexType node) const</div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_add718a46fe9ba1db673f69b2c02ec2a2"><div class="ttname"><a href="classutil_1_1SVector.html#add718a46fe9ba1db673f69b2c02ec2a2">util::SVector::max_size</a></div><div class="ttdeci">int max_size() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00894">graph.h:894</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_1_1IncomingArcIterator_html_aeb78ff088b5309b3573d15bb30178212"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph_1_1IncomingArcIterator.html#aeb78ff088b5309b3573d15bb30178212">util::ReverseArcListGraph::IncomingArcIterator::IncomingArcIterator</a></div><div class="ttdeci">IncomingArcIterator(const ReverseArcListGraph &graph, NodeIndexType node)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01588">graph.h:1588</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_afc485e5858e15ce8ec376ca7640ede1e"><div class="ttname"><a href="classutil_1_1SVector.html#afc485e5858e15ce8ec376ca7640ede1e">util::SVector::operator=</a></div><div class="ttdeci">SVector & operator=(const SVector &other)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00780">graph.h:780</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_a60d3a435f90e2c963047cc6d8c6ad363"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#a60d3a435f90e2c963047cc6d8c6ad363">util::ReverseArcListGraph::OutgoingArcsStartingFrom</a></div><div class="ttdeci">BeginEndWrapper< OutgoingArcIterator > OutgoingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const</div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteGraph_html_ad3401c3d9df9b08cd9be279464029a32"><div class="ttname"><a href="classutil_1_1CompleteGraph.html#ad3401c3d9df9b08cd9be279464029a32">util::CompleteGraph::CompleteGraph</a></div><div class="ttdeci">CompleteGraph(NodeIndexType num_nodes)</div><div class="ttdoc">Builds a complete graph with num_nodes nodes.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02184">graph.h:2184</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_ac47030fcb75a3220f8cf9ed79697056e"><div class="ttname"><a href="classutil_1_1BaseGraph.html#ac47030fcb75a3220f8cf9ed79697056e">util::BaseGraph::ComputeCumulativeSum</a></div><div class="ttdeci">void ComputeCumulativeSum(std::vector< ArcIndexType > *v)</div><div class="ttdoc">Functions commented when defined because they are implementation details.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00978">graph.h:978</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_ab1292c82a3f43be3bd57b63a05fe0214"><div class="ttname"><a href="classutil_1_1BaseGraph.html#ab1292c82a3f43be3bd57b63a05fe0214">util::BaseGraph::kNilNode</a></div><div class="ttdeci">static const NodeIndexType kNilNode</div><div class="ttdoc">Constants that will never be a valid node or arc.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00258">graph.h:258</a></div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteBipartiteGraph_html_acf1c65e6f320741ffab9a8717ac4ba28"><div class="ttname"><a href="classutil_1_1CompleteBipartiteGraph.html#acf1c65e6f320741ffab9a8717ac4ba28">util::CompleteBipartiteGraph::OutDegree</a></div><div class="ttdeci">ArcIndexType OutDegree(NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02318">graph.h:2318</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_aa05f6afa9ff06e13079eff039632f0cb"><div class="ttname"><a href="classutil_1_1SVector.html#aa05f6afa9ff06e13079eff039632f0cb">util::SVector::~SVector</a></div><div class="ttdeci">~SVector()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00776">graph.h:776</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_a346b8a5811f0e287e1ebce2de2c1ad28"><div class="ttname"><a href="classutil_1_1BaseGraph.html#a346b8a5811f0e287e1ebce2de2c1ad28">util::BaseGraph::max_end_arc_index</a></div><div class="ttdeci">ArcIndexType max_end_arc_index() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00267">graph.h:267</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_af10d16de8964a7abf555759bb9f257aa"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#af10d16de8964a7abf555759bb9f257aa">util::ReverseArcMixedGraph::ReverseArcMixedGraph</a></div><div class="ttdeci">ReverseArcMixedGraph()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00646">graph.h:646</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_a0ff94f595442b19c2de253a2685fe27f"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#a0ff94f595442b19c2de253a2685fe27f">util::ReverseArcStaticGraph::operator[]</a></div><div class="ttdeci">BeginEndWrapper< NodeIndexType const * > operator[](NodeIndexType node) const</div><div class="ttdoc">This loops over the heads of the OutgoingArcs(node).</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01699">graph.h:1699</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_acee1cc8d243acbdad8d30f97c5d54a5f"><div class="ttname"><a href="classutil_1_1SVector.html#acee1cc8d243acbdad8d30f97c5d54a5f">util::SVector::swap</a></div><div class="ttdeci">void swap(SVector< T > &x)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00844">graph.h:844</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_ac553bb63399815ac609976e5a3bd8732"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#ac553bb63399815ac609976e5a3bd8732">util::ReverseArcListGraph::ReverseArcListGraph</a></div><div class="ttdeci">ReverseArcListGraph()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00470">graph.h:470</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_1_1OutgoingOrOppositeIncomingArcIterator_html_ad1f79b2ac841f3856578d6840e2bf25a"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#ad1f79b2ac841f3856578d6840e2bf25a">util::ReverseArcStaticGraph::OutgoingOrOppositeIncomingArcIterator::Ok</a></div><div class="ttdeci">bool Ok() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01913">graph.h:1913</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_a362fa49b586ff223477aab7a53d17f14"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#a362fa49b586ff223477aab7a53d17f14">util::ReverseArcMixedGraph::AddArc</a></div><div class="ttdeci">ArcIndexType AddArc(NodeIndexType tail, NodeIndexType head)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02003">graph.h:2003</a></div></div>
|
|
<div class="ttc" id="namespaceutil_html"><div class="ttname"><a href="namespaceutil.html">util</a></div><div class="ttdoc">Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in c...</div><div class="ttdef"><b>Definition:</b> <a href="connected__components_8h_source.html#l00056">connected_components.h:56</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_a351cbc3c0c79e22f010e697bf65d7100"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#a351cbc3c0c79e22f010e697bf65d7100">util::ReverseArcMixedGraph::Tail</a></div><div class="ttdeci">NodeIndexType Tail(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01980">graph.h:1980</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_a9cdfbde174efbc5747d58330dbd85e86"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#a9cdfbde174efbc5747d58330dbd85e86">util::ReverseArcMixedGraph::OutgoingOrOppositeIncomingArcs</a></div><div class="ttdeci">BeginEndWrapper< OutgoingOrOppositeIncomingArcIterator > OutgoingOrOppositeIncomingArcs(NodeIndexType node) const</div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteGraph_html_af32d9f7de8ae0ccb7a859794a8fa7329"><div class="ttname"><a href="classutil_1_1CompleteGraph.html#af32d9f7de8ae0ccb7a859794a8fa7329">util::CompleteGraph::Head</a></div><div class="ttdeci">NodeIndexType Head(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02201">graph.h:2201</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_a9e1927755201f418ac04ac1ad4b4660d"><div class="ttname"><a href="classutil_1_1SVector.html#a9e1927755201f418ac04ac1ad4b4660d">util::SVector::operator=</a></div><div class="ttdeci">SVector & operator=(SVector &&other)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00802">graph.h:802</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_ac34dbebcbd795b04b51dbfd96292d671"><div class="ttname"><a href="classutil_1_1SVector.html#ac34dbebcbd795b04b51dbfd96292d671">util::SVector::grow</a></div><div class="ttdeci">void grow(const T &left=T(), const T &right=T())</div><div class="ttdoc">NOTE(user): This doesn't currently support movable-only objects, but we could fix that.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00873">graph.h:873</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_a1a89c1efcf87cce6cec110126eb05641"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#a1a89c1efcf87cce6cec110126eb05641">util::ReverseArcListGraph::IncomingArcsStartingFrom</a></div><div class="ttdeci">BeginEndWrapper< IncomingArcIterator > IncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const</div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_aa3bd051d1e141b09dda17aa9b5f24f69"><div class="ttname"><a href="classutil_1_1BaseGraph.html#aa3bd051d1e141b09dda17aa9b5f24f69">util::BaseGraph::FreezeCapacities</a></div><div class="ttdeci">void FreezeCapacities()</div><div class="ttdoc">FreezeCapacities() makes any future attempt to change the graph capacities crash in DEBUG mode.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00966">graph.h:966</a></div></div>
|
|
<div class="ttc" id="classutil_1_1StaticGraph_html_a9615f3c590e39f40ca5158bd4f37b5b4"><div class="ttname"><a href="classutil_1_1StaticGraph.html#a9615f3c590e39f40ca5158bd4f37b5b4">util::StaticGraph::Tail</a></div><div class="ttdeci">NodeIndexType Tail(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01304">graph.h:1304</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_a79291a548af693328d0e4e8f64cdc745"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#a79291a548af693328d0e4e8f64cdc745">util::ReverseArcListGraph::AddArc</a></div><div class="ttdeci">ArcIndexType AddArc(NodeIndexType tail, NodeIndexType head)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01504">graph.h:1504</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_1_1OutgoingOrOppositeIncomingArcIterator_html"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph_1_1OutgoingOrOppositeIncomingArcIterator.html">util::ReverseArcListGraph::OutgoingOrOppositeIncomingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01607">graph.h:1607</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_ae53769b81e0791bccfdf1187d4fcf7f6"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#ae53769b81e0791bccfdf1187d4fcf7f6">util::ReverseArcMixedGraph::OppositeIncomingArcsStartingFrom</a></div><div class="ttdeci">BeginEndWrapper< OppositeIncomingArcIterator > OppositeIncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const</div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_1_1IncomingArcIterator_html"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph_1_1IncomingArcIterator.html">util::ReverseArcStaticGraph::IncomingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01866">graph.h:1866</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html">util::ReverseArcListGraph</a></div><div class="ttdoc">Extends the ListGraph by also storing the reverse arcs.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00459">graph.h:459</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_a53ad65ff7f20bd4a6fb2494ed6dd2490"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#a53ad65ff7f20bd4a6fb2494ed6dd2490">util::ReverseArcStaticGraph::IncomingArcs</a></div><div class="ttdeci">BeginEndWrapper< IncomingArcIterator > IncomingArcs(NodeIndexType node) const</div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteBipartiteGraph_html_ad68ad92884b0ed0e3b2eb6888a6eebea"><div class="ttname"><a href="classutil_1_1CompleteBipartiteGraph.html#ad68ad92884b0ed0e3b2eb6888a6eebea">util::CompleteBipartiteGraph::Head</a></div><div class="ttdeci">NodeIndexType Head(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02304">graph.h:2304</a></div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteBipartiteGraph_html_ae2e3523b6d6cdff67cbca55bdc2bcc4b"><div class="ttname"><a href="classutil_1_1CompleteBipartiteGraph.html#ae2e3523b6d6cdff67cbca55bdc2bcc4b">util::CompleteBipartiteGraph::operator[]</a></div><div class="ttdeci">IntegerRange< NodeIndexType > operator[](NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02348">graph.h:2348</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_a4923ba6abf7a599e833becfa82750a86"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#a4923ba6abf7a599e833becfa82750a86">util::ReverseArcMixedGraph::IncomingArcs</a></div><div class="ttdeci">BeginEndWrapper< IncomingArcIterator > IncomingArcs(NodeIndexType node) const</div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_html_a184d6ce1a3d943810039ac9b97b860ef"><div class="ttname"><a href="classutil_1_1ListGraph.html#a184d6ce1a3d943810039ac9b97b860ef">util::ListGraph::ListGraph</a></div><div class="ttdeci">ListGraph(NodeIndexType num_nodes, ArcIndexType arc_capacity)</div><div class="ttdoc">Reserve space for the graph at construction and do not allow it to grow beyond that,...</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00312">graph.h:312</a></div></div>
|
|
<div class="ttc" id="namespaceutil_html_ae76339cb2dcd3bc05ad762146f91fdda"><div class="ttname"><a href="namespaceutil.html#ae76339cb2dcd3bc05ad762146f91fdda">util::Graph</a></div><div class="ttdeci">ListGraph Graph</div><div class="ttdoc">Defining the simplest Graph interface as Graph for convenience.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02358">graph.h:2358</a></div></div>
|
|
<div class="ttc" id="classutil_1_1StaticGraph_html_a98f11aaa1013df49976fcb5433538ff5"><div class="ttname"><a href="classutil_1_1StaticGraph.html#a98f11aaa1013df49976fcb5433538ff5">util::StaticGraph::ReserveArcs</a></div><div class="ttdeci">void ReserveArcs(ArcIndexType bound) override</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01267">graph.h:1267</a></div></div>
|
|
<div class="ttc" id="classutil_1_1StaticGraph_html_aa7eeb525aab90ef2bab82eb69687f600"><div class="ttname"><a href="classutil_1_1StaticGraph.html#aa7eeb525aab90ef2bab82eb69687f600">util::StaticGraph::OutgoingArcs</a></div><div class="ttdeci">BeginEndWrapper< OutgoingArcIterator > OutgoingArcs(NodeIndexType node) const</div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_ac7b475304d3677d4a29c676e64c3e09c"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#ac7b475304d3677d4a29c676e64c3e09c">util::ReverseArcListGraph::Tail</a></div><div class="ttdeci">NodeIndexType Tail(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01470">graph.h:1470</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_aeffdaa7d0a6c7b6355ee1dab33524961"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#aeffdaa7d0a6c7b6355ee1dab33524961">util::ReverseArcListGraph::InDegree</a></div><div class="ttdeci">ArcIndexType InDegree(NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01448">graph.h:1448</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_aff7c6ef395dfc941edac13b29e154b54"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#aff7c6ef395dfc941edac13b29e154b54">util::ReverseArcMixedGraph::operator[]</a></div><div class="ttdeci">BeginEndWrapper< NodeIndexType const * > operator[](NodeIndexType node) const</div><div class="ttdoc">This loops over the heads of the OutgoingArcs(node).</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01958">graph.h:1958</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_a09e6c29120c6f7f0a84fb4c02af0f0ee"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#a09e6c29120c6f7f0a84fb4c02af0f0ee">util::ReverseArcMixedGraph::OutgoingOrOppositeIncomingArcsStartingFrom</a></div><div class="ttdeci">BeginEndWrapper< OutgoingOrOppositeIncomingArcIterator > OutgoingOrOppositeIncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const</div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteGraph_html_ab12a266c0c091c00a150667619f491d4"><div class="ttname"><a href="classutil_1_1CompleteGraph.html#ab12a266c0c091c00a150667619f491d4">util::CompleteGraph::operator[]</a></div><div class="ttdeci">IntegerRange< NodeIndexType > operator[](NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02241">graph.h:2241</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_a9563f7154a759843923dd9bb27b288e7"><div class="ttname"><a href="classutil_1_1BaseGraph.html#a9563f7154a759843923dd9bb27b288e7">util::BaseGraph::ReserveArcs</a></div><div class="ttdeci">virtual void ReserveArcs(ArcIndexType bound)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00241">graph.h:241</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_a50115c615a3af5b9d50afc51a75541c3"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#a50115c615a3af5b9d50afc51a75541c3">util::ReverseArcStaticGraph::OutgoingArcsStartingFrom</a></div><div class="ttdeci">BeginEndWrapper< OutgoingArcIterator > OutgoingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const</div></div>
|
|
<div class="ttc" id="classutil_1_1StaticGraph_html_a7241e6e63df39df439a5ebb4fe28773e"><div class="ttname"><a href="classutil_1_1StaticGraph.html#a7241e6e63df39df439a5ebb4fe28773e">util::StaticGraph::OutDegree</a></div><div class="ttdeci">ArcIndexType OutDegree(NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01253">graph.h:1253</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html">util::ReverseArcStaticGraph</a></div><div class="ttdoc">StaticGraph with reverse arc.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00547">graph.h:547</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_html_a777ff917f03a31da77f275d536578afa"><div class="ttname"><a href="classutil_1_1ListGraph.html#a777ff917f03a31da77f275d536578afa">util::ListGraph::Build</a></div><div class="ttdeci">void Build()</div><div class="ttdoc">Some graph implementations need to be finalized with Build() before they can be used.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00339">graph.h:339</a></div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteBipartiteGraph_html_a6c20eacdf4ddd2af4c40b1fcce27ada9"><div class="ttname"><a href="classutil_1_1CompleteBipartiteGraph.html#a6c20eacdf4ddd2af4c40b1fcce27ada9">util::CompleteBipartiteGraph::OutgoingArcsStartingFrom</a></div><div class="ttdeci">IntegerRange< ArcIndexType > OutgoingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02337">graph.h:2337</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_a0f551c921fa0b5aaa334a6e36f61db4a"><div class="ttname"><a href="classutil_1_1BaseGraph.html#a0f551c921fa0b5aaa334a6e36f61db4a">util::BaseGraph::num_nodes</a></div><div class="ttdeci">NodeIndexType num_nodes() const</div><div class="ttdoc">Returns the number of valid nodes in the graph.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00201">graph.h:201</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_a06e56a529396bbd2595f5c32c2f73142"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#a06e56a529396bbd2595f5c32c2f73142">util::ReverseArcMixedGraph::Build</a></div><div class="ttdeci">void Build()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00693">graph.h:693</a></div></div>
|
|
<div class="ttc" id="classutil_1_1StaticGraph_html_a0b8444bcee7138b5702880a882d29283"><div class="ttname"><a href="classutil_1_1StaticGraph.html#a0b8444bcee7138b5702880a882d29283">util::StaticGraph::Build</a></div><div class="ttdeci">void Build()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00434">graph.h:434</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_ad39d8df784046ecfb6192ac0a0b5da44"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#ad39d8df784046ecfb6192ac0a0b5da44">util::ReverseArcMixedGraph::ReserveArcs</a></div><div class="ttdeci">void ReserveArcs(ArcIndexType bound) override</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01987">graph.h:1987</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_1_1IncomingArcIterator_html"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph_1_1IncomingArcIterator.html">util::ReverseArcListGraph::IncomingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01585">graph.h:1585</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_a2f8dc1bf8f2242b19aacc876301365a6"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#a2f8dc1bf8f2242b19aacc876301365a6">util::ReverseArcStaticGraph::OppositeArc</a></div><div class="ttdeci">ArcIndexType OppositeArc(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01706">graph.h:1706</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_a25d91ab3a2ced7900dd2f5cbcf1ed587"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#a25d91ab3a2ced7900dd2f5cbcf1ed587">util::ReverseArcListGraph::Build</a></div><div class="ttdeci">void Build()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00527">graph.h:527</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_html_aba03f198f690155bca2ab23b039cea54"><div class="ttname"><a href="classutil_1_1ListGraph.html#aba03f198f690155bca2ab23b039cea54">util::ListGraph::Tail</a></div><div class="ttdeci">NodeIndexType Tail(ArcIndexType arc) const</div><div class="ttdoc">Returns the tail/head of a valid arc.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01107">graph.h:1107</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_ab2aa905e49f98689100f071c493d20fa"><div class="ttname"><a href="classutil_1_1BaseGraph.html#ab2aa905e49f98689100f071c493d20fa">util::BaseGraph::BaseGraph</a></div><div class="ttdeci">BaseGraph()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00192">graph.h:192</a></div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteBipartiteGraph_html"><div class="ttname"><a href="classutil_1_1CompleteBipartiteGraph.html">util::CompleteBipartiteGraph</a></div><div class="ttdoc">CompleteBipartiteGraph implementation ------------------------------------— Nodes and arcs are implic...</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02251">graph.h:2251</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_a1e345c79e59f71e088f4876be93a903d"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#a1e345c79e59f71e088f4876be93a903d">util::ReverseArcListGraph::OppositeIncomingArcsStartingFrom</a></div><div class="ttdeci">BeginEndWrapper< OppositeIncomingArcIterator > OppositeIncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const</div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_a86effffe3928593a808edf548dd6b832"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#a86effffe3928593a808edf548dd6b832">util::ReverseArcMixedGraph::OppositeArc</a></div><div class="ttdeci">ArcIndexType OppositeArc(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01965">graph.h:1965</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_a1708f7e290d33a29936556e7453a5092"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#a1708f7e290d33a29936556e7453a5092">util::ReverseArcStaticGraph::OppositeIncomingArcs</a></div><div class="ttdeci">BeginEndWrapper< OppositeIncomingArcIterator > OppositeIncomingArcs(NodeIndexType node) const</div></div>
|
|
<div class="ttc" id="classutil_1_1StaticGraph_html_abb5850c4145abf3dad76d25668368505"><div class="ttname"><a href="classutil_1_1StaticGraph.html#abb5850c4145abf3dad76d25668368505">util::StaticGraph::StaticGraph</a></div><div class="ttdeci">StaticGraph(NodeIndexType num_nodes, ArcIndexType arc_capacity)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00407">graph.h:407</a></div></div>
|
|
<div class="ttc" id="classutil_1_1StaticGraph_html_afe7f293d20a6f38c859af7c51ab1b105"><div class="ttname"><a href="classutil_1_1StaticGraph.html#afe7f293d20a6f38c859af7c51ab1b105">util::StaticGraph::StaticGraph</a></div><div class="ttdeci">StaticGraph()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00406">graph.h:406</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_a0b801f8cece53ce666b90be4a8b76ae6"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#a0b801f8cece53ce666b90be4a8b76ae6">util::ReverseArcStaticGraph::AddArc</a></div><div class="ttdeci">ArcIndexType AddArc(NodeIndexType tail, NodeIndexType head)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01745">graph.h:1745</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_aab290c8728947d80dbf9fec6e320c3d1"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#aab290c8728947d80dbf9fec6e320c3d1">util::ReverseArcMixedGraph::AddNode</a></div><div class="ttdeci">void AddNode(NodeIndexType node)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01995">graph.h:1995</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_af16f99d41856a7b22ae8a226ef09abff"><div class="ttname"><a href="classutil_1_1BaseGraph.html#af16f99d41856a7b22ae8a226ef09abff">util::BaseGraph::num_arcs_</a></div><div class="ttdeci">ArcIndexType num_arcs_</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00278">graph.h:278</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_html_af637e16c3c7604f0354a6fa317358a15"><div class="ttname"><a href="classutil_1_1ListGraph.html#af637e16c3c7604f0354a6fa317358a15">util::ListGraph::ReserveArcs</a></div><div class="ttdeci">void ReserveArcs(ArcIndexType bound) override</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01158">graph.h:1158</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_a463d57480c9563a7a707c5d0928c9946"><div class="ttname"><a href="classutil_1_1BaseGraph.html#a463d57480c9563a7a707c5d0928c9946">util::BaseGraph::node_capacity</a></div><div class="ttdeci">NodeIndexType node_capacity() const</div><div class="ttdoc">Capacity reserved for future nodes, always >= num_nodes_.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00951">graph.h:951</a></div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator_html_a35eeda0546643fca60129e9fa15e2a61"><div class="ttname"><a href="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator.html#a35eeda0546643fca60129e9fa15e2a61">util::CompleteBipartiteGraph::OutgoingArcIterator::Next</a></div><div class="ttdeci">void Next()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02291">graph.h:2291</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_a5ebe11f2abcd78ad1f5606e27d1688bb"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#a5ebe11f2abcd78ad1f5606e27d1688bb">util::ReverseArcMixedGraph::Head</a></div><div class="ttdeci">NodeIndexType Head(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01972">graph.h:1972</a></div></div>
|
|
<div class="ttc" id="classutil_1_1StaticGraph_1_1OutgoingArcIterator_html_a15d6bd250626ba7eb0c0ca869e80e82e"><div class="ttname"><a href="classutil_1_1StaticGraph_1_1OutgoingArcIterator.html#a15d6bd250626ba7eb0c0ca869e80e82e">util::StaticGraph::OutgoingArcIterator::OutgoingArcIterator</a></div><div class="ttdeci">OutgoingArcIterator(const StaticGraph &graph, NodeIndexType node)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01391">graph.h:1391</a></div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteGraph_html_a715345c684f1cbeb1896f09ebd989dd1"><div class="ttname"><a href="classutil_1_1CompleteGraph.html#a715345c684f1cbeb1896f09ebd989dd1">util::CompleteGraph::OutDegree</a></div><div class="ttdeci">ArcIndexType OutDegree(NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02215">graph.h:2215</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_ab731ca5c638e7b1b0a2c459c94a90f55"><div class="ttname"><a href="classutil_1_1BaseGraph.html#ab731ca5c638e7b1b0a2c459c94a90f55">util::BaseGraph::Reserve</a></div><div class="ttdeci">void Reserve(NodeIndexType node_capacity, ArcIndexType arc_capacity)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00247">graph.h:247</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_1_1OutgoingHeadIterator_html_ae46346c25624805c3daee4d82904afbe"><div class="ttname"><a href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#ae46346c25624805c3daee4d82904afbe">util::ListGraph::OutgoingHeadIterator::value_type</a></div><div class="ttdeci">NodeIndexType value_type</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01208">graph.h:1208</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_ac8923133838003d7a7ffb4500f0d4ffa"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#ac8923133838003d7a7ffb4500f0d4ffa">util::ReverseArcListGraph::OutgoingArcs</a></div><div class="ttdeci">BeginEndWrapper< OutgoingArcIterator > OutgoingArcs(NodeIndexType node) const</div><div class="ttdoc">Arc iterations functions over the arcs touching a node (see the top-level comment for the different t...</div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteBipartiteGraph_html_a63dffe1efb9b218697c5658752d2f557"><div class="ttname"><a href="classutil_1_1CompleteBipartiteGraph.html#a63dffe1efb9b218697c5658752d2f557">util::CompleteBipartiteGraph::CompleteBipartiteGraph</a></div><div class="ttdeci">CompleteBipartiteGraph(NodeIndexType left_nodes, NodeIndexType right_nodes)</div><div class="ttdoc">Builds a complete bipartite graph from a set of left nodes to a set of right nodes.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02265">graph.h:2265</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_a2097ccda3b1ad27e2c82166979018bda"><div class="ttname"><a href="classutil_1_1BaseGraph.html#a2097ccda3b1ad27e2c82166979018bda">util::BaseGraph::IsArcValid</a></div><div class="ttdeci">bool IsArcValid(ArcIndexType arc) const</div><div class="ttdoc">Returns true if the given arc is a valid arc of the graph.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00219">graph.h:219</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_a06ed1003be01209763bb15e923399fc7"><div class="ttname"><a href="classutil_1_1SVector.html#a06ed1003be01209763bb15e923399fc7">util::SVector::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00840">graph.h:840</a></div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteGraph_html_aa5561d57ac19a632ed3086e7f96fdbe6"><div class="ttname"><a href="classutil_1_1CompleteGraph.html#aa5561d57ac19a632ed3086e7f96fdbe6">util::CompleteGraph::OutgoingArcs</a></div><div class="ttdeci">IntegerRange< ArcIndexType > OutgoingArcs(NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02222">graph.h:2222</a></div></div>
|
|
<div class="ttc" id="iterators_8h_html"><div class="ttname"><a href="iterators_8h.html">iterators.h</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_af83383a45904db07bed45418199ff2dc"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#af83383a45904db07bed45418199ff2dc">util::ReverseArcStaticGraph::AddNode</a></div><div class="ttdeci">void AddNode(NodeIndexType node)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01737">graph.h:1737</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_aacb8fc16527ae0e30a874393a94cd8ee"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#aacb8fc16527ae0e30a874393a94cd8ee">util::ReverseArcStaticGraph::InDegree</a></div><div class="ttdeci">ArcIndexType InDegree(NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01692">graph.h:1692</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_a6270e7d8614fca867c7f935b7a3e9cd3"><div class="ttname"><a href="classutil_1_1SVector.html#a6270e7d8614fca867c7f935b7a3e9cd3">util::SVector::operator[]</a></div><div class="ttdeci">T & operator[](int n)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00811">graph.h:811</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_a2fdb48f771da93712d9386c60615cf04"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#a2fdb48f771da93712d9386c60615cf04">util::ReverseArcListGraph::Head</a></div><div class="ttdeci">NodeIndexType Head(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01463">graph.h:1463</a></div></div>
|
|
<div class="ttc" id="classutil_1_1StaticGraph_html_aa2a879f538b488698183a860bdb88596"><div class="ttname"><a href="classutil_1_1StaticGraph.html#aa2a879f538b488698183a860bdb88596">util::StaticGraph::AddNode</a></div><div class="ttdeci">void AddNode(NodeIndexType node)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01275">graph.h:1275</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_ad0e7957e515d9c50f931c00166d099ce"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#ad0e7957e515d9c50f931c00166d099ce">util::ReverseArcListGraph::IncomingArcs</a></div><div class="ttdeci">BeginEndWrapper< IncomingArcIterator > IncomingArcs(NodeIndexType node) const</div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_a98bf967d563272b62a207d179aae5973"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#a98bf967d563272b62a207d179aae5973">util::ReverseArcStaticGraph::ReverseArcStaticGraph</a></div><div class="ttdeci">ReverseArcStaticGraph()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00558">graph.h:558</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_aadf05a4b2729e2844c3251d82b9e862c"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#aadf05a4b2729e2844c3251d82b9e862c">util::ReverseArcListGraph::AddNode</a></div><div class="ttdeci">void AddNode(NodeIndexType node)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01494">graph.h:1494</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_a6409e1c967f2062aa83b4bde26a931f1"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#a6409e1c967f2062aa83b4bde26a931f1">util::ReverseArcListGraph::ReserveArcs</a></div><div class="ttdeci">void ReserveArcs(ArcIndexType bound) override</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01485">graph.h:1485</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_ad5b77846f77c2771e840820812ad5521"><div class="ttname"><a href="classutil_1_1BaseGraph.html#ad5b77846f77c2771e840820812ad5521">util::BaseGraph::kNilArc</a></div><div class="ttdeci">static const ArcIndexType kNilArc</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00259">graph.h:259</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_html_a6af38e88610400b54e8f28ab6f880908"><div class="ttname"><a href="classutil_1_1ListGraph.html#a6af38e88610400b54e8f28ab6f880908">util::ListGraph::AddNode</a></div><div class="ttdeci">void AddNode(NodeIndexType node)</div><div class="ttdoc">If node is not a valid node, sets num_nodes_ to node + 1 so that the given node becomes valid.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01129">graph.h:1129</a></div></div>
|
|
<div class="ttc" id="classutil_1_1StaticGraph_1_1OutgoingArcIterator_html"><div class="ttname"><a href="classutil_1_1StaticGraph_1_1OutgoingArcIterator.html">util::StaticGraph::OutgoingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01389">graph.h:1389</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator_html"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph_1_1OppositeIncomingArcIterator.html">util::ReverseArcStaticGraph::OppositeIncomingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01831">graph.h:1831</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html"><div class="ttname"><a href="classutil_1_1SVector.html">util::SVector</a></div><div class="ttdoc">Forward declaration.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00174">graph.h:174</a></div></div>
|
|
<div class="ttc" id="namespaceutil_html_a9470623ca7db3c4a62ce3b326c6b07d8"><div class="ttname"><a href="namespaceutil.html#a9470623ca7db3c4a62ce3b326c6b07d8">util::PermuteWithExplicitElementType</a></div><div class="ttdeci">void PermuteWithExplicitElementType(const IntVector &permutation, Array *array_to_permute, ElementType unused)</div><div class="ttdoc">Permutes the elements of array_to_permute: element #i will be moved to position permutation[i].</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00724">graph.h:724</a></div></div>
|
|
<div class="ttc" id="namespaceutil_html_aadd7603ae6e78cc2490ca9710fbaf180"><div class="ttname"><a href="namespaceutil.html#aadd7603ae6e78cc2490ca9710fbaf180">util::false</a></div><div class="ttdeci">false</div><div class="ttdoc">This is useful for wrapping iterators of a class that support many different iterations.</div><div class="ttdef"><b>Definition:</b> <a href="iterators_8h_source.html#l00030">iterators.h:30</a></div></div>
|
|
<div class="ttc" id="classutil_1_1StaticGraph_html"><div class="ttname"><a href="classutil_1_1StaticGraph.html">util::StaticGraph</a></div><div class="ttdoc">Most efficient implementation of a graph without reverse arcs:</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00396">graph.h:396</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_a25fc0f822d7e2a5eedab230ed56be07f"><div class="ttname"><a href="classutil_1_1SVector.html#a25fc0f822d7e2a5eedab230ed56be07f">util::SVector::data</a></div><div class="ttdeci">T * data() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00842">graph.h:842</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_a104172ed25aa4cea18cd3a5c2187d4c7"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#a104172ed25aa4cea18cd3a5c2187d4c7">util::ReverseArcListGraph::OutgoingOrOppositeIncomingArcs</a></div><div class="ttdeci">BeginEndWrapper< OutgoingOrOppositeIncomingArcIterator > OutgoingOrOppositeIncomingArcs(NodeIndexType node) const</div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_a63fd586eed6c345866317e2f0faf377e"><div class="ttname"><a href="classutil_1_1BaseGraph.html#a63fd586eed6c345866317e2f0faf377e">util::BaseGraph::BuildStartAndForwardHead</a></div><div class="ttdeci">void BuildStartAndForwardHead(SVector< NodeIndexType > *head, std::vector< ArcIndexType > *start, std::vector< ArcIndexType > *permutation)</div><div class="ttdoc">Given the tail of arc #i in (*head)[i] and the head of arc #i in (*head)[~i].</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00995">graph.h:995</a></div></div>
|
|
<div class="ttc" id="classutil_1_1StaticGraph_html_aefeec121033f3271585a059f0b5fbd3c"><div class="ttname"><a href="classutil_1_1StaticGraph.html#aefeec121033f3271585a059f0b5fbd3c">util::StaticGraph::Head</a></div><div class="ttdeci">NodeIndexType Head(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01311">graph.h:1311</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_ae5ea8fcc78ca9b142e07665d447ad2bd"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#ae5ea8fcc78ca9b142e07665d447ad2bd">util::ReverseArcMixedGraph::InDegree</a></div><div class="ttdeci">ArcIndexType InDegree(NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01949">graph.h:1949</a></div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteBipartiteGraph_html_a8e4bf50d021c9ed65c6da43b6ed014ae"><div class="ttname"><a href="classutil_1_1CompleteBipartiteGraph.html#a8e4bf50d021c9ed65c6da43b6ed014ae">util::CompleteBipartiteGraph::OutgoingArcs</a></div><div class="ttdeci">IntegerRange< ArcIndexType > OutgoingArcs(NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02325">graph.h:2325</a></div></div>
|
|
<div class="ttc" id="namespaceutil_html_a8c227a057c1ce9d46b1185abf77ad91e"><div class="ttname"><a href="namespaceutil.html#a8c227a057c1ce9d46b1185abf77ad91e">util::Permute</a></div><div class="ttdeci">void Permute(const IntVector &permutation, Array *array_to_permute)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00737">graph.h:737</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_a61603e21e903115daf755e297bf652bb"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#a61603e21e903115daf755e297bf652bb">util::ReverseArcStaticGraph::OutgoingOrOppositeIncomingArcsStartingFrom</a></div><div class="ttdeci">BeginEndWrapper< OutgoingOrOppositeIncomingArcIterator > OutgoingOrOppositeIncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const</div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_html_ac52a095c1ebbd1ca89902168350bbb75"><div class="ttname"><a href="classutil_1_1ListGraph.html#ac52a095c1ebbd1ca89902168350bbb75">util::ListGraph::OutgoingArcsStartingFrom</a></div><div class="ttdeci">BeginEndWrapper< OutgoingArcIterator > OutgoingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const</div><div class="ttdoc">Advanced usage.</div></div>
|
|
<div class="ttc" id="one__tree__lower__bound_8h_html_a3947d19ac087ef2cd68c2409920339c4"><div class="ttname"><a href="one__tree__lower__bound_8h.html#a3947d19ac087ef2cd68c2409920339c4">Next</a></div><div class="ttdeci">bool Next()</div><div class="ttdef"><b>Definition:</b> <a href="one__tree__lower__bound_8h_source.html#l00163">one_tree_lower_bound.h:163</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_ac9b88c60dccd3b6aafa96df2de557a23"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#ac9b88c60dccd3b6aafa96df2de557a23">util::ReverseArcStaticGraph::ReverseArcStaticGraph</a></div><div class="ttdeci">ReverseArcStaticGraph(NodeIndexType num_nodes, ArcIndexType arc_capacity)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00559">graph.h:559</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_af7ab2d9151c0b94ecb6569a369ce00b5"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#af7ab2d9151c0b94ecb6569a369ce00b5">util::ReverseArcStaticGraph::OutgoingArcs</a></div><div class="ttdeci">BeginEndWrapper< OutgoingArcIterator > OutgoingArcs(NodeIndexType node) const</div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_af0059304ee5c601207e97b1c742d5e84"><div class="ttname"><a href="classutil_1_1SVector.html#af0059304ee5c601207e97b1c742d5e84">util::SVector::resize</a></div><div class="ttdeci">void resize(int n)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00823">graph.h:823</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_a0eba6e5899924388644dfa2258ae8929"><div class="ttname"><a href="classutil_1_1BaseGraph.html#a0eba6e5899924388644dfa2258ae8929">util::BaseGraph::ArcIndex</a></div><div class="ttdeci">ArcIndexType ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00190">graph.h:190</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_html_ad7d3d076d3c154d89f1eda855a34b487"><div class="ttname"><a href="classutil_1_1ListGraph.html#ad7d3d076d3c154d89f1eda855a34b487">util::ListGraph::Head</a></div><div class="ttdeci">NodeIndexType Head(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01114">graph.h:1114</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_ae7734e3c4b1930b2859b4813bf6e238b"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#ae7734e3c4b1930b2859b4813bf6e238b">util::ReverseArcListGraph::ReserveNodes</a></div><div class="ttdeci">void ReserveNodes(NodeIndexType bound) override</div><div class="ttdoc">Changes the graph capacities.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01476">graph.h:1476</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_html_ab63770fa993b9347586d2852b841bdc2"><div class="ttname"><a href="classutil_1_1ListGraph.html#ab63770fa993b9347586d2852b841bdc2">util::ListGraph::OutgoingArcs</a></div><div class="ttdeci">BeginEndWrapper< OutgoingArcIterator > OutgoingArcs(NodeIndexType node) const</div><div class="ttdoc">Allows to iterate over the forward arcs that verify Tail(arc) == node.</div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator_html_a87f4a00a8b306480db02d93fa87bf223"><div class="ttname"><a href="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator.html#a87f4a00a8b306480db02d93fa87bf223">util::CompleteBipartiteGraph::OutgoingArcIterator::Index</a></div><div class="ttdeci">ArcIndexType Index() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02290">graph.h:2290</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator_html"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph_1_1OppositeIncomingArcIterator.html">util::ReverseArcListGraph::OppositeIncomingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01554">graph.h:1554</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_1_1OutgoingHeadIterator_html_a6bd5b4ffde55cadc4e58c80a08066e2d"><div class="ttname"><a href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#a6bd5b4ffde55cadc4e58c80a08066e2d">util::ListGraph::OutgoingHeadIterator::pointer</a></div><div class="ttdeci">const NodeIndexType * pointer</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01206">graph.h:1206</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_html_ac1aa8c7591bb033a49bab79c21c9f496"><div class="ttname"><a href="classutil_1_1ListGraph.html#ac1aa8c7591bb033a49bab79c21c9f496">util::ListGraph::AddArc</a></div><div class="ttdeci">ArcIndexType AddArc(NodeIndexType tail, NodeIndexType head)</div><div class="ttdoc">Adds an arc to the graph and returns its current index which will always be num_arcs() - 1.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01137">graph.h:1137</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_a6735921f3354efcf696ad98e4cf7c2c1"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#a6735921f3354efcf696ad98e4cf7c2c1">util::ReverseArcMixedGraph::ReverseArcMixedGraph</a></div><div class="ttdeci">ReverseArcMixedGraph(NodeIndexType num_nodes, ArcIndexType arc_capacity)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00647">graph.h:647</a></div></div>
|
|
<div class="ttc" id="classutil_1_1StaticGraph_html_a9b1c856f35140cb8902b94374a43d368"><div class="ttname"><a href="classutil_1_1StaticGraph.html#a9b1c856f35140cb8902b94374a43d368">util::StaticGraph::ReserveNodes</a></div><div class="ttdeci">void ReserveNodes(NodeIndexType bound) override</div><div class="ttdoc">Changes the graph capacities.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01259">graph.h:1259</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_a950e85c43ad31af8dd24a15e895c77c7"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#a950e85c43ad31af8dd24a15e895c77c7">util::ReverseArcStaticGraph::ReserveArcs</a></div><div class="ttdeci">void ReserveArcs(ArcIndexType bound) override</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01729">graph.h:1729</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_1_1OutgoingHeadIterator_html"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph_1_1OutgoingHeadIterator.html">util::ReverseArcListGraph::OutgoingHeadIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01646">graph.h:1646</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_a92ffd852b2ab2e5241f9832e71a2de71"><div class="ttname"><a href="classutil_1_1BaseGraph.html#a92ffd852b2ab2e5241f9832e71a2de71">util::BaseGraph::arc_capacity</a></div><div class="ttdeci">ArcIndexType arc_capacity() const</div><div class="ttdoc">Capacity reserved for future arcs, always >= num_arcs_.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00959">graph.h:959</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_a28d6f97b2135e9d51bad632c2556fa56"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#a28d6f97b2135e9d51bad632c2556fa56">util::ReverseArcListGraph::operator[]</a></div><div class="ttdeci">BeginEndWrapper< OutgoingHeadIterator > operator[](NodeIndexType node) const</div><div class="ttdoc">This loops over the heads of the OutgoingArcs(node).</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01432">graph.h:1432</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator_html"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph_1_1OppositeIncomingArcIterator.html">util::ReverseArcMixedGraph::OppositeIncomingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02071">graph.h:2071</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_aa9ec825f0a93d13a5c93e82b42cc1088"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#aa9ec825f0a93d13a5c93e82b42cc1088">util::ReverseArcStaticGraph::OutDegree</a></div><div class="ttdeci">ArcIndexType OutDegree(NodeIndexType node) const</div><div class="ttdoc">ReverseArcStaticGraph<>::OutDegree() and ::InDegree() work in O(1).</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01686">graph.h:1686</a></div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator_html_a0708b60d3463601fa36d682f1429f78a"><div class="ttname"><a href="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator.html#a0708b60d3463601fa36d682f1429f78a">util::CompleteBipartiteGraph::OutgoingArcIterator::OutgoingArcIterator</a></div><div class="ttdeci">OutgoingArcIterator(const CompleteBipartiteGraph &graph, NodeIndexType node)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02284">graph.h:2284</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_a12cf8d1312236cac409d9a1a934c1ad3"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#a12cf8d1312236cac409d9a1a934c1ad3">util::ReverseArcStaticGraph::Tail</a></div><div class="ttdeci">NodeIndexType Tail(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01722">graph.h:1722</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_ac3108bd8dd239c6adb32b30c16c5fc70"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#ac3108bd8dd239c6adb32b30c16c5fc70">util::ReverseArcMixedGraph::IncomingArcsStartingFrom</a></div><div class="ttdeci">BeginEndWrapper< IncomingArcIterator > IncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const</div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_a69a71cbb575b13bde9899f5a6a217139"><div class="ttname"><a href="classutil_1_1BaseGraph.html#a69a71cbb575b13bde9899f5a6a217139">util::BaseGraph::ReserveNodes</a></div><div class="ttdeci">virtual void ReserveNodes(NodeIndexType bound)</div><div class="ttdoc">Changes the graph capacities.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00235">graph.h:235</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_a36d88784d1f797dcf76845c47d74a4da"><div class="ttname"><a href="classutil_1_1SVector.html#a36d88784d1f797dcf76845c47d74a4da">util::SVector::clear_and_dealloc</a></div><div class="ttdeci">void clear_and_dealloc()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00896">graph.h:896</a></div></div>
|
|
<div class="ttc" id="classutil_1_1StaticGraph_html_aa6626536ee02fe83aa26ff7bbcfc8ae7"><div class="ttname"><a href="classutil_1_1StaticGraph.html#aa6626536ee02fe83aa26ff7bbcfc8ae7">util::StaticGraph::OutgoingArcsStartingFrom</a></div><div class="ttdeci">BeginEndWrapper< OutgoingArcIterator > OutgoingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const</div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_html_a4b5be895dae4a52e7bd97a7ef47267a6"><div class="ttname"><a href="classutil_1_1ListGraph.html#a4b5be895dae4a52e7bd97a7ef47267a6">util::ListGraph::ListGraph</a></div><div class="ttdeci">ListGraph()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00307">graph.h:307</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_a32ba4a5ca9a4b89f750eb2dc56518b02"><div class="ttname"><a href="classutil_1_1BaseGraph.html#a32ba4a5ca9a4b89f750eb2dc56518b02">util::BaseGraph::AllNodes</a></div><div class="ttdeci">IntegerRange< NodeIndex > AllNodes() const</div><div class="ttdoc">Allows nice range-based for loop: for (const NodeIndex node : graph.AllNodes()) { ....</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00929">graph.h:929</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_a2e920761999c90a1b266b96d609d8464"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#a2e920761999c90a1b266b96d609d8464">util::ReverseArcMixedGraph::OppositeIncomingArcs</a></div><div class="ttdeci">BeginEndWrapper< OppositeIncomingArcIterator > OppositeIncomingArcs(NodeIndexType node) const</div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteGraph_html_a77b6facc3e744aa4ff764c9b9725e2d8"><div class="ttname"><a href="classutil_1_1CompleteGraph.html#a77b6facc3e744aa4ff764c9b9725e2d8">util::CompleteGraph::OutgoingArcsStartingFrom</a></div><div class="ttdeci">IntegerRange< ArcIndexType > OutgoingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02232">graph.h:2232</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_a895e891d1ad52ce3efcfeb7ba11194c7"><div class="ttname"><a href="classutil_1_1BaseGraph.html#a895e891d1ad52ce3efcfeb7ba11194c7">util::BaseGraph::arc_capacity_</a></div><div class="ttdeci">ArcIndexType arc_capacity_</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00279">graph.h:279</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_abf853acea86e01356f53055f77661770"><div class="ttname"><a href="classutil_1_1BaseGraph.html#abf853acea86e01356f53055f77661770">util::BaseGraph::IsNodeValid</a></div><div class="ttdeci">bool IsNodeValid(NodeIndexType node) const</div><div class="ttdoc">Returns true if the given node is a valid node of the graph.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00213">graph.h:213</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_aefb468e4d4a3128c91b3bad9f5b314c8"><div class="ttname"><a href="classutil_1_1BaseGraph.html#aefb468e4d4a3128c91b3bad9f5b314c8">util::BaseGraph::num_arcs</a></div><div class="ttdeci">ArcIndexType num_arcs() const</div><div class="ttdoc">Returns the number of valid arcs in the graph.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00204">graph.h:204</a></div></div>
|
|
<div class="ttc" id="graph_8h_html_aa560f5e55268f818d5e5f43ed31e19a0"><div class="ttname"><a href="graph_8h.html#aa560f5e55268f818d5e5f43ed31e19a0">DEFINE_STL_ITERATOR_FUNCTIONS</a></div><div class="ttdeci">#define DEFINE_STL_ITERATOR_FUNCTIONS(iterator_class_name)</div><div class="ttdoc">Adapt our old iteration style to support range-based for loops.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01077">graph.h:1077</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_afaad0723c70ab98c88d4a0441e1f98e4"><div class="ttname"><a href="classutil_1_1SVector.html#afaad0723c70ab98c88d4a0441e1f98e4">util::SVector::size</a></div><div class="ttdeci">int size() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00890">graph.h:890</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_1_1OutgoingHeadIterator_html_a2672503e6869d2d2585047c3f5bf28ed"><div class="ttname"><a href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#a2672503e6869d2d2585047c3f5bf28ed">util::ListGraph::OutgoingHeadIterator::iterator_category</a></div><div class="ttdeci">std::input_iterator_tag iterator_category</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01204">graph.h:1204</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_a3cd1d1d0e50aaa2f30817db44cca8881"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#a3cd1d1d0e50aaa2f30817db44cca8881">util::ReverseArcListGraph::OppositeIncomingArcs</a></div><div class="ttdeci">BeginEndWrapper< OppositeIncomingArcIterator > OppositeIncomingArcs(NodeIndexType node) const</div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_1_1OutgoingArcIterator_html_a70d282f950c2f8e4c7aebc8809682661"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingArcIterator.html#a70d282f950c2f8e4c7aebc8809682661">util::ReverseArcStaticGraph::OutgoingArcIterator::OutgoingArcIterator</a></div><div class="ttdeci">OutgoingArcIterator(const ReverseArcStaticGraph &graph, NodeIndexType node)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01806">graph.h:1806</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_a287f9791ba2e68e137d53fc038bbe432"><div class="ttname"><a href="classutil_1_1SVector.html#a287f9791ba2e68e137d53fc038bbe432">util::SVector::reserve</a></div><div class="ttdeci">void reserve(int n)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00850">graph.h:850</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_1_1OutgoingOrOppositeIncomingArcIterator_html"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingOrOppositeIncomingArcIterator.html">util::ReverseArcMixedGraph::OutgoingOrOppositeIncomingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02123">graph.h:2123</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_html_a1565480b94bf179067e81d762916ed52"><div class="ttname"><a href="classutil_1_1ListGraph.html#a1565480b94bf179067e81d762916ed52">util::ListGraph::operator[]</a></div><div class="ttdeci">BeginEndWrapper< OutgoingHeadIterator > operator[](NodeIndexType node) const</div><div class="ttdoc">This loops over the heads of the OutgoingArcs(node).</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01099">graph.h:1099</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_1_1IncomingArcIterator_html_a50b5c385ecfc9ebc4e13b0bc667d0cff"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph_1_1IncomingArcIterator.html#a50b5c385ecfc9ebc4e13b0bc667d0cff">util::ReverseArcMixedGraph::IncomingArcIterator::IncomingArcIterator</a></div><div class="ttdeci">IncomingArcIterator(const ReverseArcMixedGraph &graph, NodeIndexType node)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02107">graph.h:2107</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_a96a609a53497ca38517dba5c277c7798"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#a96a609a53497ca38517dba5c277c7798">util::ReverseArcListGraph::OutgoingOrOppositeIncomingArcsStartingFrom</a></div><div class="ttdeci">BeginEndWrapper< OutgoingOrOppositeIncomingArcIterator > OutgoingOrOppositeIncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const</div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_1_1IncomingArcIterator_html"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph_1_1IncomingArcIterator.html">util::ReverseArcMixedGraph::IncomingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02104">graph.h:2104</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_aa980e5526b9ded17a83928fc339c71e4"><div class="ttname"><a href="classutil_1_1BaseGraph.html#aa980e5526b9ded17a83928fc339c71e4">util::BaseGraph::const_capacities_</a></div><div class="ttdeci">bool const_capacities_</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00280">graph.h:280</a></div></div>
|
|
<div class="ttc" id="iterators_8h_html_af3f6bc803bbe87af730cf9e41a35cf68"><div class="ttname"><a href="iterators_8h.html#af3f6bc803bbe87af730cf9e41a35cf68">BeginEndWrapper</a></div><div class="ttdeci">BeginEndWrapper(Iterator begin, Iterator end)</div><div class="ttdef"><b>Definition:</b> <a href="iterators_8h_source.html#l00043">iterators.h:43</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_a473db46afec1eabf0762411830dee30f"><div class="ttname"><a href="classutil_1_1BaseGraph.html#a473db46afec1eabf0762411830dee30f">util::BaseGraph::num_nodes_</a></div><div class="ttdeci">NodeIndexType num_nodes_</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00276">graph.h:276</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_a5d3d8b4f10e9d40e85fbd54d04c33611"><div class="ttname"><a href="classutil_1_1SVector.html#a5d3d8b4f10e9d40e85fbd54d04c33611">util::SVector::capacity</a></div><div class="ttdeci">int capacity() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00892">graph.h:892</a></div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator_html_a50be2d4453f8536677b936c48251ed71"><div class="ttname"><a href="classutil_1_1CompleteBipartiteGraph_1_1OutgoingArcIterator.html#a50be2d4453f8536677b936c48251ed71">util::CompleteBipartiteGraph::OutgoingArcIterator::Ok</a></div><div class="ttdeci">bool Ok() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02289">graph.h:2289</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_1_1OutgoingArcIterator_html"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph_1_1OutgoingArcIterator.html">util::ReverseArcListGraph::OutgoingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01526">graph.h:1526</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_a885571656abd56593b2edbebb451d67f"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#a885571656abd56593b2edbebb451d67f">util::ReverseArcListGraph::ReverseArcListGraph</a></div><div class="ttdeci">ReverseArcListGraph(NodeIndexType num_nodes, ArcIndexType arc_capacity)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00471">graph.h:471</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_1_1OutgoingHeadIterator_html_ad37fb276585027d2996d3fbebc7984db"><div class="ttname"><a href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#ad37fb276585027d2996d3fbebc7984db">util::ListGraph::OutgoingHeadIterator::reference</a></div><div class="ttdeci">const NodeIndexType & reference</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01207">graph.h:1207</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_adb271cf4bcf2de5b5bbe300d7054af29"><div class="ttname"><a href="classutil_1_1BaseGraph.html#adb271cf4bcf2de5b5bbe300d7054af29">util::BaseGraph::NodeIndex</a></div><div class="ttdeci">NodeIndexType NodeIndex</div><div class="ttdoc">Typedef so you can use Graph::NodeIndex and Graph::ArcIndex to be generic but also to improve the rea...</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00189">graph.h:189</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_1_1OutgoingHeadIterator_html"><div class="ttname"><a href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html">util::ListGraph::OutgoingHeadIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01202">graph.h:1202</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_a486c54240d6d491740aac1a4bd574f48"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#a486c54240d6d491740aac1a4bd574f48">util::ReverseArcStaticGraph::OppositeIncomingArcsStartingFrom</a></div><div class="ttdeci">BeginEndWrapper< OppositeIncomingArcIterator > OppositeIncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const</div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_html_aefd885a0eba3ec33568137533190ba5b"><div class="ttname"><a href="classutil_1_1ListGraph.html#aefd885a0eba3ec33568137533190ba5b">util::ListGraph::ReserveNodes</a></div><div class="ttdeci">void ReserveNodes(NodeIndexType bound) override</div><div class="ttdoc">Changes the graph capacities.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01151">graph.h:1151</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_a6e39d187175616e99c958a81bcd1831f"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#a6e39d187175616e99c958a81bcd1831f">util::ReverseArcMixedGraph::OutgoingArcs</a></div><div class="ttdeci">BeginEndWrapper< OutgoingArcIterator > OutgoingArcs(NodeIndexType node) const</div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteGraph_html_aa6dc77def1cc80ffd14cb931a3043e52"><div class="ttname"><a href="classutil_1_1CompleteGraph.html#aa6dc77def1cc80ffd14cb931a3043e52">util::CompleteGraph::Tail</a></div><div class="ttdeci">NodeIndexType Tail(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02208">graph.h:2208</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_a07214b96597069d781e27b1dd17ef83e"><div class="ttname"><a href="classutil_1_1BaseGraph.html#a07214b96597069d781e27b1dd17ef83e">util::BaseGraph::GroupForwardArcsByFunctor</a></div><div class="ttdeci">void GroupForwardArcsByFunctor(const A &a, B *b)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00264">graph.h:264</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_addeb94680d05c79b1be501edc5823209"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#addeb94680d05c79b1be501edc5823209">util::ReverseArcMixedGraph::OutDegree</a></div><div class="ttdeci">ArcIndexType OutDegree(NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01943">graph.h:1943</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_a72e8ed03fe3f8ff27d156622a86900aa"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#a72e8ed03fe3f8ff27d156622a86900aa">util::ReverseArcStaticGraph::Head</a></div><div class="ttdeci">NodeIndexType Head(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01714">graph.h:1714</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html"><div class="ttname"><a href="classutil_1_1BaseGraph.html">util::BaseGraph</a></div><div class="ttdoc">Base class of all Graphs implemented here.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00184">graph.h:184</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_1_1OutgoingHeadIterator_html_a31e54d4ae7d4b93c43ea64f950221328"><div class="ttname"><a href="classutil_1_1ListGraph_1_1OutgoingHeadIterator.html#a31e54d4ae7d4b93c43ea64f950221328">util::ListGraph::OutgoingHeadIterator::difference_type</a></div><div class="ttdeci">ptrdiff_t difference_type</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01205">graph.h:1205</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_1_1OutgoingArcIterator_html"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingArcIterator.html">util::ReverseArcMixedGraph::OutgoingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02044">graph.h:2044</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_a4ca50715f87be0dd9925dd46e2810436"><div class="ttname"><a href="classutil_1_1SVector.html#a4ca50715f87be0dd9925dd46e2810436">util::SVector::SVector</a></div><div class="ttdeci">SVector(const SVector &other)</div><div class="ttdoc">Copy constructor and assignment operator.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00779">graph.h:779</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_1_1OutgoingArcIterator_html"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingArcIterator.html">util::ReverseArcStaticGraph::OutgoingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01804">graph.h:1804</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_a485803d141f9c80beaaae7094548d672"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#a485803d141f9c80beaaae7094548d672">util::ReverseArcStaticGraph::Build</a></div><div class="ttdeci">void Build()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00606">graph.h:606</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_html_aa040d7a9d3e8af80b21f9ee07f6bae34"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph.html#aa040d7a9d3e8af80b21f9ee07f6bae34">util::ReverseArcStaticGraph::IncomingArcsStartingFrom</a></div><div class="ttdeci">BeginEndWrapper< IncomingArcIterator > IncomingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const</div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_aa3306c75dd28ca037205f382ac832b2a"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#aa3306c75dd28ca037205f382ac832b2a">util::ReverseArcListGraph::OppositeArc</a></div><div class="ttdeci">ArcIndexType OppositeArc(ArcIndexType arc) const</div><div class="ttdoc">Returns the opposite arc of a given arc.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01456">graph.h:1456</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_1_1OutgoingArcIterator_html_a13eb1d6a9e203dbcc707e1b226a3fc2d"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph_1_1OutgoingArcIterator.html#a13eb1d6a9e203dbcc707e1b226a3fc2d">util::ReverseArcMixedGraph::OutgoingArcIterator::OutgoingArcIterator</a></div><div class="ttdeci">OutgoingArcIterator(const ReverseArcMixedGraph &graph, NodeIndexType node)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02046">graph.h:2046</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_abba34108f60eb020d0cc94ea8bd24c8f"><div class="ttname"><a href="classutil_1_1SVector.html#abba34108f60eb020d0cc94ea8bd24c8f">util::SVector::SVector</a></div><div class="ttdeci">SVector(SVector &&other)</div><div class="ttdoc">Move constructor and move assignment operator.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00801">graph.h:801</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_a424bd34a9767e7edeaf3a60ecd3cb000"><div class="ttname"><a href="classutil_1_1BaseGraph.html#a424bd34a9767e7edeaf3a60ecd3cb000">util::BaseGraph::node_capacity_</a></div><div class="ttdeci">NodeIndexType node_capacity_</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00277">graph.h:277</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_html_ac52db792129da62b7ab25372ab90647c"><div class="ttname"><a href="classutil_1_1ListGraph.html#ac52db792129da62b7ab25372ab90647c">util::ListGraph::OutDegree</a></div><div class="ttdeci">ArcIndexType OutDegree(NodeIndexType node) const</div><div class="ttdoc">Graph jargon: the "degree" of a node is its number of arcs.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01121">graph.h:1121</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ListGraph_html"><div class="ttname"><a href="classutil_1_1ListGraph.html">util::ListGraph</a></div><div class="ttdoc">Basic graph implementation without reverse arc.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00297">graph.h:297</a></div></div>
|
|
<div class="ttc" id="classutil_1_1BaseGraph_html_ad2353019d9890202a2220fd230940fb5"><div class="ttname"><a href="classutil_1_1BaseGraph.html#ad2353019d9890202a2220fd230940fb5">util::BaseGraph::~BaseGraph</a></div><div class="ttdeci">virtual ~BaseGraph()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00198">graph.h:198</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html">util::ReverseArcMixedGraph</a></div><div class="ttdoc">This graph is a mix between the ReverseArcListGraph and the ReverseArcStaticGraph.</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00635">graph.h:635</a></div></div>
|
|
<div class="ttc" id="classutil_1_1StaticGraph_html_a10d877b38553e9d2d0ce6fcfc4427df4"><div class="ttname"><a href="classutil_1_1StaticGraph.html#a10d877b38553e9d2d0ce6fcfc4427df4">util::StaticGraph::AddArc</a></div><div class="ttdeci">ArcIndexType AddArc(NodeIndexType tail, NodeIndexType head)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01283">graph.h:1283</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_1_1IncomingArcIterator_html_a287ddcb43f060b53bceef9434834e9ed"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph_1_1IncomingArcIterator.html#a287ddcb43f060b53bceef9434834e9ed">util::ReverseArcStaticGraph::IncomingArcIterator::IncomingArcIterator</a></div><div class="ttdeci">IncomingArcIterator(const ReverseArcStaticGraph &graph, NodeIndexType node)</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01869">graph.h:1869</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_a01c346b7779b313b6ff1099a10946ed0"><div class="ttname"><a href="classutil_1_1SVector.html#a01c346b7779b313b6ff1099a10946ed0">util::SVector::operator[]</a></div><div class="ttdeci">const T & operator[](int n) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00817">graph.h:817</a></div></div>
|
|
<div class="ttc" id="classutil_1_1StaticGraph_html_a160bf25732e2b1a19e8bf6d853014070"><div class="ttname"><a href="classutil_1_1StaticGraph.html#a160bf25732e2b1a19e8bf6d853014070">util::StaticGraph::operator[]</a></div><div class="ttdeci">BeginEndWrapper< NodeIndexType const * > operator[](NodeIndexType node) const</div><div class="ttdoc">This loops over the heads of the OutgoingArcs(node).</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01246">graph.h:1246</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcListGraph_html_ad25429b667ebd6e2ac662b76f3e02eae"><div class="ttname"><a href="classutil_1_1ReverseArcListGraph.html#ad25429b667ebd6e2ac662b76f3e02eae">util::ReverseArcListGraph::OutDegree</a></div><div class="ttdeci">ArcIndexType OutDegree(NodeIndexType node) const</div><div class="ttdoc">ReverseArcListGraph<>::OutDegree() and ::InDegree() work in O(degree).</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01440">graph.h:1440</a></div></div>
|
|
<div class="ttc" id="classutil_1_1CompleteBipartiteGraph_html_a31e96f6c4453535f09ba76224fd4628a"><div class="ttname"><a href="classutil_1_1CompleteBipartiteGraph.html#a31e96f6c4453535f09ba76224fd4628a">util::CompleteBipartiteGraph::Tail</a></div><div class="ttdeci">NodeIndexType Tail(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02311">graph.h:2311</a></div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcMixedGraph_html_a41eeddd2d42998985b295d05fc04439e"><div class="ttname"><a href="classutil_1_1ReverseArcMixedGraph.html#a41eeddd2d42998985b295d05fc04439e">util::ReverseArcMixedGraph::OutgoingArcsStartingFrom</a></div><div class="ttdeci">BeginEndWrapper< OutgoingArcIterator > OutgoingArcsStartingFrom(NodeIndexType node, ArcIndexType from) const</div></div>
|
|
<div class="ttc" id="classutil_1_1ReverseArcStaticGraph_1_1OutgoingOrOppositeIncomingArcIterator_html"><div class="ttname"><a href="classutil_1_1ReverseArcStaticGraph_1_1OutgoingOrOppositeIncomingArcIterator.html">util::ReverseArcStaticGraph::OutgoingOrOppositeIncomingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01888">graph.h:1888</a></div></div>
|
|
<div class="ttc" id="classutil_1_1SVector_html_ac342b96ebd12c4cc505567c0d5342fd6"><div class="ttname"><a href="classutil_1_1SVector.html#ac342b96ebd12c4cc505567c0d5342fd6">util::SVector::SVector</a></div><div class="ttdeci">SVector()</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00774">graph.h:774</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|