259 lines
501 KiB
HTML
259 lines
501 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">Google OR-Tools 7.3</span>
|
|
</div>
|
|
</div>
|
|
<div id="content" style="width: 100%; overflow: hidden;">
|
|
<div style="margin-left: 15px; margin-top: 5px; float: left; color: #145A32;">
|
|
<h2>C++ Reference</h2>
|
|
<ul>
|
|
<li><a href="../cpp_algorithms/annotated.html">Algorithms</a></li>
|
|
<li><a href="../cpp_sat/annotated.html">CP-SAT</a></li>
|
|
<li><a href="../cpp_graph/annotated.html">Graph</a></li>
|
|
<li><a href="../cpp_routing/annotated.html">Routing</a></li>
|
|
<li><a href="../cpp_linear/annotated.html">Linear solver</a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="content">
|
|
<div align="center">
|
|
<h1 style="color: #145A32;">C++ Reference: Graph</h1>
|
|
</div>
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<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 id="nav-path" class="navpath">
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_725f3a5915051842f84e3ea508be2a62.html">graph</a></li> </ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">ebert_graph.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="ebert__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="preprocessor">#ifndef OR_TOOLS_GRAPH_EBERT_GRAPH_H_</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#define OR_TOOLS_GRAPH_EBERT_GRAPH_H_</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> </div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// A few variations on a theme of the "star" graph representation by</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// Ebert, as described in J. Ebert, "A versatile data structure for</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">// edge-oriented graph algorithms." Communications of the ACM</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// 30(6):513-519 (June 1987).</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// http://portal.acm.org/citation.cfm?id=214769</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">//</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// In this file there are three representations that have much in</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">// common. The general one, called simply EbertGraph, contains both</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// forward- and backward-star representations. The other, called</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">// ForwardEbertGraph, contains only the forward-star representation of</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// the graph, and is appropriate for applications where the reverse</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// arcs are not needed.</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">//</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// The point of including all the representations in this one file is</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// to capitalize, where possible, on the commonalities among them, and</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// those commonalities are mostly factored out into base classes as</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// described below. Despite the commonalities, however, each of the</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// three representations presents a somewhat different interface</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// because of their different underlying semantics. A quintessential</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// example is that the AddArc() method, very natural for the</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// EbertGraph representation, cannot exist for an inherently static</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// representation like ForwardStaticGraph.</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">//</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// Many clients are expected to use the interfaces to the graph</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// objects directly, but some clients are parameterized by graph type</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// and need a consistent interface for their underlying graph</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// objects. For such clients, a small library of class templates is</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// provided to give a consistent interface to clients where the</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// underlying graph interfaces differ. Examples are the</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// AnnotatedGraphBuildManager<> template, which provides a uniform</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// interface for building the various types of graphs; and the</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// TailArrayManager<> template, which provides a uniform interface for</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// applications that need to map from arc indices to arc tail nodes,</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// accounting for the fact that such a mapping has to be requested</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// explicitly from the ForwardStaticGraph and ForwardStarGraph</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// representations.</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment">//</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// There are two base class templates, StarGraphBase, and</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// EbertGraphBase; their purpose is to hold methods and data</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// structures that are in common among their descendants. Only classes</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment">// that are leaves in the following hierarchy tree are eligible for</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// free-standing instantiation and use by clients. The parentheses</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment">// around StarGraphBase and EbertGraphBase indicate that they should</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment">// not normally be instantiated by clients:</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">// (StarGraphBase) |</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">// / \ |</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">// / \ |</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment">// (EbertGraphBase) ForwardStaticGraph |</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">// / \ |</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// EbertGraph ForwardEbertGraph |</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment">//</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// In the general EbertGraph case, the graph is represented with three</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// arrays.</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// Let n be the number of nodes and m be the number of arcs.</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment">// Let i be an integer in [0..m-1], denoting the index of an arc.</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// * head_[i] contains the end-node of arc i,</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// * head_[-i-1] contains the start-node of arc i.</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// Note that in two's-complement arithmetic, -i-1 = ~i.</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// Consequently:</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment">// * head_[~i] contains the end-node of the arc reverse to arc i,</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment">// * head_[i] contains the start-node of the arc reverse to arc i.</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// Note that if arc (u, v) is defined, then the data structure also stores</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment">// (v, u).</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment">// Arc ~i thus denotes the arc reverse to arc i.</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment">// This is what makes this representation useful for undirected graphs and for</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment">// implementing algorithms like bidirectional shortest paths.</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment">// Also note that the representation handles multi-graphs. If several arcs</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment">// going from node u to node v are added to the graph, they will be handled as</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment">// separate arcs.</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">// Now, for an integer u in [0..n-1] denoting the index of a node:</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment">// * first_incident_arc_[u] denotes the first arc in the adjacency list of u.</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// * going from an arc i, the adjacency list can be traversed using</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment">// j = next_adjacent_arc_[i].</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment">//</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// The EbertGraph implementation has the following benefits:</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// * It is able to handle both directed or undirected graphs.</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment">// * Being based on indices, it is easily serializable. Only the contents</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment">// of the head_ array need to be stored. Even so, serialization is</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment">// currently not implemented.</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment">// * The node indices and arc indices can be stored in 32 bits, while</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// still allowing to go a bit further than the 4-gigabyte</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// limitation (48 gigabytes for a pure graph, without capacities or</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment">// costs.)</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// * The representation can be recomputed if edges have been loaded from</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// * The representation can be recomputed if edges have been loaded from</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment">// external memory or if edges have been re-ordered.</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// * The memory consumption is: 2 * m * sizeof(NodeIndexType)</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// + 2 * m * sizeof(ArcIndexType)</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment">// + n * sizeof(ArcIndexType)</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment">// plus a small constant.</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment">//</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment">// The EbertGraph implementation differs from the implementation described in</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// [Ebert 1987] in the following respects:</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment">// * arcs are represented using an (i, ~i) approach, whereas Ebert used</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment">// (i, -i). Indices for direct arcs thus start at 0, in a fashion that is</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// compatible with the index numbering in C and C++. Note that we also tested</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment">// a (2*i, 2*i+1) storage pattern, which did not show any speed benefit, and</span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment">// made the use of the API much more difficult.</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment">// * because of this, the 'nil' values for nodes and arcs are not 0, as Ebert</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// first described. The value for the 'nil' node is set to -1, while the</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// value for the 'nil' arc is set to the smallest integer representable with</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// ArcIndexSize bytes.</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment">// * it is possible to add arcs to the graph, with AddArc, in a much simpler</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment">// way than described by Ebert.</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// * TODO(user) although it is already possible, using the</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="comment">// GroupForwardArcsByFunctor method, to group all the outgoing (resp.</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment">// incoming) arcs of a node, the iterator logic could still be improved to</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// allow traversing the outgoing (resp. incoming) arcs in O(out_degree(node))</span></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment">// (resp. O(in_degree(node))) instead of O(degree(node)).</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment">// * TODO(user) it is possible to implement arc deletion and garbage collection</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment">// in an efficient (relatively) manner. For the time being we haven't seen an</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment">// application for this.</span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment">//</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment">// The ForwardEbertGraph representation is like the EbertGraph case described</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment">// above, with the following modifications:</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment">// * The part of the head_[] array with negative indices is absent. In its</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment">// place is a pointer tail_ which, if assigned, points to an array of tail</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// nodes indexed by (nonnegative) arc index. In typical usage tail_ is NULL</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// and the memory for the tail nodes need not be allocated.</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment">// * The array of arc tails can be allocated as needed and populated from the</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// adjacency lists of the graph.</span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment">// * Representing only the forward star of each node implies that the graph</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// cannot be serialized directly nor rebuilt from scratch from just the head_</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// array. Rebuilding from scratch requires constructing the array of arc</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// tails from the adjacency lists first, and serialization can be done either</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// by first constructing the array of arc tails from the adjacency lists, or</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment">// by serializing directly from the adjacency lists.</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// * The memory consumption is: m * sizeof(NodeIndexType)</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// + m * sizeof(ArcIndexType)</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment">// + n * sizeof(ArcIndexType)</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment">// plus a small constant when the array of arc tails is absent. Allocating</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// the arc tail array adds another m * sizeof(NodeIndexType).</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment">//</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment">// The ForwardStaticGraph representation is restricted yet farther</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment">// than ForwardEbertGraph, with the benefit that it provides higher</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// performance to those applications that can use it.</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment">// * As with ForwardEbertGraph, the presence of the array of arc</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment">// tails is optional.</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment">// * The outgoing adjacency list for each node is stored in a</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment">// contiguous segment of the head_[] array, obviating the</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment">// next_adjacent_arc_ structure entirely and ensuring good locality</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment">// of reference for applications that iterate over outgoing</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment">// adjacency lists.</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment">// * The memory consumption is: m * sizeof(NodeIndexType)</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment">// + n * sizeof(ArcIndexType)</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment">// plus a small constant when the array of arc tails is absent. Allocating</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="comment">// the arc tail array adds another m * sizeof(NodeIndexType).</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="preprocessor">#include <algorithm></span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="preprocessor">#include <limits></span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="preprocessor">#include <memory></span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="preprocessor">#include <string></span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="preprocessor">#include <utility></span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> </div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="preprocessor">#include "absl/strings/str_cat.h"</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="preprocessor">#include "ortools/base/integral_types.h"</span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="preprocessor">#include "ortools/base/logging.h"</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="preprocessor">#include "ortools/base/macros.h"</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="preprocessor">#include "ortools/util/permutation.h"</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="preprocessor">#include "ortools/util/zvector.h"</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> </div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="comment">// Forward declarations.</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l00188"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html"> 188</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1EbertGraph.html">EbertGraph</a>;</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l00190"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html"> 190</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1ForwardEbertGraph.html">ForwardEbertGraph</a>;</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l00192"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582"> 192</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1ForwardStaticGraph.html">ForwardStaticGraph</a>;</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> </div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment">// Standard instantiation of ForwardEbertGraph (named 'ForwardStarGraph') of</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment">// EbertGraph (named 'StarGraph'); and relevant type shortcuts. Unless their use</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment">// cases prevent them from doing so, users are encouraged to use StarGraph or</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="comment">// ForwardStarGraph according to whether or not they require reverse arcs to be</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment">// represented explicitly. Along with either graph representation, the other</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment">// type shortcuts here will often come in handy.</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="keyword">typedef</span> int32 <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">NodeIndex</a>;</div><div class="line"><a name="l00201"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d"> 201</a></span> <span class="keyword">typedef</span> int32 <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a>;</div><div class="line"><a name="l00202"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260"> 202</a></span> <span class="keyword">typedef</span> int64 <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a>;</div><div class="line"><a name="l00203"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a026ab0f83bfbeba2607959633753ff2e"> 203</a></span> <span class="keyword">typedef</span> int64 <a class="code" href="namespaceoperations__research.html#a026ab0f83bfbeba2607959633753ff2e">CostValue</a>;</div><div class="line"><a name="l00204"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#af24b13c27331f67db15d6c2a3f3507e3"> 204</a></span> <span class="keyword">typedef</span> <a class="code" href="classoperations__research_1_1EbertGraph.html">EbertGraph<NodeIndex, ArcIndex></a> <a class="code" href="namespaceoperations__research.html#af24b13c27331f67db15d6c2a3f3507e3">StarGraph</a>;</div><div class="line"><a name="l00205"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ab49bc230c31b15a51efb44be25b30472"> 205</a></span> <span class="keyword">typedef</span> <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html">ForwardEbertGraph<NodeIndex, ArcIndex></a> <a class="code" href="namespaceoperations__research.html#ab49bc230c31b15a51efb44be25b30472">ForwardStarGraph</a>;</div><div class="line"><a name="l00206"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ab2ba507587a78ec3b72a0d62c024bc7e"> 206</a></span> <span class="keyword">typedef</span> <a class="code" href="classoperations__research_1_1ForwardStaticGraph.html">ForwardStaticGraph<NodeIndex, ArcIndex></a> <a class="code" href="namespaceoperations__research.html#ab2ba507587a78ec3b72a0d62c024bc7e">ForwardStarStaticGraph</a>;</div><div class="line"><a name="l00207"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a48bfd7172b9a8af435198c373a8cf5e4"> 207</a></span> <span class="keyword">typedef</span> ZVector<NodeIndex> <a class="code" href="namespaceoperations__research.html#a48bfd7172b9a8af435198c373a8cf5e4">NodeIndexArray</a>;</div><div class="line"><a name="l00208"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ad2ab85b2912dbf12804d3d1ddea9ec15"> 208</a></span> <span class="keyword">typedef</span> ZVector<ArcIndex> <a class="code" href="namespaceoperations__research.html#ad2ab85b2912dbf12804d3d1ddea9ec15">ArcIndexArray</a>;</div><div class="line"><a name="l00209"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a03fc0981d2d99da114ccd8b3abc0c6e1"> 209</a></span> <span class="keyword">typedef</span> ZVector<FlowQuantity> <a class="code" href="namespaceoperations__research.html#a03fc0981d2d99da114ccd8b3abc0c6e1">QuantityArray</a>;</div><div class="line"><a name="l00210"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#acbdd6fd1484828a3d5e809c551ba8cf7"> 210</a></span> <span class="keyword">typedef</span> ZVector<CostValue> <a class="code" href="namespaceoperations__research.html#acbdd6fd1484828a3d5e809c551ba8cf7">CostArray</a>;</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="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keyword">typename</span> DerivedGraph></div><div class="line"><a name="l00213"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html"> 213</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1StarGraphBase.html">StarGraphBase</a> {</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="comment">// The index of the 'nil' node in the graph.</span></div><div class="line"><a name="l00216"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed"> 216</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">kNilNode</a>;</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> </div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">// The index of the 'nil' arc in the graph.</span></div><div class="line"><a name="l00219"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba"> 219</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>;</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> </div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="comment">// The index of the first node in the graph.</span></div><div class="line"><a name="l00222"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b"> 222</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a>;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> </div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="comment">// The index of the first arc in the graph.</span></div><div class="line"><a name="l00225"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a"> 225</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>;</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> </div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="comment">// The maximum possible number of nodes in the graph. (The maximum</span></div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="comment">// index is kMaxNumNodes-1, since indices start at 0. Unfortunately</span></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="comment">// we waste a value representing this and the max_num_nodes_ member.)</span></div><div class="line"><a name="l00230"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#aad916b80da8f95078f693e604c8985ac"> 230</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#aad916b80da8f95078f693e604c8985ac">kMaxNumNodes</a>;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> </div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">// The maximum possible number of arcs in the graph. (The maximum</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="comment">// index is kMaxNumArcs-1, since indices start at 0. Unfortunately</span></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="comment">// we waste a value representing this and the max_num_arcs_ member.)</span></div><div class="line"><a name="l00235"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a5d6f4ad584d8fae3c29633c75138b177"> 235</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a5d6f4ad584d8fae3c29633c75138b177">kMaxNumArcs</a>;</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="comment">// Returns the number of nodes in the graph.</span></div><div class="line"><a name="l00237"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#a6a2df5042167b234f6dc3aed4acfa6c9"> 237</a></span>  NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6a2df5042167b234f6dc3aed4acfa6c9">num_nodes</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a>; }</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> </div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="comment">// Returns the number of original arcs in the graph</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// (The ones with positive indices.)</span></div><div class="line"><a name="l00241"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#a4d3fc55a2fe209a908470199437cec9a"> 241</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">num_arcs_</a>; }</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> </div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="comment">// Returns one more than the largest index of an extant node,</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="comment">// meaning a node that is mentioned as the head or tail of some arc</span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="comment">// in the graph. To be used as a helper when clients need to</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">// dimension or iterate over arrays of node annotation information.</span></div><div class="line"><a name="l00247"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#abe63d4d83bcc1da204931b4687494460"> 247</a></span>  NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#abe63d4d83bcc1da204931b4687494460">end_node_index</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a>; }</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> </div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="comment">// Returns one more than the largest index of an extant direct</span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="comment">// arc. To be used as a helper when clients need to dimension or</span></div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="comment">// iterate over arrays of arc annotation information.</span></div><div class="line"><a name="l00252"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a8b9175b7d6fd63f5ae764a7ea44d13e0"> 252</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a8b9175b7d6fd63f5ae764a7ea44d13e0">end_arc_index</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">num_arcs_</a>; }</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> </div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="comment">// Returns the maximum possible number of nodes in the graph.</span></div><div class="line"><a name="l00255"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#a29774a2f068745000e90eaf549543144"> 255</a></span>  NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a29774a2f068745000e90eaf549543144">max_num_nodes</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#ab059bfdc4854ebf3ffa22cc778a436c3">max_num_nodes_</a>; }</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> </div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="comment">// Returns the maximum possible number of original arcs in the graph.</span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="comment">// (The ones with positive indices.)</span></div><div class="line"><a name="l00259"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#a6dea64dce5de0432befc47f85176ab19"> 259</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6dea64dce5de0432befc47f85176ab19">max_num_arcs</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</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">// Returns one more than the largest valid index of a node. To be</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="comment">// used as a helper when clients need to dimension or iterate over</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="comment">// arrays of node annotation information.</span></div><div class="line"><a name="l00264"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#adb3250cf217e042d99de43a4e22a9360"> 264</a></span>  NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#adb3250cf217e042d99de43a4e22a9360">max_end_node_index</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#ab059bfdc4854ebf3ffa22cc778a436c3">max_num_nodes_</a>;</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  }</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> </div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="comment">// Returns one more than the largest valid index of a direct arc. To</span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="comment">// be used as a helper when clients need to dimension or iterate</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">// over arrays of arc annotation information.</span></div><div class="line"><a name="l00271"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#aad16076f9d10c90b9b9e0ccfddf878ed"> 271</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#aad16076f9d10c90b9b9e0ccfddf878ed">max_end_arc_index</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a>; }</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> </div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="comment">// Utility function to check that a node index is within the bounds AND</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="comment">// different from kNilNode.</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">// Returns true if node is in the range [kFirstNode .. max_num_nodes_).</span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// It is exported so that users of the DerivedGraph class can use it.</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">// To be used in a DCHECK; also used internally to validate</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">// arguments passed to our methods from clients (e.g., AddArc()).</span></div><div class="line"><a name="l00279"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a2b88b717e42d7137a884c36e35052191"> 279</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a2b88b717e42d7137a884c36e35052191">IsNodeValid</a>(NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">return</span> node >= <a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> && node < <a class="code" href="classoperations__research_1_1StarGraphBase.html#ab059bfdc4854ebf3ffa22cc778a436c3">max_num_nodes_</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">// Returns the first arc going from tail to head, if it exists, or kNilArc</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="comment">// if such an arc does not exist.</span></div><div class="line"><a name="l00285"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#afd99777b09af9bfb951f88dbb93e11e7"> 285</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#afd99777b09af9bfb951f88dbb93e11e7">LookUpArc</a>(<span class="keyword">const</span> NodeIndexType tail,</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keyword">const</span> NodeIndexType head)<span class="keyword"> const </span>{</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordflow">for</span> (ArcIndexType arc = <a class="code" href="classoperations__research_1_1StarGraphBase.html#ac16ad50a1e5ffab13d1022bcc7fe75d8">FirstOutgoingArc</a>(tail); arc != <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>;</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  arc = ThisAsDerived()->NextOutgoingArc(tail, arc)) {</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1StarGraphBase.html#a5237cfbb86ec8f305e498e873e5c4e95">Head</a>(arc) == head) {</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keywordflow">return</span> arc;</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  }</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  }</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>;</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  }</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> </div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="comment">// Returns the head or end-node of arc.</span></div><div class="line"><a name="l00297"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#a5237cfbb86ec8f305e498e873e5c4e95"> 297</a></span>  NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a5237cfbb86ec8f305e498e873e5c4e95">Head</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  DCHECK(ThisAsDerived()->CheckArcValidity(arc));</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>[arc];</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  }</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> </div><div class="line"><a name="l00302"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#a74cc112e18e1496d720c48f6082d2671"> 302</a></span>  std::string <a class="code" href="classoperations__research_1_1StarGraphBase.html#a74cc112e18e1496d720c48f6082d2671">NodeDebugString</a>(<span class="keyword">const</span> NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">if</span> (node == <a class="code" href="classoperations__research_1_1StarGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">kNilNode</a>) {</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordflow">return</span> <span class="stringliteral">"NilNode"</span>;</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">return</span> absl::StrCat(static_cast<int64>(node));</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  }</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> </div><div class="line"><a name="l00310"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#a58d0c72004cf773e707cb9d43dafc308"> 310</a></span>  std::string <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58d0c72004cf773e707cb9d43dafc308">ArcDebugString</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">if</span> (arc == <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>) {</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordflow">return</span> <span class="stringliteral">"NilArc"</span>;</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">return</span> absl::StrCat(static_cast<int64>(arc));</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  }</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="preprocessor">#if !defined(SWIG)</span></div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="comment">// Iterator class for traversing all the nodes in the graph.</span></div><div class="line"><a name="l00320"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html"> 320</a></span>  <span class="keyword">class </span><a class="code" href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html">NodeIterator</a> {</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00322"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html#a6576678b506bfba6711ae32c3f87beb4"> 322</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html#a6576678b506bfba6711ae32c3f87beb4">NodeIterator</a>(<span class="keyword">const</span> DerivedGraph& graph)</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  : graph_(graph), head_(graph_.<a class="code" href="classoperations__research_1_1StarGraphBase.html#abfdc255fd93491a9a8ac563a412f57e3">StartNode</a>(<a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a>)) {}</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span> </div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="comment">// Returns true unless all the nodes have been traversed.</span></div><div class="line"><a name="l00326"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347"> 326</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347">Ok</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> head_ != <a class="code" href="classoperations__research_1_1StarGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">kNilNode</a>; }</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> </div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="comment">// Advances the current node index.</span></div><div class="line"><a name="l00329"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html#a659a293dd51073a1b9560bb80f687705"> 329</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html#a659a293dd51073a1b9560bb80f687705">Next</a>() { head_ = graph_.NextNode(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">// Returns the index of the node currently pointed to by the iterator.</span></div><div class="line"><a name="l00332"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html#a7b78af4fdec0e25f2d56225912f888e6"> 332</a></span>  NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html#a7b78af4fdec0e25f2d56225912f888e6">Index</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> head_; }</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> </div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="comment">// A reference to the current DerivedGraph considered.</span></div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keyword">const</span> DerivedGraph& graph_;</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> </div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="comment">// The index of the current node considered.</span></div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  NodeIndexType head_;</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  };</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">// Iterator class for traversing the arcs in the graph.</span></div><div class="line"><a name="l00343"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html"> 343</a></span>  <span class="keyword">class </span><a class="code" href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html">ArcIterator</a> {</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00345"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html#a7daec7672f0f4e44962e7c6061ca2632"> 345</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html#a7daec7672f0f4e44962e7c6061ca2632">ArcIterator</a>(<span class="keyword">const</span> DerivedGraph& graph)</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  : graph_(graph), arc_(graph_.<a class="code" href="classoperations__research_1_1StarGraphBase.html#afc2f0055a1b672fbd6102d0d9a3b8c28">StartArc</a>(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>)) {}</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> </div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="comment">// Returns true unless all the arcs have been traversed.</span></div><div class="line"><a name="l00349"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347"> 349</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347">Ok</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> arc_ != <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>; }</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> </div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="comment">// Advances the current arc index.</span></div><div class="line"><a name="l00352"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html#a659a293dd51073a1b9560bb80f687705"> 352</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html#a659a293dd51073a1b9560bb80f687705">Next</a>() { arc_ = graph_.NextArc(arc_); }</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span> </div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="comment">// Returns the index of the arc currently pointed to by the iterator.</span></div><div class="line"><a name="l00355"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html#adac23a27a3389aea80f75741569afe35"> 355</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html#adac23a27a3389aea80f75741569afe35">Index</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> arc_; }</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> </div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="comment">// A reference to the current DerivedGraph considered.</span></div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keyword">const</span> DerivedGraph& graph_;</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> </div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="comment">// The index of the current arc considered.</span></div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  ArcIndexType arc_;</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  };</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> </div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="comment">// Iterator class for traversing the outgoing arcs associated to a given node.</span></div><div class="line"><a name="l00366"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html"> 366</a></span>  <span class="keyword">class </span><a class="code" href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html">OutgoingArcIterator</a> {</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00368"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#ae30477c6e9f2a945e1327ee443bf81be"> 368</a></span>  <a class="code" href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#ae30477c6e9f2a945e1327ee443bf81be">OutgoingArcIterator</a>(<span class="keyword">const</span> DerivedGraph& graph, NodeIndexType node)</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  : graph_(graph),</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  node_(graph_.<a class="code" href="classoperations__research_1_1StarGraphBase.html#abfdc255fd93491a9a8ac563a412f57e3">StartNode</a>(node)),</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  arc_(graph_.<a class="code" href="classoperations__research_1_1StarGraphBase.html#afc2f0055a1b672fbd6102d0d9a3b8c28">StartArc</a>(graph_.<a class="code" href="classoperations__research_1_1StarGraphBase.html#ac16ad50a1e5ffab13d1022bcc7fe75d8">FirstOutgoingArc</a>(node))) {</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  DCHECK(CheckInvariant());</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</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="comment">// This constructor takes an arc as extra argument and makes the iterator</span></div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="comment">// start at arc.</span></div><div class="line"><a name="l00377"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#adb89d4c88029fe2fa9992864e32c0391"> 377</a></span>  <a class="code" href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#adb89d4c88029fe2fa9992864e32c0391">OutgoingArcIterator</a>(<span class="keyword">const</span> DerivedGraph& graph, NodeIndexType node,</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  ArcIndexType arc)</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  : graph_(graph),</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  node_(graph_.<a class="code" href="classoperations__research_1_1StarGraphBase.html#abfdc255fd93491a9a8ac563a412f57e3">StartNode</a>(node)),</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  arc_(graph_.<a class="code" href="classoperations__research_1_1StarGraphBase.html#afc2f0055a1b672fbd6102d0d9a3b8c28">StartArc</a>(arc)) {</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  DCHECK(CheckInvariant());</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  }</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> </div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="comment">// Can only assign from an iterator on the same graph.</span></div><div class="line"><a name="l00386"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#a9161ace1ff0d056c1895c2cab31b308c"> 386</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#a9161ace1ff0d056c1895c2cab31b308c">operator=</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html">OutgoingArcIterator</a>& iterator) {</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  DCHECK(&iterator.graph_ == &graph_);</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  node_ = iterator.node_;</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  arc_ = iterator.arc_;</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  }</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> </div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="comment">// Returns true unless all the outgoing arcs have been traversed.</span></div><div class="line"><a name="l00393"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347"> 393</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347">Ok</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> arc_ != <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>; }</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> </div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="comment">// Advances the current outgoing arc index.</span></div><div class="line"><a name="l00396"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#a659a293dd51073a1b9560bb80f687705"> 396</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#a659a293dd51073a1b9560bb80f687705">Next</a>() {</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  arc_ = graph_.NextOutgoingArc(node_, arc_);</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  DCHECK(CheckInvariant());</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  }</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> </div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="comment">// Returns the index of the arc currently pointed to by the iterator.</span></div><div class="line"><a name="l00402"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#adac23a27a3389aea80f75741569afe35"> 402</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#adac23a27a3389aea80f75741569afe35">Index</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> arc_; }</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">private</span>:</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="comment">// Returns true if the invariant for the iterator is verified.</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="comment">// To be used in a DCHECK.</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordtype">bool</span> CheckInvariant()<span class="keyword"> const </span>{</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordflow">if</span> (arc_ == <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>) {</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>; <span class="comment">// This occurs when the iterator has reached the end.</span></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  }</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  DCHECK(graph_.IsOutgoing(arc_, node_));</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">return</span> <span class="keyword">true</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> </div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="comment">// A reference to the current DerivedGraph considered.</span></div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keyword">const</span> DerivedGraph& graph_;</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> </div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="comment">// The index of the node on which arcs are iterated.</span></div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  NodeIndexType node_;</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> </div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="comment">// The index of the current arc considered.</span></div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  ArcIndexType arc_;</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="preprocessor">#endif // SWIG</span></div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> </div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00427"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#a87a0f5a59b776268f0b57353ac3e7dcc"> 427</a></span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a87a0f5a59b776268f0b57353ac3e7dcc">StarGraphBase</a>()</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  : <a class="code" href="classoperations__research_1_1StarGraphBase.html#ab059bfdc4854ebf3ffa22cc778a436c3">max_num_nodes_</a>(0),</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a>(0),</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a>(0),</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">num_arcs_</a>(0),</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>() {}</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="classoperations__research_1_1StarGraphBase.html#a4ca086e8da7abeb3cff7ebcfb305719f"> 434</a></span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a4ca086e8da7abeb3cff7ebcfb305719f">~StarGraphBase</a>() {}</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> </div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="comment">// Returns kNilNode if the graph has no nodes or node if it has at least one</span></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="comment">// node. Useful for initializing iterators correctly in the case of empty</span></div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="comment">// graphs.</span></div><div class="line"><a name="l00439"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#abfdc255fd93491a9a8ac563a412f57e3"> 439</a></span>  NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#abfdc255fd93491a9a8ac563a412f57e3">StartNode</a>(NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a> == 0 ? <a class="code" href="classoperations__research_1_1StarGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">kNilNode</a> : node;</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  }</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>  <span class="comment">// Returns kNilArc if the graph has no arcs arc if it has at least one arc.</span></div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="comment">// Useful for initializing iterators correctly in the case of empty graphs.</span></div><div class="line"><a name="l00445"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#afc2f0055a1b672fbd6102d0d9a3b8c28"> 445</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#afc2f0055a1b672fbd6102d0d9a3b8c28">StartArc</a>(ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">num_arcs_</a> == 0 ? <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a> : arc;</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  }</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span> </div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="comment">// Returns the node following the argument in the graph.</span></div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="comment">// Returns kNilNode (= end) if the range of nodes has been exhausted.</span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="comment">// It is called by NodeIterator::Next() and as such does not expect to be</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="comment">// passed an argument equal to kNilNode.</span></div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="comment">// This is why the return line is simplified from</span></div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="comment">// return (node == kNilNode || next_node >= num_nodes_)</span></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="comment">// ? kNilNode : next_node;</span></div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="comment">// to</span></div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="comment">// return next_node < num_nodes_ ? next_node : kNilNode;</span></div><div class="line"><a name="l00458"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#ae7eaa58346f9d7415c11776d7a9dd2ed"> 458</a></span>  NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#ae7eaa58346f9d7415c11776d7a9dd2ed">NextNode</a>(<span class="keyword">const</span> NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  DCHECK(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a2b88b717e42d7137a884c36e35052191">IsNodeValid</a>(node));</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keyword">const</span> NodeIndexType next_node = node + 1;</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordflow">return</span> next_node < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a> ? next_node : <a class="code" href="classoperations__research_1_1StarGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">kNilNode</a>;</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  }</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span> </div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="comment">// Returns the arc following the argument in the graph.</span></div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="comment">// Returns kNilArc (= end) if the range of arcs has been exhausted.</span></div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="comment">// It is called by ArcIterator::Next() and as such does not expect to be</span></div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="comment">// passed an argument equal to kNilArc.</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="comment">// This is why the return line is simplified from</span></div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="comment">// return ( arc == kNilArc || next_arc >= num_arcs_) ? kNilArc : next_arc;</span></div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="comment">// to</span></div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="comment">// return next_arc < num_arcs_ ? next_arc : kNilArc;</span></div><div class="line"><a name="l00472"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#a110289c48d7a56f42f2ff83123a2ec85"> 472</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a110289c48d7a56f42f2ff83123a2ec85">NextArc</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  DCHECK(ThisAsDerived()->CheckArcValidity(arc));</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keyword">const</span> ArcIndexType next_arc = arc + 1;</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keywordflow">return</span> next_arc < <a class="code" href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">num_arcs_</a> ? next_arc : <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>;</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> </div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="comment">// Returns the first outgoing arc for node.</span></div><div class="line"><a name="l00479"></a><span class="lineno"><a class="line" href="classoperations__research_1_1StarGraphBase.html#ac16ad50a1e5ffab13d1022bcc7fe75d8"> 479</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#ac16ad50a1e5ffab13d1022bcc7fe75d8">FirstOutgoingArc</a>(<span class="keyword">const</span> NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  DCHECK(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a2b88b717e42d7137a884c36e35052191">IsNodeValid</a>(node));</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordflow">return</span> ThisAsDerived()->FindNextOutgoingArc(</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  ThisAsDerived()->FirstOutgoingOrOppositeIncomingArc(node));</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  }</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span> </div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="comment">// The maximum number of nodes that the graph can hold.</span></div><div class="line"><a name="l00486"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#ab059bfdc4854ebf3ffa22cc778a436c3"> 486</a></span>  NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#ab059bfdc4854ebf3ffa22cc778a436c3">max_num_nodes_</a>;</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">// The maximum number of arcs that the graph can hold.</span></div><div class="line"><a name="l00489"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8"> 489</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a>;</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span> </div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="comment">// The maximum index of the node currently held by the graph.</span></div><div class="line"><a name="l00492"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa"> 492</a></span>  NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a>;</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span> </div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="comment">// The current number of arcs held by the graph.</span></div><div class="line"><a name="l00495"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#afa0c44b50a5e9459e3339ec50082e635"> 495</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">num_arcs_</a>;</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span> </div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="comment">// Array of node indices. head_[i] contains the head node of arc i.</span></div><div class="line"><a name="l00498"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a"> 498</a></span>  ZVector<NodeIndexType> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>;</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span> </div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="comment">// Array of arc indices. first_incident_arc_[i] contains the first arc</span></div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="comment">// incident to node i.</span></div><div class="line"><a name="l00502"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a58b521f62562f51a79f9c95f1902804a"> 502</a></span>  ZVector<ArcIndexType> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>;</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span> </div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="comment">// Shorthand: returns a const DerivedGraph*-typed version of our</span></div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="comment">// "this" pointer.</span></div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keyword">inline</span> <span class="keyword">const</span> DerivedGraph* ThisAsDerived()<span class="keyword"> const </span>{</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordflow">return</span> static_cast<const DerivedGraph*>(<span class="keyword">this</span>);</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  }</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span> </div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="comment">// Shorthand: returns a DerivedGraph*-typed version of our "this"</span></div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="comment">// pointer.</span></div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keyword">inline</span> DerivedGraph* ThisAsDerived() {</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">return</span> static_cast<DerivedGraph*>(<span class="keyword">this</span>);</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  }</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span> };</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span> </div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l00519"></a><span class="lineno"><a class="line" href="classoperations__research_1_1PermutationIndexComparisonByArcHead.html"> 519</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1PermutationIndexComparisonByArcHead.html">PermutationIndexComparisonByArcHead</a> {</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00521"></a><span class="lineno"><a class="line" href="classoperations__research_1_1PermutationIndexComparisonByArcHead.html#aaf93c351ba18edcfcc2949a6c31fc9b1"> 521</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1PermutationIndexComparisonByArcHead.html#aaf93c351ba18edcfcc2949a6c31fc9b1">PermutationIndexComparisonByArcHead</a>(</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keyword">const</span> ZVector<NodeIndexType>& head)</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  : head_(head) {}</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span> </div><div class="line"><a name="l00525"></a><span class="lineno"><a class="line" href="classoperations__research_1_1PermutationIndexComparisonByArcHead.html#adfac7f64c59dc84fca23bcd984ef2bdd"> 525</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1PermutationIndexComparisonByArcHead.html#adfac7f64c59dc84fca23bcd984ef2bdd">operator()</a>(ArcIndexType a, ArcIndexType b)<span class="keyword"> const </span>{</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keywordflow">return</span> head_[a] < head_[b];</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  }</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span> </div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keyword">const</span> ZVector<NodeIndexType>& head_;</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> };</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span> </div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span> <span class="keyword">class </span>ForwardStaticGraph</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  : <span class="keyword">public</span> StarGraphBase<NodeIndexType, ArcIndexType,</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  ForwardStaticGraph<NodeIndexType, ArcIndexType> > {</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keyword">typedef</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a87a0f5a59b776268f0b57353ac3e7dcc">StarGraphBase</a><NodeIndexType, ArcIndexType,</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  ForwardStaticGraph<NodeIndexType, ArcIndexType> ></div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  Base;</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1StarGraphBase.html#a87a0f5a59b776268f0b57353ac3e7dcc">StarGraphBase</a><NodeIndexType, ArcIndexType,</div><div class="line"><a name="l00541"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph.html#ad350bf8d35134f9fe0208292360cf2a5"> 541</a></span>  <a class="code" href="classoperations__research_1_1ForwardStaticGraph.html">ForwardStaticGraph</a><NodeIndexType, ArcIndexType> >;</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span> </div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58d0c72004cf773e707cb9d43dafc308">Base::ArcDebugString</a>;</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a74cc112e18e1496d720c48f6082d2671">Base::NodeDebugString</a>;</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span> </div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">Base::first_incident_arc_</a>;</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">Base::head_</a>;</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">Base::max_num_arcs_</a>;</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#ab059bfdc4854ebf3ffa22cc778a436c3">Base::max_num_nodes_</a>;</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">Base::num_arcs_</a>;</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">Base::num_nodes_</a>;</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span> </div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span> <span class="preprocessor">#if !defined(SWIG)</span></div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a8b9175b7d6fd63f5ae764a7ea44d13e0">Base::end_arc_index</a>;</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a5237cfbb86ec8f305e498e873e5c4e95">Base::Head</a>;</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a2b88b717e42d7137a884c36e35052191">Base::IsNodeValid</a>;</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span> </div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">Base::kFirstArc</a>;</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">Base::kFirstNode</a>;</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">Base::kNilArc</a>;</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span> <span class="preprocessor">#endif // SWIG</span></div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span> </div><div class="line"><a name="l00564"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph.html#aec05ff3d270a5f888e1623c2a99ff2aa"> 564</a></span>  <span class="keyword">typedef</span> NodeIndexType <a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#aec05ff3d270a5f888e1623c2a99ff2aa">NodeIndex</a>;</div><div class="line"><a name="l00565"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph.html#a92531459eff09455cfa63976f5024906"> 565</a></span>  <span class="keyword">typedef</span> ArcIndexType <a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#a92531459eff09455cfa63976f5024906">ArcIndex</a>;</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span> </div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> <span class="comment">// TODO(user): Configure SWIG to handle the</span></div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span> <span class="comment">// CycleHandlerForAnnotatedArcs class.</span></div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> <span class="preprocessor">#if !defined(SWIG)</span></div><div class="line"><a name="l00570"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html"> 570</a></span>  <span class="keyword">class </span><a class="code" href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html">CycleHandlerForAnnotatedArcs</a></div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  : <span class="keyword">public</span> ArrayIndexCycleHandler<NodeIndexType, ArcIndexType> {</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="keyword">typedef</span> ArrayIndexCycleHandler<NodeIndexType, ArcIndexType> Base;</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span> </div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00575"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html#a3764aae97c7333c95ea9f99a176e98df"> 575</a></span>  <a class="code" href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html#a3764aae97c7333c95ea9f99a176e98df">CycleHandlerForAnnotatedArcs</a>(</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  PermutationCycleHandler<ArcIndexType>* annotation_handler,</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  NodeIndexType* data)</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  : ArrayIndexCycleHandler<NodeIndexType, ArcIndexType>(&data[<a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>]),</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  annotation_handler_(annotation_handler) {}</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span> </div><div class="line"><a name="l00581"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html#a999f9e59b55e3f184efa317522f2eeb0"> 581</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html#a999f9e59b55e3f184efa317522f2eeb0">SetTempFromIndex</a>(ArcIndexType source)<span class="keyword"> override </span>{</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  Base::SetTempFromIndex(source);</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  annotation_handler_->SetTempFromIndex(source);</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  }</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span> </div><div class="line"><a name="l00586"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html#a2fd5ecc6414d07e3456e96c0d665ae9b"> 586</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html#a2fd5ecc6414d07e3456e96c0d665ae9b">SetIndexFromIndex</a>(ArcIndexType source,</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  ArcIndexType destination)<span class="keyword"> const override </span>{</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  Base::SetIndexFromIndex(source, destination);</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  annotation_handler_->SetIndexFromIndex(source, destination);</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</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"><a class="line" href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html#ab8c76fdd7493de9946f7551ed3ca16bc"> 592</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html#ab8c76fdd7493de9946f7551ed3ca16bc">SetIndexFromTemp</a>(ArcIndexType destination)<span class="keyword"> const override </span>{</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  Base::SetIndexFromTemp(destination);</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  annotation_handler_->SetIndexFromTemp(destination);</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</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>  <span class="keyword">private</span>:</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  PermutationCycleHandler<ArcIndexType>* annotation_handler_;</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span> </div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html">CycleHandlerForAnnotatedArcs</a>);</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="preprocessor">#endif // SWIG</span></div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span> </div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="comment">// Constructor for use by GraphBuilderFromArcs instances and direct</span></div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="comment">// clients that want to materialize a graph in one step.</span></div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="comment">// Materializing all at once is the only choice available with a</span></div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="comment">// static graph.</span></div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="comment">//</span></div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="comment">// Args:</span></div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="comment">// sort_arcs_by_head: determines whether arcs incident to each tail</span></div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="comment">// node are sorted by head node.</span></div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="comment">// client_cycle_handler: if non-NULL, mediates the permutation of</span></div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="comment">// arbitrary annotation data belonging to the client according</span></div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="comment">// to the permutation applied to the arcs in forming the</span></div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="comment">// graph. Two permutations may be composed to form the final one</span></div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="comment">// that affects the arcs. First, the arcs are always permuted to</span></div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="comment">// group them by tail node because ForwardStaticGraph requires</span></div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="comment">// this. Second, if each node's outgoing arcs are sorted by head</span></div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="comment">// node (according to sort_arcs_by_head), that sorting implies</span></div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="comment">// an additional permutation on the arcs.</span></div><div class="line"><a name="l00621"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph.html#a6e87f7e1d0b9600ad5aa56a4fd2a8dd3"> 621</a></span>  <a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#a6e87f7e1d0b9600ad5aa56a4fd2a8dd3">ForwardStaticGraph</a>(</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keyword">const</span> NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6a2df5042167b234f6dc3aed4acfa6c9">num_nodes</a>, <span class="keyword">const</span> ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a>,</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> sort_arcs_by_head,</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  std::vector<std::pair<NodeIndexType, NodeIndexType> >* client_input_arcs,</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="comment">// TODO(user): For some reason, SWIG breaks if the</span></div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="comment">// operations_research namespace is not explicit in the</span></div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="comment">// following argument declaration.</span></div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  operations_research::PermutationCycleHandler<ArcIndexType>* <span class="keyword">const</span></div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  client_cycle_handler) {</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a> = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a>;</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">num_arcs_</a> = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a>;</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#ab059bfdc4854ebf3ffa22cc778a436c3">max_num_nodes_</a> = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6a2df5042167b234f6dc3aed4acfa6c9">num_nodes</a>;</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="comment">// A more convenient name for a parameter required by style to be</span></div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="comment">// a pointer, because we modify its referent.</span></div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  std::vector<std::pair<NodeIndexType, NodeIndexType> >& input_arcs =</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  *client_input_arcs;</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span> </div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="comment">// We coopt the first_incident_arc_ array as a node-indexed vector</span></div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="comment">// used for two purposes related to degree before setting up its</span></div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="comment">// final values. First, it counts the out-degree of each</span></div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="comment">// node. Second, it is reused to count the number of arcs outgoing</span></div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="comment">// from each node that have already been put in place from the</span></div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="comment">// given input_arcs. We reserve an extra entry as a sentinel at</span></div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="comment">// the end.</span></div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>.Reserve(<a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a>, <a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6a2df5042167b234f6dc3aed4acfa6c9">num_nodes</a>);</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>.SetAll(0);</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="keywordflow">for</span> (ArcIndexType arc = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>; arc < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a>; ++arc) {</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[<a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> + input_arcs[arc].first] += 1;</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="comment">// Take this opportunity to see how many nodes are really</span></div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="comment">// mentioned in the arc list.</span></div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a> = std::max(</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a>, static_cast<NodeIndexType>(input_arcs[arc].first + 1));</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a> = std::max(</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a>, static_cast<NodeIndexType>(input_arcs[arc].second + 1));</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  }</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  ArcIndexType next_arc = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>;</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="keywordflow">for</span> (NodeIndexType node = 0; node < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6a2df5042167b234f6dc3aed4acfa6c9">num_nodes</a>; ++node) {</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  ArcIndexType degree = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[<a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> + node];</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[<a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> + node] = next_arc;</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  next_arc += degree;</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  }</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  DCHECK_EQ(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a>, next_arc);</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>.Reserve(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>, <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a> - 1);</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  std::unique_ptr<ArcIndexType[]> arc_permutation;</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keywordflow">if</span> (client_cycle_handler != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  arc_permutation.reset(<span class="keyword">new</span> ArcIndexType[<a class="code" href="classoperations__research_1_1StarGraphBase.html#a8b9175b7d6fd63f5ae764a7ea44d13e0">end_arc_index</a>()]);</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keywordflow">for</span> (ArcIndexType input_arc = 0; input_arc < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a>; ++input_arc) {</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  NodeIndexType tail = input_arcs[input_arc].first;</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  NodeIndexType head = input_arcs[input_arc].second;</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  ArcIndexType arc = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[<a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> + tail];</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="comment">// The head_ entry will get permuted into the right place</span></div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="comment">// later.</span></div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>[<a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a> + input_arc] = <a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> + head;</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  arc_permutation[<a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a> + arc] = input_arc;</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[<a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> + tail] += 1;</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  }</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="keywordflow">if</span> (<span class="keyword">sizeof</span>(input_arcs[0].first) >= <span class="keyword">sizeof</span>(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[0])) {</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="comment">// We reuse the input_arcs[].first entries to hold our</span></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="comment">// mapping to the head_ array. This allows us to spread out</span></div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="comment">// cache badness.</span></div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="keywordflow">for</span> (ArcIndexType input_arc = 0; input_arc < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a>; ++input_arc) {</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  NodeIndexType tail = input_arcs[input_arc].first;</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  ArcIndexType arc = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[<a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> + tail];</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[<a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> + tail] = arc + 1;</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  input_arcs[input_arc].first = static_cast<NodeIndexType>(arc);</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  }</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keywordflow">for</span> (ArcIndexType input_arc = 0; input_arc < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a>; ++input_arc) {</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  ArcIndexType arc =</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  static_cast<ArcIndexType>(input_arcs[input_arc].first);</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  NodeIndexType head = input_arcs[input_arc].second;</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>[<a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a> + arc] = <a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> + head;</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  }</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="comment">// We cannot reuse the input_arcs[].first entries so we map to</span></div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="comment">// the head_ array in a single loop.</span></div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="keywordflow">for</span> (ArcIndexType input_arc = 0; input_arc < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a>; ++input_arc) {</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  NodeIndexType tail = input_arcs[input_arc].first;</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  NodeIndexType head = input_arcs[input_arc].second;</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  ArcIndexType arc = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[<a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> + tail];</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[<a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> + tail] = arc + 1;</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>[<a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a> + arc] = <a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> + head;</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  }</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  }</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  }</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="comment">// Shift the entries in first_incident_arc_ to compensate for the</span></div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="comment">// counting each one has done through its incident arcs. Note that</span></div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="comment">// there is a special sentry element at the end of</span></div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="comment">// first_incident_arc_.</span></div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="keywordflow">for</span> (NodeIndexType node = <a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6a2df5042167b234f6dc3aed4acfa6c9">num_nodes</a>; node > <span class="comment">/* kFirstNode */</span> 0;</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  --node) {</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[node] = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[node - 1];</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  }</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[<a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a>] = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>;</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keywordflow">if</span> (sort_arcs_by_head) {</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  ArcIndexType begin = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[<a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a>];</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keywordflow">if</span> (client_cycle_handler != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="keywordflow">for</span> (NodeIndexType node = 0; node < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6a2df5042167b234f6dc3aed4acfa6c9">num_nodes</a>; ++node) {</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  ArcIndexType end = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[node + 1];</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  std::sort(</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  &arc_permutation[begin], &arc_permutation[end],</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <a class="code" href="classoperations__research_1_1PermutationIndexComparisonByArcHead.html">PermutationIndexComparisonByArcHead<NodeIndexType, ArcIndexType></a>(</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>));</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  begin = end;</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  }</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="keywordflow">for</span> (NodeIndexType node = 0; node < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6a2df5042167b234f6dc3aed4acfa6c9">num_nodes</a>; ++node) {</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  ArcIndexType end = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[node + 1];</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="comment">// The second argument in the following has a strange index</span></div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="comment">// expression because ZVector claims that no index is valid</span></div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="comment">// unless it refers to an element in the vector. In particular</span></div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <span class="comment">// an index one past the end is invalid.</span></div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  ArcIndexType begin_index = (begin < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a> ? begin : begin - 1);</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  ArcIndexType begin_offset = (begin < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a> ? 0 : 1);</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  ArcIndexType end_index = (end > 0 ? end - 1 : end);</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  ArcIndexType end_offset = (end > 0 ? 1 : 0);</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  std::sort(&<a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>[begin_index] + begin_offset,</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  &<a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>[end_index] + end_offset);</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  begin = end;</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>  }</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  }</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keywordflow">if</span> (client_cycle_handler != <span class="keyword">nullptr</span> && <a class="code" href="classoperations__research_1_1StarGraphBase.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a> > 0) {</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="comment">// Apply the computed permutation if we haven't already.</span></div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <a class="code" href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html">CycleHandlerForAnnotatedArcs</a> handler_for_constructor(</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  client_cycle_handler, &<a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>[<a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>] - <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>);</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="comment">// We use a permutation cycle handler to place the head array</span></div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="comment">// indices and permute the client's arc annotation data along</span></div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="comment">// with them.</span></div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  PermutationApplier<ArcIndexType> permutation(&handler_for_constructor);</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  permutation.Apply(&arc_permutation[0], <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>, <a class="code" href="classoperations__research_1_1StarGraphBase.html#a8b9175b7d6fd63f5ae764a7ea44d13e0">end_arc_index</a>());</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>  }</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span> </div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="comment">// Returns the tail or start-node of arc.</span></div><div class="line"><a name="l00756"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph.html#aae684b1eb132c8c201f437d88e367b55"> 756</a></span>  NodeIndexType <a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#aae684b1eb132c8c201f437d88e367b55">Tail</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  DCHECK(<a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">CheckArcValidity</a>(arc));</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  DCHECK(<a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#a6832ebe70da89cb9d2efea26a823d204">CheckTailIndexValidity</a>(arc));</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="keywordflow">return</span> (*tail_)[arc];</div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  }</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span> </div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="comment">// Returns true if arc is incoming to node.</span></div><div class="line"><a name="l00763"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph.html#a4bdbd200e31110f301a3fed9abf15626"> 763</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#a4bdbd200e31110f301a3fed9abf15626">IsIncoming</a>(ArcIndexType arc, NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a5237cfbb86ec8f305e498e873e5c4e95">Head</a>(arc) == node;</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  }</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span> </div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="comment">// Utility function to check that an arc index is within the bounds.</span></div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <span class="comment">// It is exported so that users of the ForwardStaticGraph class can use it.</span></div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="comment">// To be used in a DCHECK.</span></div><div class="line"><a name="l00770"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb"> 770</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">CheckArcBounds</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="keywordflow">return</span> ((arc == <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>) || (arc >= <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a> && arc < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a>));</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  }</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span> </div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="comment">// Utility function to check that an arc index is within the bounds AND</span></div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="comment">// different from kNilArc.</span></div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="comment">// It is exported so that users of the ForwardStaticGraph class can use it.</span></div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="comment">// To be used in a DCHECK.</span></div><div class="line"><a name="l00778"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph.html#a553e5eeb2887a1d7663e1200b7466e6c"> 778</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">CheckArcValidity</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <span class="keywordflow">return</span> ((arc != <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>) && (arc >= <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a> && arc < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a>));</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  }</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span> </div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="comment">// Returns true if arc is a valid index into the (*tail_) array.</span></div><div class="line"><a name="l00783"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph.html#a6832ebe70da89cb9d2efea26a823d204"> 783</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#a6832ebe70da89cb9d2efea26a823d204">CheckTailIndexValidity</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="keywordflow">return</span> ((tail_ != <span class="keyword">nullptr</span>) && (arc >= <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>) &&</div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  (arc <= tail_->max_index()));</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  }</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span> </div><div class="line"><a name="l00788"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph.html#a6a53939b18e4b76d6f6ff9274c23b81b"> 788</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#a6a53939b18e4b76d6f6ff9274c23b81b">NextOutgoingArc</a>(<span class="keyword">const</span> NodeIndexType node,</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  DCHECK(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a2b88b717e42d7137a884c36e35052191">IsNodeValid</a>(node));</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  DCHECK(<a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">CheckArcValidity</a>(arc));</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  ++arc;</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="keywordflow">if</span> (arc < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[node + 1]) {</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="keywordflow">return</span> arc;</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>;</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</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">// Returns a debug std::string containing all the information contained in the</span></div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  <span class="comment">// data structure in raw form.</span></div><div class="line"><a name="l00802"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph.html#a764be64f3029f8b8e23511061d8de355"> 802</a></span>  std::string <a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  std::string result = <span class="stringliteral">"Arcs:(node) :\n"</span>;</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keywordflow">for</span> (ArcIndexType arc = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>; arc < <a class="code" href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">num_arcs_</a>; ++arc) {</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  result += <span class="stringliteral">" "</span> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58d0c72004cf773e707cb9d43dafc308">ArcDebugString</a>(arc) + <span class="stringliteral">":("</span> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a74cc112e18e1496d720c48f6082d2671">NodeDebugString</a>(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>[arc]) +</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="stringliteral">")\n"</span>;</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  }</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  result += <span class="stringliteral">"Node:First arc :\n"</span>;</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="keywordflow">for</span> (NodeIndexType node = <a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a>; node <= <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a>; ++node) {</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  result += <span class="stringliteral">" "</span> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a74cc112e18e1496d720c48f6082d2671">NodeDebugString</a>(node) + <span class="stringliteral">":"</span> +</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58d0c72004cf773e707cb9d43dafc308">ArcDebugString</a>(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[node]) + <span class="stringliteral">"\n"</span>;</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  }</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  }</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span> </div><div class="line"><a name="l00816"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph.html#a53ee05de8f3dd5145b9c0a5ef903a399"> 816</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#a53ee05de8f3dd5145b9c0a5ef903a399">BuildTailArray</a>() {</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="comment">// If (*tail_) is already allocated, we have the invariant that</span></div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <span class="comment">// its contents are canonical, so we do not need to do anything</span></div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="comment">// here in that case except return true.</span></div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="keywordflow">if</span> (tail_ == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="keywordflow">if</span> (!RepresentationClean()) {</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  <span class="comment">// We have been asked to build the (*tail_) array, but we have</span></div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <span class="comment">// no valid information from which to build it. The graph is</span></div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="comment">// in an unrecoverable, inconsistent state.</span></div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  }</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="comment">// Reallocate (*tail_) and rebuild its contents from the</span></div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  <span class="comment">// adjacency lists.</span></div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  tail_.reset(<span class="keyword">new</span> ZVector<NodeIndexType>);</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  tail_->Reserve(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>, <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a> - 1);</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keyword">typename</span> Base::NodeIterator node_it(*<span class="keyword">this</span>);</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="keywordflow">for</span> (; node_it.Ok(); node_it.Next()) {</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  NodeIndexType node = node_it.Index();</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="keyword">typename</span> Base::OutgoingArcIterator arc_it(*<span class="keyword">this</span>, node);</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <span class="keywordflow">for</span> (; arc_it.Ok(); arc_it.Next()) {</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  (*tail_)[arc_it.Index()] = node;</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  }</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"> 840</span>  DCHECK(<a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#adf0cfc6d2bc79267111a8d38a1f6ffea">TailArrayComplete</a>());</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  }</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="classoperations__research_1_1ForwardStaticGraph.html#a6310ea59fd0f4f0f5de8671c87134fd9"> 844</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#a6310ea59fd0f4f0f5de8671c87134fd9">ReleaseTailArray</a>() { tail_.reset(<span class="keyword">nullptr</span>); }</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span> </div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="comment">// To be used in a DCHECK().</span></div><div class="line"><a name="l00847"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardStaticGraph.html#adf0cfc6d2bc79267111a8d38a1f6ffea"> 847</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#adf0cfc6d2bc79267111a8d38a1f6ffea">TailArrayComplete</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  CHECK(tail_);</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keywordflow">for</span> (ArcIndexType arc = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>; arc < <a class="code" href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">num_arcs_</a>; ++arc) {</div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  CHECK(<a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#a6832ebe70da89cb9d2efea26a823d204">CheckTailIndexValidity</a>(arc));</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  CHECK(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a2b88b717e42d7137a884c36e35052191">IsNodeValid</a>((*tail_)[arc]));</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  }</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  }</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span> </div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keywordtype">bool</span> IsDirect()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keywordtype">bool</span> RepresentationClean()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keywordtype">bool</span> IsOutgoing(<span class="keyword">const</span> NodeIndexType node,</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="keyword">const</span> ArcIndexType unused_arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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> </div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="comment">// Returns the first arc in node's incidence list.</span></div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  ArcIndexType FirstOutgoingOrOppositeIncomingArc(NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  DCHECK(RepresentationClean());</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  DCHECK(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a2b88b717e42d7137a884c36e35052191">IsNodeValid</a>(node));</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  ArcIndexType result = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[node];</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="keywordflow">return</span> ((result != <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[node + 1]) ? result : <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>);</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> </div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="comment">// Utility method that finds the next outgoing arc.</span></div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  ArcIndexType FindNextOutgoingArc(ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  DCHECK(<a class="code" href="classoperations__research_1_1ForwardStaticGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">CheckArcBounds</a>(arc));</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="keywordflow">return</span> arc;</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  }</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span> </div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <span class="comment">// Array of node indices, not always present. (*tail_)[i] contains</span></div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <span class="comment">// the tail node of arc i. This array is not needed for normal graph</span></div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="comment">// traversal operations, but is used in optimizing the graph's</span></div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="comment">// layout so arcs are grouped by tail node, and can be used in one</span></div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="comment">// approach to serializing the graph.</span></div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="comment">//</span></div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <span class="comment">// Invariants: At any time when we are not executing a method of</span></div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="comment">// this class, either tail_ == NULL or the tail_ array's contents</span></div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="comment">// are kept canonical. If tail_ != NULL, any method that modifies</span></div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="comment">// adjacency lists must also ensure (*tail_) is modified</span></div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="comment">// correspondingly. The converse does not hold: Modifications to</span></div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="comment">// (*tail_) are allowed without updating the adjacency lists. If</span></div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="comment">// such modifications take place, representation_clean_ must be set</span></div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="comment">// to false, of course, to indicate that the adjacency lists are no</span></div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="comment">// longer current.</span></div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  std::unique_ptr<ZVector<NodeIndexType> > tail_;</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span> };</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span> </div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span> <span class="comment">// The index of the 'nil' node in the graph.</span></div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keyword">typename</span> DerivedGraph></div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span> <span class="keyword">const</span> NodeIndexType</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">StarGraphBase<NodeIndexType, ArcIndexType, DerivedGraph>::kNilNode</a> = -1;</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span> </div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span> <span class="comment">// The index of the 'nil' arc in the graph.</span></div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keyword">typename</span> DerivedGraph></div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span> <span class="keyword">const</span> ArcIndexType</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">StarGraphBase<NodeIndexType, ArcIndexType, DerivedGraph>::kNilArc</a> =</div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  std::numeric_limits<ArcIndexType>::min();</div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span> </div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span> <span class="comment">// The index of the first node in the graph.</span></div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keyword">typename</span> DerivedGraph></div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span> <span class="keyword">const</span> NodeIndexType</div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">StarGraphBase<NodeIndexType, ArcIndexType, DerivedGraph>::kFirstNode</a> = 0;</div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span> </div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span> <span class="comment">// The index of the first arc in the graph.</span></div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keyword">typename</span> DerivedGraph></div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span> <span class="keyword">const</span> ArcIndexType</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">StarGraphBase<NodeIndexType, ArcIndexType, DerivedGraph>::kFirstArc</a> = 0;</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="comment">// The maximum possible node index in the graph.</span></div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keyword">typename</span> DerivedGraph></div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span> <span class="keyword">const</span> NodeIndexType</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#aad916b80da8f95078f693e604c8985ac">StarGraphBase<NodeIndexType, ArcIndexType, DerivedGraph>::kMaxNumNodes</a> =</div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  std::numeric_limits<NodeIndexType>::max();</div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span> </div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span> <span class="comment">// The maximum possible number of arcs in the graph.</span></div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span> <span class="comment">// (The maximum index is kMaxNumArcs-1, since indices start at 0.)</span></div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keyword">typename</span> DerivedGraph></div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span> <span class="keyword">const</span> ArcIndexType</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a5d6f4ad584d8fae3c29633c75138b177">StarGraphBase<NodeIndexType, ArcIndexType, DerivedGraph>::kMaxNumArcs</a> =</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  std::numeric_limits<ArcIndexType>::max();</div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span> </div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span> <span class="comment">// A template for the base class that holds the functionality that exists in</span></div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span> <span class="comment">// common between the EbertGraph<> template and the ForwardEbertGraph<></span></div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span> <span class="comment">// template.</span></div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span> <span class="comment">//</span></div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span> <span class="comment">// This template is for internal use only, and this is enforced by making all</span></div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span> <span class="comment">// constructors for this class template protected. Clients should use one of the</span></div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span> <span class="comment">// two derived-class templates. Most clients will not even use those directly,</span></div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span> <span class="comment">// but will use the StarGraph and ForwardStarGraph typenames declared above.</span></div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span> <span class="comment">//</span></div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span> <span class="comment">// The DerivedGraph template argument must be the type of the class (typically</span></div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span> <span class="comment">// itself built from a template) that:</span></div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span> <span class="comment">// 1. implements the full interface expected for either ForwardEbertGraph or</span></div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span> <span class="comment">// EbertGraph, and</span></div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span> <span class="comment">// 2. inherits from an instance of this template.</span></div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span> <span class="comment">// The base class needs access to some members of the derived class such as, for</span></div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span> <span class="comment">// example, NextOutgoingArc(), and it gets this access via the DerivedGraph</span></div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span> <span class="comment">// template argument.</span></div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType, <span class="keyword">typename</span> DerivedGraph></div><div class="line"><a name="l00948"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html"> 948</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1EbertGraphBase.html">EbertGraphBase</a></div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html">StarGraphBase</a><NodeIndexType, ArcIndexType, DerivedGraph> {</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  <span class="keyword">typedef</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html">StarGraphBase<NodeIndexType, ArcIndexType, DerivedGraph></a> <a class="code" href="classoperations__research_1_1StarGraphBase.html">Base</a>;</div><div class="line"><a name="l00951"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a89aa87fdbc5337e9edcd79499d24fc1d"> 951</a></span>  <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1StarGraphBase.html">StarGraphBase</a><NodeIndexType, ArcIndexType, DerivedGraph>;</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span> </div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">Base::first_incident_arc_</a>;</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">Base::head_</a>;</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">Base::max_num_arcs_</a>;</div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#ab059bfdc4854ebf3ffa22cc778a436c3">Base::max_num_nodes_</a>;</div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">Base::num_arcs_</a>;</div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">Base::num_nodes_</a>;</div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span> </div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span> <span class="preprocessor">#if !SWIG</span></div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a8b9175b7d6fd63f5ae764a7ea44d13e0">Base::end_arc_index</a>;</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a2b88b717e42d7137a884c36e35052191">Base::IsNodeValid</a>;</div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span> </div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">Base::kFirstArc</a>;</div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">Base::kFirstNode</a>;</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a5d6f4ad584d8fae3c29633c75138b177">Base::kMaxNumArcs</a>;</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#aad916b80da8f95078f693e604c8985ac">Base::kMaxNumNodes</a>;</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">Base::kNilArc</a>;</div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">Base::kNilNode</a>;</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span> <span class="preprocessor">#endif // SWIG</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">// Reserves memory needed for max_num_nodes nodes and max_num_arcs arcs.</span></div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  <span class="comment">// Returns false if the parameters passed are not OK.</span></div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <span class="comment">// It can be used to enlarge the graph, but does not shrink memory</span></div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  <span class="comment">// if called with smaller values.</span></div><div class="line"><a name="l00978"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a63560dd4eca6ee672701a59d42c67cbd"> 978</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a63560dd4eca6ee672701a59d42c67cbd">Reserve</a>(NodeIndexType new_max_num_nodes, ArcIndexType new_max_num_arcs) {</div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  <span class="keywordflow">if</span> (new_max_num_nodes < 0 || new_max_num_nodes > <a class="code" href="classoperations__research_1_1StarGraphBase.html#aad916b80da8f95078f693e604c8985ac">kMaxNumNodes</a>) {</div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  }</div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  <span class="keywordflow">if</span> (new_max_num_arcs < 0 || new_max_num_arcs > <a class="code" href="classoperations__research_1_1StarGraphBase.html#a5d6f4ad584d8fae3c29633c75138b177">kMaxNumArcs</a>) {</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>.Reserve(<a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a>, new_max_num_nodes - 1);</div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="keywordflow">for</span> (NodeIndexType node = <a class="code" href="classoperations__research_1_1StarGraphBase.html#ab059bfdc4854ebf3ffa22cc778a436c3">max_num_nodes_</a>;</div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  node <= <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>.max_index(); ++node) {</div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>.Set(node, <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>);</div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  }</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  ThisAsDerived()->ReserveInternal(new_max_num_nodes, new_max_num_arcs);</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#ab059bfdc4854ebf3ffa22cc778a436c3">max_num_nodes_</a> = new_max_num_nodes;</div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a> = new_max_num_arcs;</div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  }</div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span> </div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  <span class="comment">// Adds an arc to the graph and returns its index.</span></div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <span class="comment">// Returns kNilArc if the arc could not be added.</span></div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <span class="comment">// Note that for a given pair (tail, head) AddArc does not overwrite an</span></div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <span class="comment">// already-existing arc between tail and head: Another arc is created</span></div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  <span class="comment">// instead. This makes it possible to handle multi-graphs.</span></div><div class="line"><a name="l01001"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a7b505ba4a01bce342d049f5a8674da72"> 1001</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a7b505ba4a01bce342d049f5a8674da72">AddArc</a>(NodeIndexType tail, NodeIndexType head) {</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">num_arcs_</a> >= <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a> || !<a class="code" href="classoperations__research_1_1StarGraphBase.html#a2b88b717e42d7137a884c36e35052191">IsNodeValid</a>(tail) ||</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  !<a class="code" href="classoperations__research_1_1StarGraphBase.html#a2b88b717e42d7137a884c36e35052191">IsNodeValid</a>(head)) {</div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>;</div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  }</div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  <span class="keywordflow">if</span> (tail + 1 > <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a>) {</div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a> = tail + 1; <span class="comment">// max does not work on int16.</span></div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  }</div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  <span class="keywordflow">if</span> (head + 1 > <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a>) {</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a> = head + 1;</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>  ArcIndexType arc = <a class="code" href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">num_arcs_</a>;</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  ++<a class="code" href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">num_arcs_</a>;</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  ThisAsDerived()->RecordArc(arc, tail, head);</div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  <span class="keywordflow">return</span> arc;</div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  }</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span> </div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span> <span class="comment">// TODO(user): Configure SWIG to handle the GroupForwardArcsByFunctor</span></div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span> <span class="comment">// member template and the CycleHandlerForAnnotatedArcs class.</span></div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span> <span class="preprocessor">#if !SWIG</span></div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> ArcIndexTypeStrictWeakOrderingFunctor></div><div class="line"><a name="l01022"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#aa90da96a03365b61ef1bbb6167b49837"> 1022</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#aa90da96a03365b61ef1bbb6167b49837">GroupForwardArcsByFunctor</a>(</div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  <span class="keyword">const</span> ArcIndexTypeStrictWeakOrderingFunctor& compare,</div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  PermutationCycleHandler<ArcIndexType>* annotation_handler) {</div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  std::unique_ptr<ArcIndexType[]> arc_permutation(</div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  <span class="keyword">new</span> ArcIndexType[<a class="code" href="classoperations__research_1_1StarGraphBase.html#a8b9175b7d6fd63f5ae764a7ea44d13e0">end_arc_index</a>()]);</div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span> </div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="comment">// Determine the permutation that groups arcs by their tail nodes.</span></div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="keywordflow">for</span> (ArcIndexType i = 0; i < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a8b9175b7d6fd63f5ae764a7ea44d13e0">end_arc_index</a>(); ++i) {</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  <span class="comment">// Start with the identity permutation.</span></div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  arc_permutation[i] = i;</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>  std::sort(&arc_permutation[<a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>], &arc_permutation[<a class="code" href="classoperations__research_1_1StarGraphBase.html#a8b9175b7d6fd63f5ae764a7ea44d13e0">end_arc_index</a>()],</div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  compare);</div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span> </div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  <span class="comment">// Now we actually permute the head_ array and the</span></div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <span class="comment">// scaled_arc_cost_ array according to the sorting permutation.</span></div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  CycleHandlerForAnnotatedArcs cycle_handler(annotation_handler,</div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  ThisAsDerived());</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  PermutationApplier<ArcIndexType> permutation(&cycle_handler);</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  permutation.Apply(&arc_permutation[0], <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>, <a class="code" href="classoperations__research_1_1StarGraphBase.html#a8b9175b7d6fd63f5ae764a7ea44d13e0">end_arc_index</a>());</div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span> </div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  <span class="comment">// Finally, rebuild the graph from its permuted head_ array.</span></div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  ThisAsDerived()->BuildRepresentation();</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  }</div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span> </div><div class="line"><a name="l01047"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html"> 1047</a></span>  <span class="keyword">class </span><a class="code" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html">CycleHandlerForAnnotatedArcs</a></div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  : <span class="keyword">public</span> PermutationCycleHandler<ArcIndexType> {</div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01050"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#a98dbfe5b691e0943198565a525d17886"> 1050</a></span>  <a class="code" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#a98dbfe5b691e0943198565a525d17886">CycleHandlerForAnnotatedArcs</a>(</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  PermutationCycleHandler<ArcIndexType>* annotation_handler,</div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  DerivedGraph* graph)</div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  : annotation_handler_(annotation_handler),</div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  graph_(graph),</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  head_temp_(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">kNilNode</a>),</div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  tail_temp_(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">kNilNode</a>) {}</div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span> </div><div class="line"><a name="l01058"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#a999f9e59b55e3f184efa317522f2eeb0"> 1058</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#a999f9e59b55e3f184efa317522f2eeb0">SetTempFromIndex</a>(ArcIndexType source)<span class="keyword"> override </span>{</div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  <span class="keywordflow">if</span> (annotation_handler_ != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  annotation_handler_->SetTempFromIndex(source);</div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  }</div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  head_temp_ = graph_->Head(source);</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  tail_temp_ = graph_->Tail(source);</div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  }</div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span> </div><div class="line"><a name="l01066"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#a2fd5ecc6414d07e3456e96c0d665ae9b"> 1066</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#a2fd5ecc6414d07e3456e96c0d665ae9b">SetIndexFromIndex</a>(ArcIndexType source,</div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  ArcIndexType destination)<span class="keyword"> const override </span>{</div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  <span class="keywordflow">if</span> (annotation_handler_ != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  annotation_handler_->SetIndexFromIndex(source, destination);</div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  }</div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  graph_->SetHead(destination, graph_->Head(source));</div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  graph_->SetTail(destination, graph_->Tail(source));</div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  }</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span> </div><div class="line"><a name="l01075"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#ab8c76fdd7493de9946f7551ed3ca16bc"> 1075</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#ab8c76fdd7493de9946f7551ed3ca16bc">SetIndexFromTemp</a>(ArcIndexType destination)<span class="keyword"> const override </span>{</div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="keywordflow">if</span> (annotation_handler_ != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  annotation_handler_->SetIndexFromTemp(destination);</div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  }</div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  graph_->SetHead(destination, head_temp_);</div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  graph_->SetTail(destination, tail_temp_);</div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  }</div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span> </div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  <span class="comment">// Since we are free to destroy the permutation array we use the</span></div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  <span class="comment">// kNilArc value to mark entries in the array that have been</span></div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  <span class="comment">// processed already. There is no need to be able to recover the</span></div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  <span class="comment">// original permutation array entries once they have been seen.</span></div><div class="line"><a name="l01087"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#af0a6d99cf6168e896bd3ed5808c6a64f"> 1087</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#af0a6d99cf6168e896bd3ed5808c6a64f">SetSeen</a>(ArcIndexType* permutation_element)<span class="keyword"> const override </span>{</div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  *permutation_element = <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>;</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> </div><div class="line"><a name="l01091"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#a620585eea46339771ef3f9eae9aef25a"> 1091</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#a620585eea46339771ef3f9eae9aef25a">Unseen</a>(ArcIndexType permutation_element)<span class="keyword"> const override </span>{</div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  <span class="keywordflow">return</span> permutation_element != <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>;</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> </div><div class="line"><a name="l01095"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#a2bc2fad88b93b8470cb35a662772f6da"> 1095</a></span>  <a class="code" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#a2bc2fad88b93b8470cb35a662772f6da">~CycleHandlerForAnnotatedArcs</a>()<span class="keyword"> override </span>{}</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span> </div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  PermutationCycleHandler<ArcIndexType>* annotation_handler_;</div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  DerivedGraph* graph_;</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  NodeIndexType head_temp_;</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  NodeIndexType tail_temp_;</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>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html">CycleHandlerForAnnotatedArcs</a>);</div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  };</div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span> <span class="preprocessor">#endif // SWIG</span></div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span> </div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l01108"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a04c9ae002dae9ce9a47d37156a6d0c88"> 1108</a></span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a04c9ae002dae9ce9a47d37156a6d0c88">EbertGraphBase</a>() : <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">next_adjacent_arc_</a>(), <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503">representation_clean_</a>(true) {}</div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span> </div><div class="line"><a name="l01110"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a29986e86c1ff5503dd5f162787ae2958"> 1110</a></span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a29986e86c1ff5503dd5f162787ae2958">~EbertGraphBase</a>() {}</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span> </div><div class="line"><a name="l01112"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a91ea251fe7caa0122a01f738892dd03b"> 1112</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a91ea251fe7caa0122a01f738892dd03b">Initialize</a>(NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a29774a2f068745000e90eaf549543144">max_num_nodes</a>, ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6dea64dce5de0432befc47f85176ab19">max_num_arcs</a>) {</div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a63560dd4eca6ee672701a59d42c67cbd">Reserve</a>(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a29774a2f068745000e90eaf549543144">max_num_nodes</a>, <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6dea64dce5de0432befc47f85176ab19">max_num_arcs</a>)) {</div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  LOG(DFATAL) << <span class="stringliteral">"Could not reserve memory for "</span></div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  << static_cast<int64>(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a29774a2f068745000e90eaf549543144">max_num_nodes</a>) << <span class="stringliteral">" nodes and "</span></div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  << static_cast<int64>(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a6dea64dce5de0432befc47f85176ab19">max_num_arcs</a>) << <span class="stringliteral">" arcs."</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>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>.SetAll(<a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>);</div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  ThisAsDerived()->InitializeInternal(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a29774a2f068745000e90eaf549543144">max_num_nodes</a>, <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6dea64dce5de0432befc47f85176ab19">max_num_arcs</a>);</div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  }</div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span> </div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  <span class="comment">// Returns the first arc in node's incidence list.</span></div><div class="line"><a name="l01123"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#aa7eb01c1d6e53fc3eb906761eb69734a"> 1123</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1EbertGraphBase.html#aa7eb01c1d6e53fc3eb906761eb69734a">FirstOutgoingOrOppositeIncomingArc</a>(</div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  <span class="keyword">const</span> NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503">representation_clean_</a>);</div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  DCHECK(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a2b88b717e42d7137a884c36e35052191">IsNodeValid</a>(node));</div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[node];</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  }</div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span> </div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  <span class="comment">// Returns the next arc following the passed argument in its adjacency list.</span></div><div class="line"><a name="l01131"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#ae4bf065dd416af2bc622a829172e43a9"> 1131</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1EbertGraphBase.html#ae4bf065dd416af2bc622a829172e43a9">NextAdjacentArc</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503">representation_clean_</a>);</div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  DCHECK(ThisAsDerived()->CheckArcValidity(arc));</div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">next_adjacent_arc_</a>[arc];</div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  }</div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span> </div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <span class="comment">// Returns the outgoing arc following the argument in the adjacency list.</span></div><div class="line"><a name="l01138"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a4e27d3270223638ed3a6b9448a71475b"> 1138</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a4e27d3270223638ed3a6b9448a71475b">NextOutgoingArc</a>(<span class="keyword">const</span> NodeIndexType unused_node,</div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  <span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  DCHECK(ThisAsDerived()->CheckArcValidity(arc));</div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  DCHECK(ThisAsDerived()->IsDirect(arc));</div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  <span class="keywordflow">return</span> ThisAsDerived()->FindNextOutgoingArc(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#ae4bf065dd416af2bc622a829172e43a9">NextAdjacentArc</a>(arc));</div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  }</div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span> </div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  <span class="comment">// Array of next indices.</span></div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  <span class="comment">// next_adjacent_arc_[i] contains the next arc in the adjacency list of arc i.</span></div><div class="line"><a name="l01147"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf"> 1147</a></span>  ZVector<ArcIndexType> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">next_adjacent_arc_</a>;</div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span> </div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  <span class="comment">// Flag to indicate that BuildRepresentation() needs to be called</span></div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <span class="comment">// before the adjacency lists are examined. Only for DCHECK in debug</span></div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  <span class="comment">// builds.</span></div><div class="line"><a name="l01152"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503"> 1152</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503">representation_clean_</a>;</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>  <span class="keyword">private</span>:</div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  <span class="comment">// Shorthand: returns a const DerivedGraph*-typed version of our</span></div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  <span class="comment">// "this" pointer.</span></div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  <span class="keyword">inline</span> <span class="keyword">const</span> DerivedGraph* ThisAsDerived()<span class="keyword"> const </span>{</div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  <span class="keywordflow">return</span> static_cast<const DerivedGraph*>(<span class="keyword">this</span>);</div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  }</div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span> </div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  <span class="comment">// Shorthand: returns a DerivedGraph*-typed version of our "this"</span></div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  <span class="comment">// pointer.</span></div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  <span class="keyword">inline</span> DerivedGraph* ThisAsDerived() {</div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  <span class="keywordflow">return</span> static_cast<DerivedGraph*>(<span class="keyword">this</span>);</div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  }</div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span> </div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  <span class="keywordtype">void</span> InitializeInternal(NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a29774a2f068745000e90eaf549543144">max_num_nodes</a>,</div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6dea64dce5de0432befc47f85176ab19">max_num_arcs</a>) {</div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">next_adjacent_arc_</a>.SetAll(<a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>);</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="keywordtype">bool</span> RepresentationClean()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503">representation_clean_</a>; }</div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span> </div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  <span class="comment">// Using the SetHead() method implies that the BuildRepresentation()</span></div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <span class="comment">// method must be called to restore consistency before the graph is</span></div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <span class="comment">// used.</span></div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  <span class="keywordtype">void</span> SetHead(<span class="keyword">const</span> ArcIndexType arc, <span class="keyword">const</span> NodeIndexType head) {</div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503">representation_clean_</a> = <span class="keyword">false</span>;</div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>.Set(arc, head);</div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  }</div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span> };</div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span> </div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span> <span class="comment">// Most users should only use StarGraph, which is EbertGraph<int32, int32>, and</span></div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span> <span class="comment">// other type shortcuts; see the bottom of this file.</span></div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span> <span class="keyword">class </span>EbertGraph</div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  : <span class="keyword">public</span> EbertGraphBase<NodeIndexType, ArcIndexType,</div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  EbertGraph<NodeIndexType, ArcIndexType> > {</div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="keyword">typedef</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a04c9ae002dae9ce9a47d37156a6d0c88">EbertGraphBase</a><NodeIndexType, ArcIndexType,</div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  EbertGraph<NodeIndexType, ArcIndexType> ></div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  Base;</div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1EbertGraphBase.html#a04c9ae002dae9ce9a47d37156a6d0c88">EbertGraphBase</a><NodeIndexType, ArcIndexType,</div><div class="line"><a name="l01193"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#a73dbd9f38775b3bd2727594c935502c3"> 1193</a></span>  <a class="code" href="classoperations__research_1_1EbertGraph.html">EbertGraph</a><NodeIndexType, ArcIndexType> >;</div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1StarGraphBase.html">StarGraphBase</a><NodeIndexType, ArcIndexType,</div><div class="line"><a name="l01195"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#a8b785fb3f60a942b9d82c48073f2d03b"> 1195</a></span>  <a class="code" href="classoperations__research_1_1EbertGraph.html">EbertGraph</a><NodeIndexType, ArcIndexType> >;</div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span> </div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58d0c72004cf773e707cb9d43dafc308">Base::ArcDebugString</a>;</div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#aa7eb01c1d6e53fc3eb906761eb69734a">Base::FirstOutgoingOrOppositeIncomingArc</a>;</div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a91ea251fe7caa0122a01f738892dd03b">Base::Initialize</a>;</div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#ae4bf065dd416af2bc622a829172e43a9">Base::NextAdjacentArc</a>;</div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a74cc112e18e1496d720c48f6082d2671">Base::NodeDebugString</a>;</div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span> </div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a58b521f62562f51a79f9c95f1902804a">Base::first_incident_arc_</a>;</div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">Base::head_</a>;</div><div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">Base::max_num_arcs_</a>;</div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#ab059bfdc4854ebf3ffa22cc778a436c3">Base::max_num_nodes_</a>;</div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">Base::next_adjacent_arc_</a>;</div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">Base::num_arcs_</a>;</div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">Base::num_nodes_</a>;</div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503">Base::representation_clean_</a>;</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>  <span class="keyword">public</span>:</div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span> <span class="preprocessor">#if !SWIG</span></div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a5237cfbb86ec8f305e498e873e5c4e95">Base::Head</a>;</div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a2b88b717e42d7137a884c36e35052191">Base::IsNodeValid</a>;</div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span> </div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">Base::kFirstArc</a>;</div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">Base::kFirstNode</a>;</div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">Base::kNilArc</a>;</div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">Base::kNilNode</a>;</div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span> <span class="preprocessor">#endif // SWIG</span></div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span> </div><div class="line"><a name="l01223"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#aec05ff3d270a5f888e1623c2a99ff2aa"> 1223</a></span>  <span class="keyword">typedef</span> NodeIndexType <a class="code" href="classoperations__research_1_1EbertGraph.html#aec05ff3d270a5f888e1623c2a99ff2aa">NodeIndex</a>;</div><div class="line"><a name="l01224"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#a92531459eff09455cfa63976f5024906"> 1224</a></span>  <span class="keyword">typedef</span> ArcIndexType <a class="code" href="classoperations__research_1_1EbertGraph.html#a92531459eff09455cfa63976f5024906">ArcIndex</a>;</div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span> </div><div class="line"><a name="l01226"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#a64a62fbecf28877dbeb8b077378b8932"> 1226</a></span>  <a class="code" href="classoperations__research_1_1EbertGraph.html#a64a62fbecf28877dbeb8b077378b8932">EbertGraph</a>() {}</div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span> </div><div class="line"><a name="l01228"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#aaf8c9d2900d5470a2b2fd229b6314f1e"> 1228</a></span>  <a class="code" href="classoperations__research_1_1EbertGraph.html#aaf8c9d2900d5470a2b2fd229b6314f1e">EbertGraph</a>(NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a29774a2f068745000e90eaf549543144">max_num_nodes</a>, ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6dea64dce5de0432befc47f85176ab19">max_num_arcs</a>) {</div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a91ea251fe7caa0122a01f738892dd03b">Initialize</a>(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a29774a2f068745000e90eaf549543144">max_num_nodes</a>, <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6dea64dce5de0432befc47f85176ab19">max_num_arcs</a>);</div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  }</div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span> </div><div class="line"><a name="l01232"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#a261f8641bf78570222a84ad4c10d8b81"> 1232</a></span>  <a class="code" href="classoperations__research_1_1EbertGraph.html#a261f8641bf78570222a84ad4c10d8b81">~EbertGraph</a>() {}</div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span> </div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span> <span class="preprocessor">#if !SWIG</span></div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  <span class="comment">// Iterator class for traversing the arcs incident to a given node in the</span></div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  <span class="comment">// graph.</span></div><div class="line"><a name="l01237"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html"> 1237</a></span>  <span class="keyword">class </span><a class="code" href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html">OutgoingOrOppositeIncomingArcIterator</a> {</div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01239"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#ab0fa4991e548ecbe6666e461ac898b32"> 1239</a></span>  <a class="code" href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#ab0fa4991e548ecbe6666e461ac898b32">OutgoingOrOppositeIncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1EbertGraph.html">EbertGraph</a>& graph,</div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  NodeIndexType node)</div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  : graph_(graph),</div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  node_(graph_.<a class="code" href="classoperations__research_1_1StarGraphBase.html#abfdc255fd93491a9a8ac563a412f57e3">StartNode</a>(node)),</div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  arc_(graph_.<a class="code" href="classoperations__research_1_1StarGraphBase.html#afc2f0055a1b672fbd6102d0d9a3b8c28">StartArc</a>(</div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  graph_.<a class="code" href="classoperations__research_1_1EbertGraphBase.html#aa7eb01c1d6e53fc3eb906761eb69734a">FirstOutgoingOrOppositeIncomingArc</a>(node))) {</div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  DCHECK(CheckInvariant());</div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  }</div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span> </div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  <span class="comment">// This constructor takes an arc as extra argument and makes the iterator</span></div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  <span class="comment">// start at arc.</span></div><div class="line"><a name="l01250"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#a529227be5b4b47f773ceedf31a791fd5"> 1250</a></span>  <a class="code" href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#a529227be5b4b47f773ceedf31a791fd5">OutgoingOrOppositeIncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1EbertGraph.html">EbertGraph</a>& graph,</div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  NodeIndexType node, ArcIndexType arc)</div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  : graph_(graph),</div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  node_(graph_.<a class="code" href="classoperations__research_1_1StarGraphBase.html#abfdc255fd93491a9a8ac563a412f57e3">StartNode</a>(node)),</div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  arc_(graph_.<a class="code" href="classoperations__research_1_1StarGraphBase.html#afc2f0055a1b672fbd6102d0d9a3b8c28">StartArc</a>(arc)) {</div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  DCHECK(CheckInvariant());</div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  }</div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span> </div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  <span class="comment">// Can only assign from an iterator on the same graph.</span></div><div class="line"><a name="l01259"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#af251b7da74772dec7390bcc35f5e57f9"> 1259</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#af251b7da74772dec7390bcc35f5e57f9">operator=</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html">OutgoingOrOppositeIncomingArcIterator</a>& iterator) {</div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  DCHECK(&iterator.graph_ == &graph_);</div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  node_ = iterator.node_;</div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  arc_ = iterator.arc_;</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> </div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  <span class="comment">// Returns true unless all the adjancent arcs have been traversed.</span></div><div class="line"><a name="l01266"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347"> 1266</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347">Ok</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> arc_ != <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>; }</div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span> </div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  <span class="comment">// Advances the current adjacent arc index.</span></div><div class="line"><a name="l01269"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#a659a293dd51073a1b9560bb80f687705"> 1269</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#a659a293dd51073a1b9560bb80f687705">Next</a>() {</div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  arc_ = graph_.<a class="code" href="classoperations__research_1_1EbertGraphBase.html#ae4bf065dd416af2bc622a829172e43a9">NextAdjacentArc</a>(arc_);</div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  DCHECK(CheckInvariant());</div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  }</div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span> </div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  <span class="comment">// Returns the index of the arc currently pointed to by the iterator.</span></div><div class="line"><a name="l01275"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#adac23a27a3389aea80f75741569afe35"> 1275</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#adac23a27a3389aea80f75741569afe35">Index</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> arc_; }</div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span> </div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  <span class="comment">// Returns true if the invariant for the iterator is verified.</span></div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  <span class="comment">// To be used in a DCHECK.</span></div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  <span class="keywordtype">bool</span> CheckInvariant()<span class="keyword"> const </span>{</div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  <span class="keywordflow">if</span> (arc_ == <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>) {</div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>; <span class="comment">// This occurs when the iterator has reached the end.</span></div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  }</div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  DCHECK(graph_.<a class="code" href="classoperations__research_1_1EbertGraph.html#a0069419fba4f69240c65b8a224ff8d8a">IsOutgoingOrOppositeIncoming</a>(arc_, node_));</div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  }</div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  <span class="comment">// A reference to the current EbertGraph considered.</span></div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1EbertGraph.html#a64a62fbecf28877dbeb8b077378b8932">EbertGraph</a>& graph_;</div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span> </div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  <span class="comment">// The index of the node on which arcs are iterated.</span></div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  NodeIndexType node_;</div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span> </div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  <span class="comment">// The index of the current arc considered.</span></div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  ArcIndexType arc_;</div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  };</div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span> </div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  <span class="comment">// Iterator class for traversing the incoming arcs associated to a given node.</span></div><div class="line"><a name="l01298"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html"> 1298</a></span>  <span class="keyword">class </span><a class="code" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html">IncomingArcIterator</a> {</div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01300"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#aaa9894d557b5df8ca4d93d8701fc2f28"> 1300</a></span>  <a class="code" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#aaa9894d557b5df8ca4d93d8701fc2f28">IncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1EbertGraph.html">EbertGraph</a>& graph, NodeIndexType node)</div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  : graph_(graph),</div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  node_(graph_.<a class="code" href="classoperations__research_1_1StarGraphBase.html#abfdc255fd93491a9a8ac563a412f57e3">StartNode</a>(node)),</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  arc_(graph_.<a class="code" href="classoperations__research_1_1StarGraphBase.html#afc2f0055a1b672fbd6102d0d9a3b8c28">StartArc</a>(graph_.FirstIncomingArc(node))) {</div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  DCHECK(CheckInvariant());</div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  }</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>  <span class="comment">// This constructor takes an arc as extra argument and makes the iterator</span></div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  <span class="comment">// start at arc.</span></div><div class="line"><a name="l01309"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#a65a5e101f3d99772be31f3ab1aaed235"> 1309</a></span>  <a class="code" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#a65a5e101f3d99772be31f3ab1aaed235">IncomingArcIterator</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1EbertGraph.html">EbertGraph</a>& graph, NodeIndexType node,</div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  ArcIndexType arc)</div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  : graph_(graph),</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  node_(graph_.<a class="code" href="classoperations__research_1_1StarGraphBase.html#abfdc255fd93491a9a8ac563a412f57e3">StartNode</a>(node)),</div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  arc_(arc == <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a> ? <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a></div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  : graph_.<a class="code" href="classoperations__research_1_1StarGraphBase.html#afc2f0055a1b672fbd6102d0d9a3b8c28">StartArc</a>(graph_.<a class="code" href="classoperations__research_1_1EbertGraph.html#a5e97f7ded349bc661bf63bca4c951d6b">Opposite</a>(arc))) {</div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  DCHECK(CheckInvariant());</div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  }</div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span> </div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  <span class="comment">// Can only assign from an iterator on the same graph.</span></div><div class="line"><a name="l01319"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#a22389499759a3a1fc6747d4bd0f2a120"> 1319</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#a22389499759a3a1fc6747d4bd0f2a120">operator=</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html">IncomingArcIterator</a>& iterator) {</div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  DCHECK(&iterator.graph_ == &graph_);</div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  node_ = iterator.node_;</div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  arc_ = iterator.arc_;</div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  }</div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span> </div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  <span class="comment">// Returns true unless all the incoming arcs have been traversed.</span></div><div class="line"><a name="l01326"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347"> 1326</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347">Ok</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> arc_ != <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>; }</div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span> </div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  <span class="comment">// Advances the current incoming arc index.</span></div><div class="line"><a name="l01329"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#a659a293dd51073a1b9560bb80f687705"> 1329</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#a659a293dd51073a1b9560bb80f687705">Next</a>() {</div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  arc_ = graph_.NextIncomingArc(arc_);</div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  DCHECK(CheckInvariant());</div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  }</div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</span> </div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  <span class="comment">// Returns the index of the arc currently pointed to by the iterator.</span></div><div class="line"><a name="l01335"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#adac23a27a3389aea80f75741569afe35"> 1335</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#adac23a27a3389aea80f75741569afe35">Index</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  <span class="keywordflow">return</span> arc_ == <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a> ? <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a> : graph_.<a class="code" href="classoperations__research_1_1EbertGraph.html#a5e97f7ded349bc661bf63bca4c951d6b">Opposite</a>(arc_);</div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  }</div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span> </div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  <span class="comment">// Returns true if the invariant for the iterator is verified.</span></div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <span class="comment">// To be used in a DCHECK.</span></div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  <span class="keywordtype">bool</span> CheckInvariant()<span class="keyword"> const </span>{</div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  <span class="keywordflow">if</span> (arc_ == <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>) {</div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>; <span class="comment">// This occurs when the iterator has reached the end.</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>  DCHECK(graph_.<a class="code" href="classoperations__research_1_1EbertGraph.html#a4bdbd200e31110f301a3fed9abf15626">IsIncoming</a>(<a class="code" href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#adac23a27a3389aea80f75741569afe35">Index</a>(), node_));</div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  }</div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  <span class="comment">// A reference to the current EbertGraph considered.</span></div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1EbertGraph.html#a64a62fbecf28877dbeb8b077378b8932">EbertGraph</a>& graph_;</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>  <span class="comment">// The index of the node on which arcs are iterated.</span></div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  NodeIndexType node_;</div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span> </div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  <span class="comment">// The index of the current arc considered.</span></div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  ArcIndexType arc_;</div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  };</div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span> <span class="preprocessor">#endif // SWIG</span></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>  <span class="comment">// Utility function to check that an arc index is within the bounds.</span></div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  <span class="comment">// It is exported so that users of the EbertGraph class can use it.</span></div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  <span class="comment">// To be used in a DCHECK.</span></div><div class="line"><a name="l01363"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb"> 1363</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1EbertGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">CheckArcBounds</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  <span class="keywordflow">return</span> (arc == <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>) || (arc >= -<a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a> && arc < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a>);</div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  }</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>  <span class="comment">// Utility function to check that an arc index is within the bounds AND</span></div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  <span class="comment">// different from kNilArc.</span></div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  <span class="comment">// It is exported so that users of the EbertGraph class can use it.</span></div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  <span class="comment">// To be used in a DCHECK.</span></div><div class="line"><a name="l01371"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#a553e5eeb2887a1d7663e1200b7466e6c"> 1371</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1EbertGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">CheckArcValidity</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  <span class="keywordflow">return</span> (arc != <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>) && (arc >= -<a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a> && arc < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a>);</div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  }</div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span> </div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  <span class="comment">// Returns the tail or start-node of arc.</span></div><div class="line"><a name="l01376"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#aae684b1eb132c8c201f437d88e367b55"> 1376</a></span>  NodeIndexType <a class="code" href="classoperations__research_1_1EbertGraph.html#aae684b1eb132c8c201f437d88e367b55">Tail</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">CheckArcValidity</a>(arc));</div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>[<a class="code" href="classoperations__research_1_1EbertGraph.html#a5e97f7ded349bc661bf63bca4c951d6b">Opposite</a>(arc)];</div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  }</div><div class="line"><a name="l01380"></a><span class="lineno"> 1380</span> </div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  <span class="comment">// Returns the tail or start-node of arc if it is positive</span></div><div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  <span class="comment">// (i.e. it is taken in the direction it was entered in the graph),</span></div><div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  <span class="comment">// and the head or end-node otherwise. 'This' in Ebert's paper.</span></div><div class="line"><a name="l01384"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#af1dc9501f2032d9e6b42c49714ad2f67"> 1384</a></span>  NodeIndexType <a class="code" href="classoperations__research_1_1EbertGraph.html#af1dc9501f2032d9e6b42c49714ad2f67">DirectArcTail</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1EbertGraph.html#aae684b1eb132c8c201f437d88e367b55">Tail</a>(<a class="code" href="classoperations__research_1_1EbertGraph.html#aa55bab68a7d29e6fdaf4bb82b16374ba">DirectArc</a>(arc));</div><div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  }</div><div class="line"><a name="l01387"></a><span class="lineno"> 1387</span> </div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  <span class="comment">// Returns the head or end-node of arc if it is positive</span></div><div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  <span class="comment">// (i.e. it is taken in the direction it was entered in the graph),</span></div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  <span class="comment">// and the tail or start-node otherwise. 'That' in Ebert's paper.</span></div><div class="line"><a name="l01391"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#a52c9ef13a9e62da957113d8cc7faa555"> 1391</a></span>  NodeIndexType <a class="code" href="classoperations__research_1_1EbertGraph.html#a52c9ef13a9e62da957113d8cc7faa555">DirectArcHead</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a5237cfbb86ec8f305e498e873e5c4e95">Head</a>(<a class="code" href="classoperations__research_1_1EbertGraph.html#aa55bab68a7d29e6fdaf4bb82b16374ba">DirectArc</a>(arc));</div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  }</div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span> </div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  <span class="comment">// Returns the arc in normal/direct direction.</span></div><div class="line"><a name="l01396"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#aa55bab68a7d29e6fdaf4bb82b16374ba"> 1396</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1EbertGraph.html#aa55bab68a7d29e6fdaf4bb82b16374ba">DirectArc</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">CheckArcValidity</a>(arc));</div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  <span class="keywordflow">return</span> std::max(arc, <a class="code" href="classoperations__research_1_1EbertGraph.html#a5e97f7ded349bc661bf63bca4c951d6b">Opposite</a>(arc));</div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  }</div><div class="line"><a name="l01400"></a><span class="lineno"> 1400</span> </div><div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  <span class="comment">// Returns the arc in reverse direction.</span></div><div class="line"><a name="l01402"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#a7f3e3ed5cf6c2c8668068a997dd7c95e"> 1402</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1EbertGraph.html#a7f3e3ed5cf6c2c8668068a997dd7c95e">ReverseArc</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">CheckArcValidity</a>(arc));</div><div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>  <span class="keywordflow">return</span> std::min(arc, <a class="code" href="classoperations__research_1_1EbertGraph.html#a5e97f7ded349bc661bf63bca4c951d6b">Opposite</a>(arc));</div><div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  }</div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span> </div><div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  <span class="comment">// Returns the opposite arc, i.e the direct arc is the arc is in reverse</span></div><div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  <span class="comment">// direction, and the reverse arc if the arc is direct.</span></div><div class="line"><a name="l01409"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#a5e97f7ded349bc661bf63bca4c951d6b"> 1409</a></span>  ArcIndexType <a class="code" href="classoperations__research_1_1EbertGraph.html#a5e97f7ded349bc661bf63bca4c951d6b">Opposite</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  <span class="keyword">const</span> ArcIndexType opposite = ~arc;</div><div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">CheckArcValidity</a>(arc));</div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">CheckArcValidity</a>(opposite));</div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  <span class="keywordflow">return</span> opposite;</div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  }</div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span> </div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  <span class="comment">// Returns true if the arc is direct.</span></div><div class="line"><a name="l01417"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#a05ceae7fb550b3f3728c9c56ed4729d6"> 1417</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1EbertGraph.html#a05ceae7fb550b3f3728c9c56ed4729d6">IsDirect</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">CheckArcBounds</a>(arc));</div><div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  <span class="keywordflow">return</span> arc != <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a> && arc >= 0;</div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  }</div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span> </div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  <span class="comment">// Returns true if the arc is in the reverse direction.</span></div><div class="line"><a name="l01423"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#a782ee113d75db4336845c90858a110ce"> 1423</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1EbertGraph.html#a782ee113d75db4336845c90858a110ce">IsReverse</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">CheckArcBounds</a>(arc));</div><div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  <span class="keywordflow">return</span> arc != <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a> && arc < 0;</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> </div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  <span class="comment">// Returns true if arc is incident to node.</span></div><div class="line"><a name="l01429"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#a0069419fba4f69240c65b8a224ff8d8a"> 1429</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1EbertGraph.html#a0069419fba4f69240c65b8a224ff8d8a">IsOutgoingOrOppositeIncoming</a>(ArcIndexType arc,</div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1EbertGraph.html#aae684b1eb132c8c201f437d88e367b55">Tail</a>(arc) == node;</div><div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  }</div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span> </div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  <span class="comment">// Returns true if arc is incoming to node.</span></div><div class="line"><a name="l01435"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#a4bdbd200e31110f301a3fed9abf15626"> 1435</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1EbertGraph.html#a4bdbd200e31110f301a3fed9abf15626">IsIncoming</a>(ArcIndexType arc, NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1EbertGraph.html#a05ceae7fb550b3f3728c9c56ed4729d6">IsDirect</a>(arc) && <a class="code" href="classoperations__research_1_1StarGraphBase.html#a5237cfbb86ec8f305e498e873e5c4e95">Head</a>(arc) == node;</div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  }</div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span> </div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  <span class="comment">// Returns true if arc is outgoing from node.</span></div><div class="line"><a name="l01440"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#a707eda1519f71617e80ebacaab4d4e25"> 1440</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1EbertGraph.html#a707eda1519f71617e80ebacaab4d4e25">IsOutgoing</a>(ArcIndexType arc, NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1EbertGraph.html#a05ceae7fb550b3f3728c9c56ed4729d6">IsDirect</a>(arc) && <a class="code" href="classoperations__research_1_1EbertGraph.html#aae684b1eb132c8c201f437d88e367b55">Tail</a>(arc) == node;</div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  }</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>  <span class="comment">// Recreates the next_adjacent_arc_ and first_incident_arc_ variables from</span></div><div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  <span class="comment">// the array head_ in O(n + m) time.</span></div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  <span class="comment">// This is useful if head_ array has been sorted according to a given</span></div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  <span class="comment">// criterion, for example.</span></div><div class="line"><a name="l01448"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#a3fe1b105925a29cd63741e6dc85cfe45"> 1448</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1EbertGraph.html#a3fe1b105925a29cd63741e6dc85cfe45">BuildRepresentation</a>() {</div><div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>.SetAll(<a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>);</div><div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  <span class="keywordflow">for</span> (ArcIndexType arc = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>; arc < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a>; ++arc) {</div><div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  Attach(arc);</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>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503">representation_clean_</a> = <span class="keyword">true</span>;</div><div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  }</div><div class="line"><a name="l01455"></a><span class="lineno"> 1455</span> </div><div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  <span class="comment">// Returns a debug std::string containing all the information contained in the</span></div><div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  <span class="comment">// data structure in raw form.</span></div><div class="line"><a name="l01458"></a><span class="lineno"><a class="line" href="classoperations__research_1_1EbertGraph.html#a764be64f3029f8b8e23511061d8de355"> 1458</a></span>  std::string <a class="code" href="classoperations__research_1_1EbertGraph.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503">representation_clean_</a>);</div><div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  std::string result = <span class="stringliteral">"Arcs:(node, next arc) :\n"</span>;</div><div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  <span class="keywordflow">for</span> (ArcIndexType arc = -<a class="code" href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">num_arcs_</a>; arc < <a class="code" href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">num_arcs_</a>; ++arc) {</div><div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  result += <span class="stringliteral">" "</span> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58d0c72004cf773e707cb9d43dafc308">ArcDebugString</a>(arc) + <span class="stringliteral">":("</span> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a74cc112e18e1496d720c48f6082d2671">NodeDebugString</a>(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>[arc]) +</div><div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  <span class="stringliteral">","</span> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58d0c72004cf773e707cb9d43dafc308">ArcDebugString</a>(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">next_adjacent_arc_</a>[arc]) + <span class="stringliteral">")\n"</span>;</div><div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  }</div><div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  result += <span class="stringliteral">"Node:First arc :\n"</span>;</div><div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  <span class="keywordflow">for</span> (NodeIndexType node = <a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a>; node < <a class="code" href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a>; ++node) {</div><div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  result += <span class="stringliteral">" "</span> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a74cc112e18e1496d720c48f6082d2671">NodeDebugString</a>(node) + <span class="stringliteral">":"</span> +</div><div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58d0c72004cf773e707cb9d43dafc308">ArcDebugString</a>(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[node]) + <span class="stringliteral">"\n"</span>;</div><div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  }</div><div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  <span class="keywordflow">return</span> result;</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">private</span>:</div><div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>  <span class="comment">// Handles reserving space in the next_adjacent_arc_ and head_</span></div><div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>  <span class="comment">// arrays, which are always present and are therefore in the base</span></div><div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  <span class="comment">// class. Although they reside in the base class, those two arrays</span></div><div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  <span class="comment">// are maintained differently by different derived classes,</span></div><div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  <span class="comment">// depending on whether the derived class stores reverse arcs. Hence</span></div><div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  <span class="comment">// the code to set those arrays up is in a method of the derived</span></div><div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  <span class="comment">// class.</span></div><div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  <span class="keywordtype">void</span> ReserveInternal(NodeIndexType new_max_num_nodes,</div><div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  ArcIndexType new_max_num_arcs) {</div><div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>.Reserve(-new_max_num_arcs, new_max_num_arcs - 1);</div><div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">next_adjacent_arc_</a>.Reserve(-new_max_num_arcs, new_max_num_arcs - 1);</div><div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  <span class="keywordflow">for</span> (ArcIndexType arc = -new_max_num_arcs; arc < -<a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a>; ++arc) {</div><div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>.Set(arc, <a class="code" href="classoperations__research_1_1StarGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">kNilNode</a>);</div><div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">next_adjacent_arc_</a>.Set(arc, <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>);</div><div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  }</div><div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  <span class="keywordflow">for</span> (ArcIndexType arc = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a>; arc < new_max_num_arcs; ++arc) {</div><div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>.Set(arc, <a class="code" href="classoperations__research_1_1StarGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">kNilNode</a>);</div><div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">next_adjacent_arc_</a>.Set(arc, <a class="code" href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>);</div><div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  }</div><div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  }</div><div class="line"><a name="l01494"></a><span class="lineno"> 1494</span> </div><div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  <span class="comment">// Returns the first incoming arc for node.</span></div><div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  ArcIndexType FirstIncomingArc(<span class="keyword">const</span> NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  DCHECK_LE(<a class="code" href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a>, node);</div><div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>  DCHECK_GE(<a class="code" href="classoperations__research_1_1StarGraphBase.html#ab059bfdc4854ebf3ffa22cc778a436c3">max_num_nodes_</a>, node);</div><div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>  <span class="keywordflow">return</span> FindNextIncomingArc(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#aa7eb01c1d6e53fc3eb906761eb69734a">FirstOutgoingOrOppositeIncomingArc</a>(node));</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> </div><div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>  <span class="comment">// Returns the incoming arc following the argument in the adjacency list.</span></div><div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  ArcIndexType NextIncomingArc(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">CheckArcValidity</a>(arc));</div><div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraph.html#a782ee113d75db4336845c90858a110ce">IsReverse</a>(arc));</div><div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>  <span class="keywordflow">return</span> FindNextIncomingArc(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#ae4bf065dd416af2bc622a829172e43a9">NextAdjacentArc</a>(arc));</div><div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  }</div><div class="line"><a name="l01508"></a><span class="lineno"> 1508</span> </div><div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  <span class="comment">// Handles the part of AddArc() that is not in common with other</span></div><div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  <span class="comment">// graph classes based on the EbertGraphBase template.</span></div><div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  <span class="keywordtype">void</span> RecordArc(ArcIndexType arc, NodeIndexType tail, NodeIndexType head) {</div><div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>.Set(<a class="code" href="classoperations__research_1_1EbertGraph.html#a5e97f7ded349bc661bf63bca4c951d6b">Opposite</a>(arc), tail);</div><div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>.Set(arc, head);</div><div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  Attach(arc);</div><div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>  }</div><div class="line"><a name="l01516"></a><span class="lineno"> 1516</span> </div><div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  <span class="comment">// Using the SetTail() method implies that the BuildRepresentation()</span></div><div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>  <span class="comment">// method must be called to restore consistency before the graph is</span></div><div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  <span class="comment">// used.</span></div><div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  <span class="keywordtype">void</span> SetTail(<span class="keyword">const</span> ArcIndexType arc, <span class="keyword">const</span> NodeIndexType tail) {</div><div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503">representation_clean_</a> = <span class="keyword">false</span>;</div><div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>.Set(<a class="code" href="classoperations__research_1_1EbertGraph.html#a5e97f7ded349bc661bf63bca4c951d6b">Opposite</a>(arc), tail);</div><div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  }</div><div class="line"><a name="l01524"></a><span class="lineno"> 1524</span> </div><div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  <span class="comment">// Utility method to attach a new arc.</span></div><div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  <span class="keywordtype">void</span> Attach(ArcIndexType arc) {</div><div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">CheckArcValidity</a>(arc));</div><div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>  <span class="keyword">const</span> NodeIndexType tail = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>[<a class="code" href="classoperations__research_1_1EbertGraph.html#a5e97f7ded349bc661bf63bca4c951d6b">Opposite</a>(arc)];</div><div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  DCHECK(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a2b88b717e42d7137a884c36e35052191">IsNodeValid</a>(tail));</div><div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">next_adjacent_arc_</a>.Set(arc, <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[tail]);</div><div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>.Set(tail, arc);</div><div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  <span class="keyword">const</span> NodeIndexType head = <a class="code" href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>[arc];</div><div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  DCHECK(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a2b88b717e42d7137a884c36e35052191">IsNodeValid</a>(head));</div><div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">next_adjacent_arc_</a>.Set(<a class="code" href="classoperations__research_1_1EbertGraph.html#a5e97f7ded349bc661bf63bca4c951d6b">Opposite</a>(arc), <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[head]);</div><div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>.Set(head, <a class="code" href="classoperations__research_1_1EbertGraph.html#a5e97f7ded349bc661bf63bca4c951d6b">Opposite</a>(arc));</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> </div><div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  <span class="comment">// Utility method that finds the next outgoing arc.</span></div><div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  ArcIndexType FindNextOutgoingArc(ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">CheckArcBounds</a>(arc));</div><div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  <span class="keywordflow">while</span> (<a class="code" href="classoperations__research_1_1EbertGraph.html#a782ee113d75db4336845c90858a110ce">IsReverse</a>(arc)) {</div><div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  arc = <a class="code" href="classoperations__research_1_1EbertGraphBase.html#ae4bf065dd416af2bc622a829172e43a9">NextAdjacentArc</a>(arc);</div><div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">CheckArcBounds</a>(arc));</div><div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  }</div><div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  <span class="keywordflow">return</span> arc;</div><div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>  }</div><div class="line"><a name="l01547"></a><span class="lineno"> 1547</span> </div><div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  <span class="comment">// Utility method that finds the next incoming arc.</span></div><div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>  ArcIndexType FindNextIncomingArc(ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">CheckArcBounds</a>(arc));</div><div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>  <span class="keywordflow">while</span> (<a class="code" href="classoperations__research_1_1EbertGraph.html#a05ceae7fb550b3f3728c9c56ed4729d6">IsDirect</a>(arc)) {</div><div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  arc = <a class="code" href="classoperations__research_1_1EbertGraphBase.html#ae4bf065dd416af2bc622a829172e43a9">NextAdjacentArc</a>(arc);</div><div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">CheckArcBounds</a>(arc));</div><div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  }</div><div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  <span class="keywordflow">return</span> arc;</div><div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  }</div><div class="line"><a name="l01557"></a><span class="lineno"> 1557</span> };</div><div class="line"><a name="l01558"></a><span class="lineno"> 1558</span> </div><div class="line"><a name="l01559"></a><span class="lineno"> 1559</span> <span class="comment">// A forward-star-only graph representation for greater efficiency in</span></div><div class="line"><a name="l01560"></a><span class="lineno"> 1560</span> <span class="comment">// those algorithms that don't need reverse arcs.</span></div><div class="line"><a name="l01561"></a><span class="lineno"> 1561</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01562"></a><span class="lineno"> 1562</span> <span class="keyword">class </span>ForwardEbertGraph</div><div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  : <span class="keyword">public</span> EbertGraphBase<NodeIndexType, ArcIndexType,</div><div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  ForwardEbertGraph<NodeIndexType, ArcIndexType> > {</div><div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  <span class="keyword">typedef</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a04c9ae002dae9ce9a47d37156a6d0c88">EbertGraphBase</a><NodeIndexType, ArcIndexType,</div><div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  ForwardEbertGraph<NodeIndexType, ArcIndexType> ></div><div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  Base;</div><div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1EbertGraphBase.html#a04c9ae002dae9ce9a47d37156a6d0c88">EbertGraphBase</a><NodeIndexType, ArcIndexType,</div><div class="line"><a name="l01569"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#a8fdd2d0396c7ec0609a4351f716aef5f"> 1569</a></span>  <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html">ForwardEbertGraph</a><NodeIndexType, ArcIndexType> >;</div><div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>  <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1StarGraphBase.html">StarGraphBase</a><NodeIndexType, ArcIndexType,</div><div class="line"><a name="l01571"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#a693f3f74a8aa4a10dbc5a040fd6c31eb"> 1571</a></span>  <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html">ForwardEbertGraph</a><NodeIndexType, ArcIndexType> >;</div><div class="line"><a name="l01572"></a><span class="lineno"> 1572</span> </div><div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58d0c72004cf773e707cb9d43dafc308">Base::ArcDebugString</a>;</div><div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a91ea251fe7caa0122a01f738892dd03b">Base::Initialize</a>;</div><div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#ae4bf065dd416af2bc622a829172e43a9">Base::NextAdjacentArc</a>;</div><div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a74cc112e18e1496d720c48f6082d2671">Base::NodeDebugString</a>;</div><div class="line"><a name="l01577"></a><span class="lineno"> 1577</span> </div><div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a58b521f62562f51a79f9c95f1902804a">Base::first_incident_arc_</a>;</div><div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">Base::head_</a>;</div><div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">Base::max_num_arcs_</a>;</div><div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#ab059bfdc4854ebf3ffa22cc778a436c3">Base::max_num_nodes_</a>;</div><div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">Base::next_adjacent_arc_</a>;</div><div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">Base::num_arcs_</a>;</div><div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">Base::num_nodes_</a>;</div><div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503">Base::representation_clean_</a>;</div><div class="line"><a name="l01586"></a><span class="lineno"> 1586</span> </div><div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01588"></a><span class="lineno"> 1588</span> <span class="preprocessor">#if !SWIG</span></div><div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1StarGraphBase.html#a5237cfbb86ec8f305e498e873e5c4e95">Base::Head</a>;</div><div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a2b88b717e42d7137a884c36e35052191">Base::IsNodeValid</a>;</div><div class="line"><a name="l01591"></a><span class="lineno"> 1591</span> </div><div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">Base::kFirstArc</a>;</div><div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">Base::kFirstNode</a>;</div><div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">Base::kNilArc</a>;</div><div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  <span class="keyword">using</span> <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">Base::kNilNode</a>;</div><div class="line"><a name="l01596"></a><span class="lineno"> 1596</span> <span class="preprocessor">#endif // SWIG</span></div><div class="line"><a name="l01597"></a><span class="lineno"> 1597</span> </div><div class="line"><a name="l01598"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#aec05ff3d270a5f888e1623c2a99ff2aa"> 1598</a></span>  <span class="keyword">typedef</span> NodeIndexType <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#aec05ff3d270a5f888e1623c2a99ff2aa">NodeIndex</a>;</div><div class="line"><a name="l01599"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#a92531459eff09455cfa63976f5024906"> 1599</a></span>  <span class="keyword">typedef</span> ArcIndexType <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a92531459eff09455cfa63976f5024906">ArcIndex</a>;</div><div class="line"><a name="l01600"></a><span class="lineno"> 1600</span> </div><div class="line"><a name="l01601"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#a408829a652c1c14c0dc1245fc396820f"> 1601</a></span>  <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a408829a652c1c14c0dc1245fc396820f">ForwardEbertGraph</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"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#a3204d12d83e8425b42e6450999cfbcfa"> 1603</a></span>  <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a3204d12d83e8425b42e6450999cfbcfa">ForwardEbertGraph</a>(NodeIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a29774a2f068745000e90eaf549543144">max_num_nodes</a>, ArcIndexType <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6dea64dce5de0432befc47f85176ab19">max_num_arcs</a>) {</div><div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a91ea251fe7caa0122a01f738892dd03b">Initialize</a>(<a class="code" href="classoperations__research_1_1StarGraphBase.html#a29774a2f068745000e90eaf549543144">max_num_nodes</a>, <a class="code" href="classoperations__research_1_1StarGraphBase.html#a6dea64dce5de0432befc47f85176ab19">max_num_arcs</a>);</div><div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>  }</div><div class="line"><a name="l01606"></a><span class="lineno"> 1606</span> </div><div class="line"><a name="l01607"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#ad800188c6e863c051d5dd24583cfc8ec"> 1607</a></span>  <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#ad800188c6e863c051d5dd24583cfc8ec">~ForwardEbertGraph</a>() {}</div><div class="line"><a name="l01608"></a><span class="lineno"> 1608</span> </div><div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  <span class="comment">// Utility function to check that an arc index is within the bounds.</span></div><div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>  <span class="comment">// It is exported so that users of the ForwardEbertGraph class can use it.</span></div><div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  <span class="comment">// To be used in a DCHECK.</span></div><div class="line"><a name="l01612"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb"> 1612</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">CheckArcBounds</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  <span class="keywordflow">return</span> (arc == <a class="code" href="classoperations__research_1_1EbertGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>) || (arc >= <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a> && arc < <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a>);</div><div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  }</div><div class="line"><a name="l01615"></a><span class="lineno"> 1615</span> </div><div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  <span class="comment">// Utility function to check that an arc index is within the bounds AND</span></div><div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  <span class="comment">// different from kNilArc.</span></div><div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  <span class="comment">// It is exported so that users of the ForwardEbertGraph class can use it.</span></div><div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  <span class="comment">// To be used in a DCHECK.</span></div><div class="line"><a name="l01620"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#a553e5eeb2887a1d7663e1200b7466e6c"> 1620</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">CheckArcValidity</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>  <span class="keywordflow">return</span> (arc != <a class="code" href="classoperations__research_1_1EbertGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>) && (arc >= <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a> && arc < <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a>);</div><div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  }</div><div class="line"><a name="l01623"></a><span class="lineno"> 1623</span> </div><div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>  <span class="comment">// Returns true if arc is a valid index into the (*tail_) array.</span></div><div class="line"><a name="l01625"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#a6832ebe70da89cb9d2efea26a823d204"> 1625</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a6832ebe70da89cb9d2efea26a823d204">CheckTailIndexValidity</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>  <span class="keywordflow">return</span> (tail_ != <span class="keyword">nullptr</span>) && (arc >= <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>) &&</div><div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>  (arc <= tail_->max_index());</div><div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>  }</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="comment">// Returns the tail or start-node of arc.</span></div><div class="line"><a name="l01631"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#aae684b1eb132c8c201f437d88e367b55"> 1631</a></span>  NodeIndexType <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#aae684b1eb132c8c201f437d88e367b55">Tail</a>(<span class="keyword">const</span> ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>  DCHECK(<a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">CheckArcValidity</a>(arc));</div><div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  DCHECK(<a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a6832ebe70da89cb9d2efea26a823d204">CheckTailIndexValidity</a>(arc));</div><div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>  <span class="keywordflow">return</span> (*tail_)[arc];</div><div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  }</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="comment">// Returns true if arc is incoming to node.</span></div><div class="line"><a name="l01638"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#a4bdbd200e31110f301a3fed9abf15626"> 1638</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a4bdbd200e31110f301a3fed9abf15626">IsIncoming</a>(ArcIndexType arc, NodeIndexType node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>  <span class="keywordflow">return</span> IsDirect(arc) && <a class="code" href="classoperations__research_1_1StarGraphBase.html#a5237cfbb86ec8f305e498e873e5c4e95">Head</a>(arc) == node;</div><div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>  }</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>  <span class="comment">// Recreates the next_adjacent_arc_ and first_incident_arc_</span></div><div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>  <span class="comment">// variables from the arrays head_ and tail_ in O(n + m) time. This</span></div><div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>  <span class="comment">// is useful if the head_ and tail_ arrays have been sorted</span></div><div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  <span class="comment">// according to a given criterion, for example.</span></div><div class="line"><a name="l01646"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#a3fe1b105925a29cd63741e6dc85cfe45"> 1646</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a3fe1b105925a29cd63741e6dc85cfe45">BuildRepresentation</a>() {</div><div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>.SetAll(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>);</div><div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  DCHECK(<a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#adf0cfc6d2bc79267111a8d38a1f6ffea">TailArrayComplete</a>());</div><div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  <span class="keywordflow">for</span> (ArcIndexType arc = <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>; arc < <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a>; ++arc) {</div><div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  DCHECK(<a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a6832ebe70da89cb9d2efea26a823d204">CheckTailIndexValidity</a>(arc));</div><div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>  Attach((*tail_)[arc], arc);</div><div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>  }</div><div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503">representation_clean_</a> = <span class="keyword">true</span>;</div><div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>  }</div><div class="line"><a name="l01655"></a><span class="lineno"> 1655</span> </div><div class="line"><a name="l01656"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#a53ee05de8f3dd5145b9c0a5ef903a399"> 1656</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a53ee05de8f3dd5145b9c0a5ef903a399">BuildTailArray</a>() {</div><div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>  <span class="comment">// If (*tail_) is already allocated, we have the invariant that</span></div><div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>  <span class="comment">// its contents are canonical, so we do not need to do anything</span></div><div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>  <span class="comment">// here in that case except return true.</span></div><div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>  <span class="keywordflow">if</span> (tail_ == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503">representation_clean_</a>) {</div><div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>  <span class="comment">// We have been asked to build the (*tail_) array, but we have</span></div><div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>  <span class="comment">// no valid information from which to build it. The graph is</span></div><div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>  <span class="comment">// in an unrecoverable, inconsistent state.</span></div><div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>  }</div><div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>  <span class="comment">// Reallocate (*tail_) and rebuild its contents from the</span></div><div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>  <span class="comment">// adjacency lists.</span></div><div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>  tail_.reset(<span class="keyword">new</span> ZVector<NodeIndexType>);</div><div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>  tail_->Reserve(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>, <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a> - 1);</div><div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>  <span class="keyword">typename</span> Base::NodeIterator node_it(*<span class="keyword">this</span>);</div><div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>  <span class="keywordflow">for</span> (; node_it.Ok(); node_it.Next()) {</div><div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>  NodeIndexType node = node_it.Index();</div><div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  <span class="keyword">typename</span> Base::OutgoingArcIterator arc_it(*<span class="keyword">this</span>, node);</div><div class="line"><a name="l01675"></a><span class="lineno"> 1675</span>  <span class="keywordflow">for</span> (; arc_it.Ok(); arc_it.Next()) {</div><div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>  (*tail_)[arc_it.Index()] = node;</div><div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>  }</div><div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>  }</div><div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>  }</div><div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>  DCHECK(<a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#adf0cfc6d2bc79267111a8d38a1f6ffea">TailArrayComplete</a>());</div><div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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> </div><div class="line"><a name="l01684"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#a6310ea59fd0f4f0f5de8671c87134fd9"> 1684</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a6310ea59fd0f4f0f5de8671c87134fd9">ReleaseTailArray</a>() { tail_.reset(<span class="keyword">nullptr</span>); }</div><div class="line"><a name="l01685"></a><span class="lineno"> 1685</span> </div><div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>  <span class="comment">// To be used in a DCHECK().</span></div><div class="line"><a name="l01687"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#adf0cfc6d2bc79267111a8d38a1f6ffea"> 1687</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#adf0cfc6d2bc79267111a8d38a1f6ffea">TailArrayComplete</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  CHECK(tail_);</div><div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>  <span class="keywordflow">for</span> (ArcIndexType arc = <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>; arc < <a class="code" href="classoperations__research_1_1EbertGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">num_arcs_</a>; ++arc) {</div><div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>  CHECK(<a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a6832ebe70da89cb9d2efea26a823d204">CheckTailIndexValidity</a>(arc));</div><div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>  CHECK(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a2b88b717e42d7137a884c36e35052191">IsNodeValid</a>((*tail_)[arc]));</div><div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>  }</div><div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>  <span class="keywordflow">return</span> <span class="keyword">true</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> </div><div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>  <span class="comment">// Returns a debug std::string containing all the information contained in the</span></div><div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>  <span class="comment">// data structure in raw form.</span></div><div class="line"><a name="l01698"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ForwardEbertGraph.html#a764be64f3029f8b8e23511061d8de355"> 1698</a></span>  std::string <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a764be64f3029f8b8e23511061d8de355">DebugString</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503">representation_clean_</a>);</div><div class="line"><a name="l01700"></a><span class="lineno"> 1700</span>  std::string result = <span class="stringliteral">"Arcs:(node, next arc) :\n"</span>;</div><div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>  <span class="keywordflow">for</span> (ArcIndexType arc = <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>; arc < <a class="code" href="classoperations__research_1_1EbertGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">num_arcs_</a>; ++arc) {</div><div class="line"><a name="l01702"></a><span class="lineno"> 1702</span>  result += <span class="stringliteral">" "</span> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58d0c72004cf773e707cb9d43dafc308">ArcDebugString</a>(arc) + <span class="stringliteral">":("</span> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a74cc112e18e1496d720c48f6082d2671">NodeDebugString</a>(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>[arc]) +</div><div class="line"><a name="l01703"></a><span class="lineno"> 1703</span>  <span class="stringliteral">","</span> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58d0c72004cf773e707cb9d43dafc308">ArcDebugString</a>(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">next_adjacent_arc_</a>[arc]) + <span class="stringliteral">")\n"</span>;</div><div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>  }</div><div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>  result += <span class="stringliteral">"Node:First arc :\n"</span>;</div><div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>  <span class="keywordflow">for</span> (NodeIndexType node = <a class="code" href="classoperations__research_1_1EbertGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">kFirstNode</a>; node < <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">num_nodes_</a>; ++node) {</div><div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>  result += <span class="stringliteral">" "</span> + <a class="code" href="classoperations__research_1_1StarGraphBase.html#a74cc112e18e1496d720c48f6082d2671">NodeDebugString</a>(node) + <span class="stringliteral">":"</span> +</div><div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>  <a class="code" href="classoperations__research_1_1StarGraphBase.html#a58d0c72004cf773e707cb9d43dafc308">ArcDebugString</a>(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[node]) + <span class="stringliteral">"\n"</span>;</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>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l01711"></a><span class="lineno"> 1711</span>  }</div><div class="line"><a name="l01712"></a><span class="lineno"> 1712</span> </div><div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>  <span class="comment">// Reserves space for the (*tail_) array.</span></div><div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>  <span class="comment">//</span></div><div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>  <span class="comment">// This method is separate from ReserveInternal() because our</span></div><div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>  <span class="comment">// practice of making the (*tail_) array optional implies that the</span></div><div class="line"><a name="l01718"></a><span class="lineno"> 1718</span>  <span class="comment">// tail_ pointer might not be constructed when the ReserveInternal()</span></div><div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>  <span class="comment">// method is called. Therefore we have this method also, and we</span></div><div class="line"><a name="l01720"></a><span class="lineno"> 1720</span>  <span class="comment">// ensure that it is called only when tail_ is guaranteed to have</span></div><div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>  <span class="comment">// been initialized.</span></div><div class="line"><a name="l01722"></a><span class="lineno"> 1722</span>  <span class="keywordtype">void</span> ReserveTailArray(ArcIndexType new_max_num_arcs) {</div><div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>  <span class="keywordflow">if</span> (tail_ != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01724"></a><span class="lineno"> 1724</span>  <span class="comment">// The (*tail_) values are already canonical, so we're just</span></div><div class="line"><a name="l01725"></a><span class="lineno"> 1725</span>  <span class="comment">// reserving additional space for new arcs that haven't been</span></div><div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>  <span class="comment">// added yet.</span></div><div class="line"><a name="l01727"></a><span class="lineno"> 1727</span>  <span class="keywordflow">if</span> (tail_->Reserve(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>, new_max_num_arcs - 1)) {</div><div class="line"><a name="l01728"></a><span class="lineno"> 1728</span>  <span class="keywordflow">for</span> (ArcIndexType arc = tail_->max_index() + 1; arc < new_max_num_arcs;</div><div class="line"><a name="l01729"></a><span class="lineno"> 1729</span>  ++arc) {</div><div class="line"><a name="l01730"></a><span class="lineno"> 1730</span>  tail_->Set(arc, <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">kNilNode</a>);</div><div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>  }</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>  }</div><div class="line"><a name="l01735"></a><span class="lineno"> 1735</span> </div><div class="line"><a name="l01736"></a><span class="lineno"> 1736</span>  <span class="comment">// Reserves space for the arrays indexed by arc indices, except</span></div><div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>  <span class="comment">// (*tail_) even if it is present. We cannot grow the (*tail_) array</span></div><div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>  <span class="comment">// in this method because this method is called from</span></div><div class="line"><a name="l01739"></a><span class="lineno"> 1739</span>  <span class="comment">// Base::Reserve(), which in turn is called from the base template</span></div><div class="line"><a name="l01740"></a><span class="lineno"> 1740</span>  <span class="comment">// class constructor. That base class constructor is called on *this</span></div><div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>  <span class="comment">// before tail_ is constructed. Hence when this method is called,</span></div><div class="line"><a name="l01742"></a><span class="lineno"> 1742</span>  <span class="comment">// tail_ might contain garbage. This method can safely refer only to</span></div><div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>  <span class="comment">// fields of the base template class, not to fields of *this outside</span></div><div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>  <span class="comment">// the base template class.</span></div><div class="line"><a name="l01745"></a><span class="lineno"> 1745</span>  <span class="comment">//</span></div><div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>  <span class="comment">// The strange situation in which this method of a derived class can</span></div><div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>  <span class="comment">// refer only to members of the base class arises because different</span></div><div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>  <span class="comment">// derived classes use the data members of the base class in</span></div><div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>  <span class="comment">// slightly different ways. The purpose of this derived class</span></div><div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>  <span class="comment">// method, then, is only to encode the derived-class-specific</span></div><div class="line"><a name="l01751"></a><span class="lineno"> 1751</span>  <span class="comment">// conventions for how the derived class uses the data members of</span></div><div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>  <span class="comment">// the base class.</span></div><div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>  <span class="comment">//</span></div><div class="line"><a name="l01754"></a><span class="lineno"> 1754</span>  <span class="comment">// To be specific, the forward-star graph representation, lacking</span></div><div class="line"><a name="l01755"></a><span class="lineno"> 1755</span>  <span class="comment">// reverse arcs, allocates only the positive index range for the</span></div><div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>  <span class="comment">// head_ and next_adjacent_arc_ arrays, while the general</span></div><div class="line"><a name="l01757"></a><span class="lineno"> 1757</span>  <span class="comment">// representation allocates space for both positive- and</span></div><div class="line"><a name="l01758"></a><span class="lineno"> 1758</span>  <span class="comment">// negative-indexed arcs (i.e., both forward and reverse arcs).</span></div><div class="line"><a name="l01759"></a><span class="lineno"> 1759</span>  <span class="keywordtype">void</span> ReserveInternal(NodeIndexType new_max_num_nodes,</div><div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>  ArcIndexType new_max_num_arcs) {</div><div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>.Reserve(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>, new_max_num_arcs - 1);</div><div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">next_adjacent_arc_</a>.Reserve(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">kFirstArc</a>, new_max_num_arcs - 1);</div><div class="line"><a name="l01763"></a><span class="lineno"> 1763</span>  <span class="keywordflow">for</span> (ArcIndexType arc = <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">max_num_arcs_</a>; arc < new_max_num_arcs; ++arc) {</div><div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>.Set(arc, <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">kNilNode</a>);</div><div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">next_adjacent_arc_</a>.Set(arc, <a class="code" href="classoperations__research_1_1EbertGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">kNilArc</a>);</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>  ReserveTailArray(new_max_num_arcs);</div><div class="line"><a name="l01768"></a><span class="lineno"> 1768</span>  }</div><div class="line"><a name="l01769"></a><span class="lineno"> 1769</span> </div><div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>  <span class="comment">// Handles the part of AddArc() that is not in common wth other</span></div><div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>  <span class="comment">// graph classes based on the EbertGraphBase template.</span></div><div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>  <span class="keywordtype">void</span> RecordArc(ArcIndexType arc, NodeIndexType tail, NodeIndexType head) {</div><div class="line"><a name="l01773"></a><span class="lineno"> 1773</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>.Set(arc, head);</div><div class="line"><a name="l01774"></a><span class="lineno"> 1774</span>  Attach(tail, arc);</div><div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>  }</div><div class="line"><a name="l01776"></a><span class="lineno"> 1776</span> </div><div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>  <span class="comment">// Using the SetTail() method implies that the BuildRepresentation()</span></div><div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>  <span class="comment">// method must be called to restore consistency before the graph is</span></div><div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>  <span class="comment">// used.</span></div><div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>  <span class="keywordtype">void</span> SetTail(<span class="keyword">const</span> ArcIndexType arc, <span class="keyword">const</span> NodeIndexType tail) {</div><div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>  DCHECK(<a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a6832ebe70da89cb9d2efea26a823d204">CheckTailIndexValidity</a>(arc));</div><div class="line"><a name="l01782"></a><span class="lineno"> 1782</span>  CHECK(tail_);</div><div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503">representation_clean_</a> = <span class="keyword">false</span>;</div><div class="line"><a name="l01784"></a><span class="lineno"> 1784</span>  tail_->Set(arc, tail);</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> </div><div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>  <span class="comment">// Utility method to attach a new arc.</span></div><div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>  <span class="keywordtype">void</span> Attach(NodeIndexType tail, ArcIndexType arc) {</div><div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>  DCHECK(<a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">CheckArcValidity</a>(arc));</div><div class="line"><a name="l01790"></a><span class="lineno"> 1790</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a2b88b717e42d7137a884c36e35052191">IsNodeValid</a>(tail));</div><div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">next_adjacent_arc_</a>.Set(arc, <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>[tail]);</div><div class="line"><a name="l01792"></a><span class="lineno"> 1792</span>  <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a58b521f62562f51a79f9c95f1902804a">first_incident_arc_</a>.Set(tail, arc);</div><div class="line"><a name="l01793"></a><span class="lineno"> 1793</span>  <span class="keyword">const</span> NodeIndexType head = <a class="code" href="classoperations__research_1_1EbertGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">head_</a>[arc];</div><div class="line"><a name="l01794"></a><span class="lineno"> 1794</span>  DCHECK(<a class="code" href="classoperations__research_1_1EbertGraphBase.html#a2b88b717e42d7137a884c36e35052191">IsNodeValid</a>(head));</div><div class="line"><a name="l01795"></a><span class="lineno"> 1795</span>  <span class="comment">// Because Attach() is a public method, keeping (*tail_) canonical</span></div><div class="line"><a name="l01796"></a><span class="lineno"> 1796</span>  <span class="comment">// requires us to record the new arc's tail here.</span></div><div class="line"><a name="l01797"></a><span class="lineno"> 1797</span>  <span class="keywordflow">if</span> (tail_ != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01798"></a><span class="lineno"> 1798</span>  DCHECK(<a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a6832ebe70da89cb9d2efea26a823d204">CheckTailIndexValidity</a>(arc));</div><div class="line"><a name="l01799"></a><span class="lineno"> 1799</span>  tail_->Set(arc, tail);</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>  }</div><div class="line"><a name="l01802"></a><span class="lineno"> 1802</span> </div><div class="line"><a name="l01803"></a><span class="lineno"> 1803</span>  <span class="comment">// Utility method that finds the next outgoing arc.</span></div><div class="line"><a name="l01804"></a><span class="lineno"> 1804</span>  ArcIndexType FindNextOutgoingArc(ArcIndexType arc)<span class="keyword"> const </span>{</div><div class="line"><a name="l01805"></a><span class="lineno"> 1805</span>  DCHECK(<a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">CheckArcBounds</a>(arc));</div><div class="line"><a name="l01806"></a><span class="lineno"> 1806</span>  <span class="keywordflow">return</span> arc;</div><div class="line"><a name="l01807"></a><span class="lineno"> 1807</span>  }</div><div class="line"><a name="l01808"></a><span class="lineno"> 1808</span> </div><div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01810"></a><span class="lineno"> 1810</span>  <span class="comment">// Always returns true because for any ForwardEbertGraph, only</span></div><div class="line"><a name="l01811"></a><span class="lineno"> 1811</span>  <span class="comment">// direct arcs are represented, so all valid arc indices refer to</span></div><div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>  <span class="comment">// arcs that are outgoing from their tail nodes.</span></div><div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>  <span class="keywordtype">bool</span> IsOutgoing(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a92531459eff09455cfa63976f5024906">ArcIndex</a> unused_arc,</div><div class="line"><a name="l01814"></a><span class="lineno"> 1814</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#aec05ff3d270a5f888e1623c2a99ff2aa">NodeIndex</a> unused_node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01815"></a><span class="lineno"> 1815</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01816"></a><span class="lineno"> 1816</span>  }</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>  <span class="comment">// Always returns true because for any ForwardEbertGraph, only</span></div><div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>  <span class="comment">// outgoing arcs are represented, so all valid arc indices refer to</span></div><div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>  <span class="comment">// direct arcs.</span></div><div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>  <span class="keywordtype">bool</span> IsDirect(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1ForwardEbertGraph.html#a92531459eff09455cfa63976f5024906">ArcIndex</a> unused_arc)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <span class="keyword">true</span>; }</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="comment">// Array of node indices, not always present. (*tail_)[i] contains</span></div><div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>  <span class="comment">// the tail node of arc i. This array is not needed for normal graph</span></div><div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>  <span class="comment">// traversal operations, but is used in optimizing the graph's</span></div><div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>  <span class="comment">// layout so arcs are grouped by tail node, and can be used in one</span></div><div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>  <span class="comment">// approach to serializing the graph.</span></div><div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>  <span class="comment">//</span></div><div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>  <span class="comment">// Invariants: At any time when we are not executing a method of</span></div><div class="line"><a name="l01830"></a><span class="lineno"> 1830</span>  <span class="comment">// this class, either tail_ == NULL or the tail_ array's contents</span></div><div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>  <span class="comment">// are kept canonical. If tail_ != NULL, any method that modifies</span></div><div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>  <span class="comment">// adjacency lists must also ensure (*tail_) is modified</span></div><div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>  <span class="comment">// correspondingly. The converse does not hold: Modifications to</span></div><div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>  <span class="comment">// (*tail_) are allowed without updating the adjacency lists. If</span></div><div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>  <span class="comment">// such modifications take place, representation_clean_ must be set</span></div><div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  <span class="comment">// to false, of course, to indicate that the adjacency lists are no</span></div><div class="line"><a name="l01837"></a><span class="lineno"> 1837</span>  <span class="comment">// longer current.</span></div><div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  std::unique_ptr<ZVector<NodeIndexType> > tail_;</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> </div><div class="line"><a name="l01841"></a><span class="lineno"> 1841</span> <span class="comment">// Traits for EbertGraphBase types, for use in testing and clients</span></div><div class="line"><a name="l01842"></a><span class="lineno"> 1842</span> <span class="comment">// that work with both forward-only and forward/reverse graphs.</span></div><div class="line"><a name="l01843"></a><span class="lineno"> 1843</span> <span class="comment">//</span></div><div class="line"><a name="l01844"></a><span class="lineno"> 1844</span> <span class="comment">// The default is to assume reverse arcs so if someone forgets to</span></div><div class="line"><a name="l01845"></a><span class="lineno"> 1845</span> <span class="comment">// specialize the traits of a new forward-only graph type, they will</span></div><div class="line"><a name="l01846"></a><span class="lineno"> 1846</span> <span class="comment">// get errors from tests rather than incomplete testing.</span></div><div class="line"><a name="l01847"></a><span class="lineno"> 1847</span> <span class="keyword">template</span> <<span class="keyword">typename</span> GraphType></div><div class="line"><a name="l01848"></a><span class="lineno"><a class="line" href="structoperations__research_1_1graph__traits.html"> 1848</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1graph__traits.html">graph_traits</a> {</div><div class="line"><a name="l01849"></a><span class="lineno"><a class="line" href="structoperations__research_1_1graph__traits.html#a9e3309483a491bf0508bfc471b492a8f"> 1849</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1graph__traits.html#a9e3309483a491bf0508bfc471b492a8f">has_reverse_arcs</a> = <span class="keyword">true</span>;</div><div class="line"><a name="l01850"></a><span class="lineno"><a class="line" href="structoperations__research_1_1graph__traits.html#ab96eca623728389006cfa013da781e1e"> 1850</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1graph__traits.html#ab96eca623728389006cfa013da781e1e">is_dynamic</a> = <span class="keyword">true</span>;</div><div class="line"><a name="l01851"></a><span class="lineno"> 1851</span> };</div><div class="line"><a name="l01852"></a><span class="lineno"> 1852</span> </div><div class="line"><a name="l01853"></a><span class="lineno"> 1853</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01854"></a><span class="lineno"><a class="line" href="structoperations__research_1_1graph__traits_3_01ForwardEbertGraph_3_01NodeIndexType_00_01ArcIndexType_01_4_01_4.html"> 1854</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1graph__traits.html">graph_traits</a><<a class="code" href="classoperations__research_1_1ForwardEbertGraph.html">ForwardEbertGraph</a><NodeIndexType, ArcIndexType> > {</div><div class="line"><a name="l01855"></a><span class="lineno"><a class="line" href="structoperations__research_1_1graph__traits_3_01ForwardEbertGraph_3_01NodeIndexType_00_01ArcIndexType_01_4_01_4.html#a9e3309483a491bf0508bfc471b492a8f"> 1855</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1graph__traits.html#a9e3309483a491bf0508bfc471b492a8f">has_reverse_arcs</a> = <span class="keyword">false</span>;</div><div class="line"><a name="l01856"></a><span class="lineno"><a class="line" href="structoperations__research_1_1graph__traits_3_01ForwardEbertGraph_3_01NodeIndexType_00_01ArcIndexType_01_4_01_4.html#ab96eca623728389006cfa013da781e1e"> 1856</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1graph__traits.html#ab96eca623728389006cfa013da781e1e">is_dynamic</a> = <span class="keyword">true</span>;</div><div class="line"><a name="l01857"></a><span class="lineno"> 1857</span> };</div><div class="line"><a name="l01858"></a><span class="lineno"> 1858</span> </div><div class="line"><a name="l01859"></a><span class="lineno"> 1859</span> <span class="keyword">template</span> <<span class="keyword">typename</span> NodeIndexType, <span class="keyword">typename</span> ArcIndexType></div><div class="line"><a name="l01860"></a><span class="lineno"><a class="line" href="structoperations__research_1_1graph__traits_3_01ForwardStaticGraph_3_01NodeIndexType_00_01ArcIndexType_01_4_01_4.html"> 1860</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1graph__traits.html">graph_traits</a><<a class="code" href="classoperations__research_1_1ForwardStaticGraph.html">ForwardStaticGraph</a><NodeIndexType, ArcIndexType> > {</div><div class="line"><a name="l01861"></a><span class="lineno"><a class="line" href="structoperations__research_1_1graph__traits_3_01ForwardStaticGraph_3_01NodeIndexType_00_01ArcIndexType_01_4_01_4.html#a9e3309483a491bf0508bfc471b492a8f"> 1861</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1graph__traits.html#a9e3309483a491bf0508bfc471b492a8f">has_reverse_arcs</a> = <span class="keyword">false</span>;</div><div class="line"><a name="l01862"></a><span class="lineno"><a class="line" href="structoperations__research_1_1graph__traits_3_01ForwardStaticGraph_3_01NodeIndexType_00_01ArcIndexType_01_4_01_4.html#ab96eca623728389006cfa013da781e1e"> 1862</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1graph__traits.html#ab96eca623728389006cfa013da781e1e">is_dynamic</a> = <span class="keyword">false</span>;</div><div class="line"><a name="l01863"></a><span class="lineno"> 1863</span> };</div><div class="line"><a name="l01864"></a><span class="lineno"> 1864</span> </div><div class="line"><a name="l01865"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1or__internal.html"> 1865</a></span> <span class="keyword">namespace </span>or_internal {</div><div class="line"><a name="l01866"></a><span class="lineno"> 1866</span> </div><div class="line"><a name="l01867"></a><span class="lineno"> 1867</span> <span class="comment">// The TailArrayBuilder class template is not expected to be used by</span></div><div class="line"><a name="l01868"></a><span class="lineno"> 1868</span> <span class="comment">// clients. It is a helper for the TailArrayManager template.</span></div><div class="line"><a name="l01869"></a><span class="lineno"> 1869</span> <span class="comment">//</span></div><div class="line"><a name="l01870"></a><span class="lineno"> 1870</span> <span class="comment">// The TailArrayBuilder for graphs with reverse arcs does nothing.</span></div><div class="line"><a name="l01871"></a><span class="lineno"> 1871</span> <span class="keyword">template</span> <<span class="keyword">typename</span> GraphType, <span class="keywordtype">bool</span> has_reverse_arcs></div><div class="line"><a name="l01872"></a><span class="lineno"><a class="line" href="structoperations__research_1_1or__internal_1_1TailArrayBuilder.html"> 1872</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1or__internal_1_1TailArrayBuilder.html">TailArrayBuilder</a> {</div><div class="line"><a name="l01873"></a><span class="lineno"><a class="line" href="structoperations__research_1_1or__internal_1_1TailArrayBuilder.html#a8ec6007e04b88bc7ffd141c30faaa898"> 1873</a></span>  <span class="keyword">explicit</span> <a class="code" href="structoperations__research_1_1or__internal_1_1TailArrayBuilder.html#a8ec6007e04b88bc7ffd141c30faaa898">TailArrayBuilder</a>(GraphType* unused_graph) {}</div><div class="line"><a name="l01874"></a><span class="lineno"> 1874</span> </div><div class="line"><a name="l01875"></a><span class="lineno"><a class="line" href="structoperations__research_1_1or__internal_1_1TailArrayBuilder.html#a1ab05b86b5f9b013291f26847b626bc8"> 1875</a></span>  <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1or__internal_1_1TailArrayBuilder.html#a1ab05b86b5f9b013291f26847b626bc8">BuildTailArray</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div><div class="line"><a name="l01876"></a><span class="lineno"> 1876</span> };</div><div class="line"><a name="l01877"></a><span class="lineno"> 1877</span> </div><div class="line"><a name="l01878"></a><span class="lineno"> 1878</span> <span class="comment">// The TailArrayBuilder for graphs without reverse arcs calls the</span></div><div class="line"><a name="l01879"></a><span class="lineno"> 1879</span> <span class="comment">// appropriate method on the graph from the TailArrayBuilder</span></div><div class="line"><a name="l01880"></a><span class="lineno"> 1880</span> <span class="comment">// constructor.</span></div><div class="line"><a name="l01881"></a><span class="lineno"> 1881</span> <span class="keyword">template</span> <<span class="keyword">typename</span> GraphType></div><div class="line"><a name="l01882"></a><span class="lineno"><a class="line" href="structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4.html"> 1882</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1or__internal_1_1TailArrayBuilder.html">TailArrayBuilder</a><GraphType, false> {</div><div class="line"><a name="l01883"></a><span class="lineno"><a class="line" href="structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4.html#ae13ccc497c6bd89aabe9b7f03b2a91b8"> 1883</a></span>  <span class="keyword">explicit</span> <a class="code" href="structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4.html#ae13ccc497c6bd89aabe9b7f03b2a91b8">TailArrayBuilder</a>(GraphType* graph) : graph_(graph) {}</div><div class="line"><a name="l01884"></a><span class="lineno"> 1884</span> </div><div class="line"><a name="l01885"></a><span class="lineno"><a class="line" href="structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4.html#a1ab05b86b5f9b013291f26847b626bc8"> 1885</a></span>  <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4.html#a1ab05b86b5f9b013291f26847b626bc8">BuildTailArray</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> graph_->BuildTailArray(); }</div><div class="line"><a name="l01886"></a><span class="lineno"> 1886</span> </div><div class="line"><a name="l01887"></a><span class="lineno"><a class="line" href="structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4.html#a29714e1125e2707087a39d1d11467d34"> 1887</a></span>  GraphType* <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4.html#a29714e1125e2707087a39d1d11467d34">graph_</a>;</div><div class="line"><a name="l01888"></a><span class="lineno"> 1888</span> };</div><div class="line"><a name="l01889"></a><span class="lineno"> 1889</span> </div><div class="line"><a name="l01890"></a><span class="lineno"> 1890</span> <span class="comment">// The TailArrayReleaser class template is not expected to be used by</span></div><div class="line"><a name="l01891"></a><span class="lineno"> 1891</span> <span class="comment">// clients. It is a helper for the TailArrayManager template.</span></div><div class="line"><a name="l01892"></a><span class="lineno"> 1892</span> <span class="comment">//</span></div><div class="line"><a name="l01893"></a><span class="lineno"> 1893</span> <span class="comment">// The TailArrayReleaser for graphs with reverse arcs does nothing.</span></div><div class="line"><a name="l01894"></a><span class="lineno"> 1894</span> <span class="keyword">template</span> <<span class="keyword">typename</span> GraphType, <span class="keywordtype">bool</span> has_reverse_arcs></div><div class="line"><a name="l01895"></a><span class="lineno"><a class="line" href="structoperations__research_1_1or__internal_1_1TailArrayReleaser.html"> 1895</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1or__internal_1_1TailArrayReleaser.html">TailArrayReleaser</a> {</div><div class="line"><a name="l01896"></a><span class="lineno"><a class="line" href="structoperations__research_1_1or__internal_1_1TailArrayReleaser.html#ad876770c3b79906872847d8a77115931"> 1896</a></span>  <span class="keyword">explicit</span> <a class="code" href="structoperations__research_1_1or__internal_1_1TailArrayReleaser.html#ad876770c3b79906872847d8a77115931">TailArrayReleaser</a>(GraphType* unused_graph) {}</div><div class="line"><a name="l01897"></a><span class="lineno"> 1897</span> </div><div class="line"><a name="l01898"></a><span class="lineno"><a class="line" href="structoperations__research_1_1or__internal_1_1TailArrayReleaser.html#a90d82914da1a9f8e547a89a4b39a1ebe"> 1898</a></span>  <span class="keywordtype">void</span> <a class="code" href="structoperations__research_1_1or__internal_1_1TailArrayReleaser.html#a90d82914da1a9f8e547a89a4b39a1ebe">ReleaseTailArray</a>()<span class="keyword"> const </span>{}</div><div class="line"><a name="l01899"></a><span class="lineno"> 1899</span> };</div><div class="line"><a name="l01900"></a><span class="lineno"> 1900</span> </div><div class="line"><a name="l01901"></a><span class="lineno"> 1901</span> <span class="comment">// The TailArrayReleaser for graphs without reverse arcs calls the</span></div><div class="line"><a name="l01902"></a><span class="lineno"> 1902</span> <span class="comment">// appropriate method on the graph from the TailArrayReleaser</span></div><div class="line"><a name="l01903"></a><span class="lineno"> 1903</span> <span class="comment">// constructor.</span></div><div class="line"><a name="l01904"></a><span class="lineno"> 1904</span> <span class="keyword">template</span> <<span class="keyword">typename</span> GraphType></div><div class="line"><a name="l01905"></a><span class="lineno"><a class="line" href="structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4.html"> 1905</a></span> <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1or__internal_1_1TailArrayReleaser.html">TailArrayReleaser</a><GraphType, false> {</div><div class="line"><a name="l01906"></a><span class="lineno"><a class="line" href="structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4.html#ac7bf4bc34a8da9aab008bfdf52d1a9cf"> 1906</a></span>  <span class="keyword">explicit</span> <a class="code" href="structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4.html#ac7bf4bc34a8da9aab008bfdf52d1a9cf">TailArrayReleaser</a>(GraphType* graph) : graph_(graph) {}</div><div class="line"><a name="l01907"></a><span class="lineno"> 1907</span> </div><div class="line"><a name="l01908"></a><span class="lineno"><a class="line" href="structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4.html#a90d82914da1a9f8e547a89a4b39a1ebe"> 1908</a></span>  <span class="keywordtype">void</span> <a class="code" href="structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4.html#a90d82914da1a9f8e547a89a4b39a1ebe">ReleaseTailArray</a>()<span class="keyword"> const </span>{ graph_->ReleaseTailArray(); }</div><div class="line"><a name="l01909"></a><span class="lineno"> 1909</span> </div><div class="line"><a name="l01910"></a><span class="lineno"><a class="line" href="structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4.html#a29714e1125e2707087a39d1d11467d34"> 1910</a></span>  GraphType* <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4.html#a29714e1125e2707087a39d1d11467d34">graph_</a>;</div><div class="line"><a name="l01911"></a><span class="lineno"> 1911</span> };</div><div class="line"><a name="l01912"></a><span class="lineno"> 1912</span> </div><div class="line"><a name="l01913"></a><span class="lineno"> 1913</span> } <span class="comment">// namespace or_internal</span></div><div class="line"><a name="l01914"></a><span class="lineno"> 1914</span> </div><div class="line"><a name="l01915"></a><span class="lineno"> 1915</span> <span class="keyword">template</span> <<span class="keyword">typename</span> GraphType></div><div class="line"><a name="l01916"></a><span class="lineno"><a class="line" href="classoperations__research_1_1TailArrayManager.html"> 1916</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1TailArrayManager.html">TailArrayManager</a> {</div><div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01918"></a><span class="lineno"><a class="line" href="classoperations__research_1_1TailArrayManager.html#a8175cb3b018fe1f6b5910c669f014c76"> 1918</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1TailArrayManager.html#a8175cb3b018fe1f6b5910c669f014c76">TailArrayManager</a>(GraphType* g) : graph_(g) {}</div><div class="line"><a name="l01919"></a><span class="lineno"> 1919</span> </div><div class="line"><a name="l01920"></a><span class="lineno"><a class="line" href="classoperations__research_1_1TailArrayManager.html#a5b9e3e11b5999e1e2265f9f14a824214"> 1920</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1TailArrayManager.html#a5b9e3e11b5999e1e2265f9f14a824214">BuildTailArrayFromAdjacencyListsIfForwardGraph</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l01921"></a><span class="lineno"> 1921</span>  <a class="code" href="structoperations__research_1_1or__internal_1_1TailArrayBuilder.html">or_internal::TailArrayBuilder</a><GraphType,</div><div class="line"><a name="l01922"></a><span class="lineno"> 1922</span>  <a class="code" href="structoperations__research_1_1graph__traits.html">graph_traits<GraphType>::has_reverse_arcs</a>></div><div class="line"><a name="l01923"></a><span class="lineno"> 1923</span>  tail_array_builder(graph_);</div><div class="line"><a name="l01924"></a><span class="lineno"> 1924</span>  <span class="keywordflow">return</span> tail_array_builder.BuildTailArray();</div><div class="line"><a name="l01925"></a><span class="lineno"> 1925</span>  }</div><div class="line"><a name="l01926"></a><span class="lineno"> 1926</span> </div><div class="line"><a name="l01927"></a><span class="lineno"><a class="line" href="classoperations__research_1_1TailArrayManager.html#a930399f60b3c83a155ca86db090655c4"> 1927</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1TailArrayManager.html#a930399f60b3c83a155ca86db090655c4">ReleaseTailArrayIfForwardGraph</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l01928"></a><span class="lineno"> 1928</span>  <a class="code" href="structoperations__research_1_1or__internal_1_1TailArrayReleaser.html">or_internal::TailArrayReleaser</a><GraphType,</div><div class="line"><a name="l01929"></a><span class="lineno"> 1929</span>  <a class="code" href="structoperations__research_1_1graph__traits.html">graph_traits<GraphType>::has_reverse_arcs</a>></div><div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>  tail_array_releaser(graph_);</div><div class="line"><a name="l01931"></a><span class="lineno"> 1931</span>  tail_array_releaser.ReleaseTailArray();</div><div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>  }</div><div class="line"><a name="l01933"></a><span class="lineno"> 1933</span> </div><div class="line"><a name="l01934"></a><span class="lineno"> 1934</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01935"></a><span class="lineno"> 1935</span>  GraphType* graph_;</div><div class="line"><a name="l01936"></a><span class="lineno"> 1936</span> };</div><div class="line"><a name="l01937"></a><span class="lineno"> 1937</span> </div><div class="line"><a name="l01938"></a><span class="lineno"> 1938</span> <span class="keyword">template</span> <<span class="keyword">typename</span> GraphType></div><div class="line"><a name="l01939"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ArcFunctorOrderingByTailAndHead.html"> 1939</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1ArcFunctorOrderingByTailAndHead.html">ArcFunctorOrderingByTailAndHead</a> {</div><div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01941"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ArcFunctorOrderingByTailAndHead.html#abb35cb80d5dd70122c4b741cde50db2e"> 1941</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1ArcFunctorOrderingByTailAndHead.html#abb35cb80d5dd70122c4b741cde50db2e">ArcFunctorOrderingByTailAndHead</a>(<span class="keyword">const</span> GraphType& graph)</div><div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>  : graph_(graph) {}</div><div class="line"><a name="l01943"></a><span class="lineno"> 1943</span> </div><div class="line"><a name="l01944"></a><span class="lineno"><a class="line" href="classoperations__research_1_1ArcFunctorOrderingByTailAndHead.html#a7fc8cebeaaae309b2282772d6cac1888"> 1944</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1ArcFunctorOrderingByTailAndHead.html#a7fc8cebeaaae309b2282772d6cac1888">operator()</a>(<span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">GraphType::ArcIndex</a> a,</div><div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>  <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">GraphType::ArcIndex</a> b)<span class="keyword"> const </span>{</div><div class="line"><a name="l01946"></a><span class="lineno"> 1946</span>  <span class="keywordflow">return</span> ((graph_.Tail(a) < graph_.Tail(b)) ||</div><div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>  ((graph_.Tail(a) == graph_.Tail(b)) &&</div><div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>  (graph_.Head(a) < graph_.Head(b))));</div><div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>  }</div><div class="line"><a name="l01950"></a><span class="lineno"> 1950</span> </div><div class="line"><a name="l01951"></a><span class="lineno"> 1951</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l01952"></a><span class="lineno"> 1952</span>  <span class="keyword">const</span> GraphType& graph_;</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> </div><div class="line"><a name="l01955"></a><span class="lineno"> 1955</span> <span class="keyword">namespace </span>or_internal {</div><div class="line"><a name="l01956"></a><span class="lineno"> 1956</span> </div><div class="line"><a name="l01957"></a><span class="lineno"> 1957</span> <span class="comment">// The GraphBuilderFromArcs class template is not expected to be used</span></div><div class="line"><a name="l01958"></a><span class="lineno"> 1958</span> <span class="comment">// by clients. It is a helper for the AnnotatedGraphBuildManager</span></div><div class="line"><a name="l01959"></a><span class="lineno"> 1959</span> <span class="comment">// template.</span></div><div class="line"><a name="l01960"></a><span class="lineno"> 1960</span> <span class="comment">//</span></div><div class="line"><a name="l01961"></a><span class="lineno"> 1961</span> <span class="comment">// Deletes itself upon returning the graph!</span></div><div class="line"><a name="l01962"></a><span class="lineno"> 1962</span> <span class="keyword">template</span> <<span class="keyword">typename</span> GraphType, <span class="keywordtype">bool</span> is_dynamic></div><div class="line"><a name="l01963"></a><span class="lineno"><a class="line" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html"> 1963</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html">GraphBuilderFromArcs</a> {</div><div class="line"><a name="l01964"></a><span class="lineno"> 1964</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l01965"></a><span class="lineno"><a class="line" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html#adb1320c0f546bf857179bd3756e84646"> 1965</a></span>  <a class="code" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html#adb1320c0f546bf857179bd3756e84646">GraphBuilderFromArcs</a>(<span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">GraphType::NodeIndex</a> max_num_nodes,</div><div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>  <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">GraphType::ArcIndex</a> max_num_arcs,</div><div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>  <span class="keywordtype">bool</span> sort_arcs)</div><div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>  : num_arcs_(0), sort_arcs_(sort_arcs) {</div><div class="line"><a name="l01969"></a><span class="lineno"> 1969</span>  Reserve(max_num_nodes, max_num_arcs);</div><div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>  }</div><div class="line"><a name="l01971"></a><span class="lineno"> 1971</span> </div><div class="line"><a name="l01972"></a><span class="lineno"><a class="line" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html#a4de07ac4885d7183fdb859bd112ad6f1"> 1972</a></span>  <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">GraphType::ArcIndex</a> <a class="code" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html#a4de07ac4885d7183fdb859bd112ad6f1">AddArc</a>(<span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">GraphType::NodeIndex</a> tail,</div><div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>  <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">GraphType::NodeIndex</a> head) {</div><div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>  DCHECK_LT(num_arcs_, max_num_arcs_);</div><div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>  DCHECK_LT(tail, GraphType::kFirstNode + max_num_nodes_);</div><div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>  DCHECK_LT(head, GraphType::kFirstNode + max_num_nodes_);</div><div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>  <span class="keywordflow">if</span> (num_arcs_ < max_num_arcs_ &&</div><div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>  tail < GraphType::kFirstNode + max_num_nodes_ &&</div><div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>  head < GraphType::kFirstNode + max_num_nodes_) {</div><div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>  <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">GraphType::ArcIndex</a> result = GraphType::kFirstArc + num_arcs_;</div><div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>  arcs_.push_back(std::make_pair(tail, head));</div><div class="line"><a name="l01982"></a><span class="lineno"> 1982</span>  num_arcs_ += 1;</div><div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l01984"></a><span class="lineno"> 1984</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>  <span class="comment">// Too many arcs or node index out of bounds!</span></div><div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>  <span class="keywordflow">return</span> GraphType::kNilArc;</div><div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>  }</div><div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>  }</div><div class="line"><a name="l01989"></a><span class="lineno"> 1989</span> </div><div class="line"><a name="l01990"></a><span class="lineno"> 1990</span>  <span class="comment">// Builds the graph from the given arcs.</span></div><div class="line"><a name="l01991"></a><span class="lineno"><a class="line" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html#aea1f600a21e54d8a78df733a4fc2f7f9"> 1991</a></span>  GraphType* <a class="code" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html#aea1f600a21e54d8a78df733a4fc2f7f9">Graph</a>(PermutationCycleHandler<typename GraphType::ArcIndex>*</div><div class="line"><a name="l01992"></a><span class="lineno"> 1992</span>  client_cycle_handler) {</div><div class="line"><a name="l01993"></a><span class="lineno"> 1993</span>  GraphType* graph = <span class="keyword">new</span> GraphType(max_num_nodes_, num_arcs_, sort_arcs_,</div><div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>  &arcs_, client_cycle_handler);</div><div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>  <span class="keyword">delete</span> <span class="keyword">this</span>;</div><div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>  <span class="keywordflow">return</span> graph;</div><div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>  }</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>  <span class="keyword">private</span>:</div><div class="line"><a name="l02000"></a><span class="lineno"> 2000</span>  <span class="keywordtype">bool</span> Reserve(<span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">GraphType::NodeIndex</a> new_max_num_nodes,</div><div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>  <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">GraphType::ArcIndex</a> new_max_num_arcs) {</div><div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>  max_num_nodes_ = new_max_num_nodes;</div><div class="line"><a name="l02003"></a><span class="lineno"> 2003</span>  max_num_arcs_ = new_max_num_arcs;</div><div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>  arcs_.reserve(new_max_num_arcs);</div><div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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> </div><div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>  <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">GraphType::NodeIndex</a> max_num_nodes_;</div><div class="line"><a name="l02009"></a><span class="lineno"> 2009</span>  <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">GraphType::ArcIndex</a> max_num_arcs_;</div><div class="line"><a name="l02010"></a><span class="lineno"> 2010</span>  <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">GraphType::ArcIndex</a> num_arcs_;</div><div class="line"><a name="l02011"></a><span class="lineno"> 2011</span> </div><div class="line"><a name="l02012"></a><span class="lineno"> 2012</span>  std::vector<</div><div class="line"><a name="l02013"></a><span class="lineno"> 2013</span>  std::pair<typename GraphType::NodeIndex, typename GraphType::NodeIndex> ></div><div class="line"><a name="l02014"></a><span class="lineno"> 2014</span>  arcs_;</div><div class="line"><a name="l02015"></a><span class="lineno"> 2015</span> </div><div class="line"><a name="l02016"></a><span class="lineno"> 2016</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> sort_arcs_;</div><div class="line"><a name="l02017"></a><span class="lineno"> 2017</span> };</div><div class="line"><a name="l02018"></a><span class="lineno"> 2018</span> </div><div class="line"><a name="l02019"></a><span class="lineno"> 2019</span> <span class="comment">// Trivial delegating specialization for dynamic graphs.</span></div><div class="line"><a name="l02020"></a><span class="lineno"> 2020</span> <span class="comment">//</span></div><div class="line"><a name="l02021"></a><span class="lineno"> 2021</span> <span class="comment">// Deletes itself upon returning the graph!</span></div><div class="line"><a name="l02022"></a><span class="lineno"> 2022</span> <span class="keyword">template</span> <<span class="keyword">typename</span> GraphType></div><div class="line"><a name="l02023"></a><span class="lineno"><a class="line" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html"> 2023</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html">GraphBuilderFromArcs</a><GraphType, true> {</div><div class="line"><a name="l02024"></a><span class="lineno"> 2024</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l02025"></a><span class="lineno"><a class="line" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html#adb1320c0f546bf857179bd3756e84646"> 2025</a></span>  <a class="code" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html#adb1320c0f546bf857179bd3756e84646">GraphBuilderFromArcs</a>(<span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">GraphType::NodeIndex</a> max_num_nodes,</div><div class="line"><a name="l02026"></a><span class="lineno"> 2026</span>  <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">GraphType::ArcIndex</a> max_num_arcs,</div><div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>  <span class="keywordtype">bool</span> sort_arcs)</div><div class="line"><a name="l02028"></a><span class="lineno"> 2028</span>  : graph_(new GraphType(max_num_nodes, max_num_arcs)),</div><div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>  sort_arcs_(sort_arcs) {}</div><div class="line"><a name="l02030"></a><span class="lineno"> 2030</span> </div><div class="line"><a name="l02031"></a><span class="lineno"><a class="line" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html#a6cc3533e87bd9593b27e81dbe2921e2d"> 2031</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html#a6cc3533e87bd9593b27e81dbe2921e2d">Reserve</a>(<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">GraphType::NodeIndex</a> new_max_num_nodes,</div><div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>  <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">GraphType::ArcIndex</a> new_max_num_arcs) {</div><div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>  <span class="keywordflow">return</span> graph_->Reserve(new_max_num_nodes, new_max_num_arcs);</div><div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>  }</div><div class="line"><a name="l02035"></a><span class="lineno"> 2035</span> </div><div class="line"><a name="l02036"></a><span class="lineno"><a class="line" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html#aceabecf2a86411c8dd599a21cec79aee"> 2036</a></span>  <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">GraphType::ArcIndex</a> <a class="code" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html#aceabecf2a86411c8dd599a21cec79aee">AddArc</a>(</div><div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>  <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">GraphType::NodeIndex</a> tail,</div><div class="line"><a name="l02038"></a><span class="lineno"> 2038</span>  <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">GraphType::NodeIndex</a> head) {</div><div class="line"><a name="l02039"></a><span class="lineno"> 2039</span>  <span class="keywordflow">return</span> graph_->AddArc(tail, head);</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> </div><div class="line"><a name="l02042"></a><span class="lineno"><a class="line" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html#aea1f600a21e54d8a78df733a4fc2f7f9"> 2042</a></span>  GraphType* <a class="code" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html#aea1f600a21e54d8a78df733a4fc2f7f9">Graph</a>(PermutationCycleHandler<typename GraphType::ArcIndex>*</div><div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>  client_cycle_handler) {</div><div class="line"><a name="l02044"></a><span class="lineno"> 2044</span>  <span class="keywordflow">if</span> (sort_arcs_) {</div><div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>  <a class="code" href="classoperations__research_1_1TailArrayManager.html">TailArrayManager<GraphType></a> tail_array_manager(graph_);</div><div class="line"><a name="l02046"></a><span class="lineno"> 2046</span>  tail_array_manager.<a class="code" href="classoperations__research_1_1TailArrayManager.html#a5b9e3e11b5999e1e2265f9f14a824214">BuildTailArrayFromAdjacencyListsIfForwardGraph</a>();</div><div class="line"><a name="l02047"></a><span class="lineno"> 2047</span>  <a class="code" href="classoperations__research_1_1ArcFunctorOrderingByTailAndHead.html">ArcFunctorOrderingByTailAndHead<GraphType></a> arc_ordering(*graph_);</div><div class="line"><a name="l02048"></a><span class="lineno"> 2048</span>  graph_->GroupForwardArcsByFunctor(arc_ordering, client_cycle_handler);</div><div class="line"><a name="l02049"></a><span class="lineno"> 2049</span>  tail_array_manager.<a class="code" href="classoperations__research_1_1TailArrayManager.html#a930399f60b3c83a155ca86db090655c4">ReleaseTailArrayIfForwardGraph</a>();</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>  GraphType* result = graph_;</div><div class="line"><a name="l02052"></a><span class="lineno"> 2052</span>  <span class="keyword">delete</span> <span class="keyword">this</span>;</div><div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l02054"></a><span class="lineno"> 2054</span>  }</div><div class="line"><a name="l02055"></a><span class="lineno"> 2055</span> </div><div class="line"><a name="l02056"></a><span class="lineno"> 2056</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l02057"></a><span class="lineno"> 2057</span>  GraphType* <span class="keyword">const</span> graph_;</div><div class="line"><a name="l02058"></a><span class="lineno"> 2058</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> sort_arcs_;</div><div class="line"><a name="l02059"></a><span class="lineno"> 2059</span> };</div><div class="line"><a name="l02060"></a><span class="lineno"> 2060</span> </div><div class="line"><a name="l02061"></a><span class="lineno"> 2061</span> } <span class="comment">// namespace or_internal</span></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">template</span> <<span class="keyword">typename</span> GraphType></div><div class="line"><a name="l02064"></a><span class="lineno"><a class="line" href="classoperations__research_1_1AnnotatedGraphBuildManager.html"> 2064</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1AnnotatedGraphBuildManager.html">AnnotatedGraphBuildManager</a></div><div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>  : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html">or_internal::GraphBuilderFromArcs</a><</div><div class="line"><a name="l02066"></a><span class="lineno"> 2066</span>  GraphType, graph_traits<GraphType>::is_dynamic> {</div><div class="line"><a name="l02067"></a><span class="lineno"> 2067</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l02068"></a><span class="lineno"><a class="line" href="classoperations__research_1_1AnnotatedGraphBuildManager.html#aebc5e1159128e9da64aa47587cde2ad6"> 2068</a></span>  <a class="code" href="classoperations__research_1_1AnnotatedGraphBuildManager.html#aebc5e1159128e9da64aa47587cde2ad6">AnnotatedGraphBuildManager</a>(<span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">GraphType::NodeIndex</a> num_nodes,</div><div class="line"><a name="l02069"></a><span class="lineno"> 2069</span>  <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">GraphType::ArcIndex</a> num_arcs,</div><div class="line"><a name="l02070"></a><span class="lineno"> 2070</span>  <span class="keywordtype">bool</span> sort_arcs)</div><div class="line"><a name="l02071"></a><span class="lineno"> 2071</span>  : or_internal::<a class="code" href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html#adb1320c0f546bf857179bd3756e84646">GraphBuilderFromArcs</a><GraphType,</div><div class="line"><a name="l02072"></a><span class="lineno"> 2072</span>  <a class="code" href="structoperations__research_1_1graph__traits.html">graph_traits</a><GraphType>::is_dynamic>(</div><div class="line"><a name="l02073"></a><span class="lineno"> 2073</span>  num_nodes, num_arcs, sort_arcs) {}</div><div class="line"><a name="l02074"></a><span class="lineno"> 2074</span> };</div><div class="line"><a name="l02075"></a><span class="lineno"> 2075</span> </div><div class="line"><a name="l02076"></a><span class="lineno"> 2076</span> <span class="comment">// Builds a directed line graph for 'graph' (see "directed line graph" in</span></div><div class="line"><a name="l02077"></a><span class="lineno"> 2077</span> <span class="comment">// http://en.wikipedia.org/wiki/Line_graph). Arcs of the original graph</span></div><div class="line"><a name="l02078"></a><span class="lineno"> 2078</span> <span class="comment">// become nodes and the new graph contains only nodes created from arcs in the</span></div><div class="line"><a name="l02079"></a><span class="lineno"> 2079</span> <span class="comment">// original graph (we use the notation (a->b) for these new nodes); the index</span></div><div class="line"><a name="l02080"></a><span class="lineno"> 2080</span> <span class="comment">// of the node (a->b) in the new graph is exactly the same as the index of the</span></div><div class="line"><a name="l02081"></a><span class="lineno"> 2081</span> <span class="comment">// arc a->b in the original graph.</span></div><div class="line"><a name="l02082"></a><span class="lineno"> 2082</span> <span class="comment">// An arc from node (a->b) to node (c->d) in the new graph is added if and only</span></div><div class="line"><a name="l02083"></a><span class="lineno"> 2083</span> <span class="comment">// if b == c in the original graph.</span></div><div class="line"><a name="l02084"></a><span class="lineno"> 2084</span> <span class="comment">// This method expects that 'line_graph' is an empty graph (it has no nodes</span></div><div class="line"><a name="l02085"></a><span class="lineno"> 2085</span> <span class="comment">// and no arcs).</span></div><div class="line"><a name="l02086"></a><span class="lineno"> 2086</span> <span class="comment">// Returns false on an error.</span></div><div class="line"><a name="l02087"></a><span class="lineno"> 2087</span> <span class="keyword">template</span> <<span class="keyword">typename</span> GraphType></div><div class="line"><a name="l02088"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#acb53c505b8fd29ceb3abdcc7dfd809ce"> 2088</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research.html#acb53c505b8fd29ceb3abdcc7dfd809ce">BuildLineGraph</a>(<span class="keyword">const</span> GraphType& graph, GraphType* <span class="keyword">const</span> line_graph) {</div><div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>  <span class="keywordflow">if</span> (line_graph == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l02090"></a><span class="lineno"> 2090</span>  LOG(DFATAL) << <span class="stringliteral">"line_graph must not be NULL"</span>;</div><div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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>  <span class="keywordflow">if</span> (line_graph->num_nodes() != 0) {</div><div class="line"><a name="l02094"></a><span class="lineno"> 2094</span>  LOG(DFATAL) << <span class="stringliteral">"line_graph must be empty"</span>;</div><div class="line"><a name="l02095"></a><span class="lineno"> 2095</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l02096"></a><span class="lineno"> 2096</span>  }</div><div class="line"><a name="l02097"></a><span class="lineno"> 2097</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> GraphType::ArcIterator ArcIterator;</div><div class="line"><a name="l02098"></a><span class="lineno"> 2098</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> GraphType::OutgoingArcIterator OutgoingArcIterator;</div><div class="line"><a name="l02099"></a><span class="lineno"> 2099</span>  <span class="comment">// Sizing then filling.</span></div><div class="line"><a name="l02100"></a><span class="lineno"> 2100</span>  <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">GraphType::ArcIndex</a> num_arcs = 0;</div><div class="line"><a name="l02101"></a><span class="lineno"> 2101</span>  <span class="keywordflow">for</span> (ArcIterator arc_iterator(graph); arc_iterator.Ok();</div><div class="line"><a name="l02102"></a><span class="lineno"> 2102</span>  arc_iterator.Next()) {</div><div class="line"><a name="l02103"></a><span class="lineno"> 2103</span>  <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">GraphType::ArcIndex</a> arc = arc_iterator.Index();</div><div class="line"><a name="l02104"></a><span class="lineno"> 2104</span>  <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">GraphType::NodeIndex</a> head = graph.Head(arc);</div><div class="line"><a name="l02105"></a><span class="lineno"> 2105</span>  <span class="keywordflow">for</span> (OutgoingArcIterator iterator(graph, head); iterator.Ok();</div><div class="line"><a name="l02106"></a><span class="lineno"> 2106</span>  iterator.Next()) {</div><div class="line"><a name="l02107"></a><span class="lineno"> 2107</span>  ++num_arcs;</div><div class="line"><a name="l02108"></a><span class="lineno"> 2108</span>  }</div><div class="line"><a name="l02109"></a><span class="lineno"> 2109</span>  }</div><div class="line"><a name="l02110"></a><span class="lineno"> 2110</span>  line_graph->Reserve(graph.num_arcs(), num_arcs);</div><div class="line"><a name="l02111"></a><span class="lineno"> 2111</span>  <span class="keywordflow">for</span> (ArcIterator arc_iterator(graph); arc_iterator.Ok();</div><div class="line"><a name="l02112"></a><span class="lineno"> 2112</span>  arc_iterator.Next()) {</div><div class="line"><a name="l02113"></a><span class="lineno"> 2113</span>  <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">GraphType::ArcIndex</a> arc = arc_iterator.Index();</div><div class="line"><a name="l02114"></a><span class="lineno"> 2114</span>  <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">GraphType::NodeIndex</a> head = graph.Head(arc);</div><div class="line"><a name="l02115"></a><span class="lineno"> 2115</span>  <span class="keywordflow">for</span> (OutgoingArcIterator iterator(graph, head); iterator.Ok();</div><div class="line"><a name="l02116"></a><span class="lineno"> 2116</span>  iterator.Next()) {</div><div class="line"><a name="l02117"></a><span class="lineno"> 2117</span>  line_graph->AddArc(arc, iterator.Index());</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="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l02121"></a><span class="lineno"> 2121</span> }</div><div class="line"><a name="l02122"></a><span class="lineno"> 2122</span> </div><div class="line"><a name="l02123"></a><span class="lineno"> 2123</span> } <span class="comment">// namespace operations_research</span></div><div class="line"><a name="l02124"></a><span class="lineno"> 2124</span> <span class="preprocessor">#endif // OR_TOOLS_GRAPH_EBERT_GRAPH_H_</span></div><div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_html_a6310ea59fd0f4f0f5de8671c87134fd9"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph.html#a6310ea59fd0f4f0f5de8671c87134fd9">operations_research::ForwardStaticGraph::ReleaseTailArray</a></div><div class="ttdeci">void ReleaseTailArray()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00844">ebert_graph.h:844</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1NodeIterator_html_a659a293dd51073a1b9560bb80f687705"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html#a659a293dd51073a1b9560bb80f687705">operations_research::StarGraphBase::NodeIterator::Next</a></div><div class="ttdeci">void Next()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00329">ebert_graph.h:329</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_ae7eaa58346f9d7415c11776d7a9dd2ed"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#ae7eaa58346f9d7415c11776d7a9dd2ed">operations_research::StarGraphBase::NextNode</a></div><div class="ttdeci">NodeIndexType NextNode(const NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00458">ebert_graph.h:458</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_abfdc255fd93491a9a8ac563a412f57e3"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#abfdc255fd93491a9a8ac563a412f57e3">operations_research::StarGraphBase::StartNode</a></div><div class="ttdeci">NodeIndexType StartNode(NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00439">ebert_graph.h:439</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs_html_a2bc2fad88b93b8470cb35a662772f6da"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#a2bc2fad88b93b8470cb35a662772f6da">operations_research::EbertGraphBase::CycleHandlerForAnnotatedArcs::~CycleHandlerForAnnotatedArcs</a></div><div class="ttdeci">~CycleHandlerForAnnotatedArcs() override</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01095">ebert_graph.h:1095</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_html_a553e5eeb2887a1d7663e1200b7466e6c"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">operations_research::ForwardStaticGraph::CheckArcValidity</a></div><div class="ttdeci">bool CheckArcValidity(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00778">ebert_graph.h:778</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_a4bdbd200e31110f301a3fed9abf15626"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#a4bdbd200e31110f301a3fed9abf15626">operations_research::EbertGraph::IsIncoming</a></div><div class="ttdeci">bool IsIncoming(ArcIndexType arc, NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01435">ebert_graph.h:1435</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_html_adf0cfc6d2bc79267111a8d38a1f6ffea"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph.html#adf0cfc6d2bc79267111a8d38a1f6ffea">operations_research::ForwardStaticGraph::TailArrayComplete</a></div><div class="ttdeci">bool TailArrayComplete() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00847">ebert_graph.h:847</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator_html_aaa9894d557b5df8ca4d93d8701fc2f28"><div class="ttname"><a href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#aaa9894d557b5df8ca4d93d8701fc2f28">operations_research::EbertGraph::IncomingArcIterator::IncomingArcIterator</a></div><div class="ttdeci">IncomingArcIterator(const EbertGraph &graph, NodeIndexType node)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01300">ebert_graph.h:1300</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_adb3250cf217e042d99de43a4e22a9360"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#adb3250cf217e042d99de43a4e22a9360">operations_research::StarGraphBase::max_end_node_index</a></div><div class="ttdeci">NodeIndexType max_end_node_index() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00264">ebert_graph.h:264</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1TailArrayManager_html_a930399f60b3c83a155ca86db090655c4"><div class="ttname"><a href="classoperations__research_1_1TailArrayManager.html#a930399f60b3c83a155ca86db090655c4">operations_research::TailArrayManager::ReleaseTailArrayIfForwardGraph</a></div><div class="ttdeci">void ReleaseTailArrayIfForwardGraph() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01927">ebert_graph.h:1927</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardEbertGraph_html_ac6532804a8bcf9ca89e41b0e3139d5fb"><div class="ttname"><a href="classoperations__research_1_1ForwardEbertGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">operations_research::ForwardEbertGraph::CheckArcBounds</a></div><div class="ttdeci">bool CheckArcBounds(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01612">ebert_graph.h:1612</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_afd99777b09af9bfb951f88dbb93e11e7"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#afd99777b09af9bfb951f88dbb93e11e7">operations_research::StarGraphBase::LookUpArc</a></div><div class="ttdeci">ArcIndexType LookUpArc(const NodeIndexType tail, const NodeIndexType head) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00285">ebert_graph.h:285</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1AnnotatedGraphBuildManager_html_aebc5e1159128e9da64aa47587cde2ad6"><div class="ttname"><a href="classoperations__research_1_1AnnotatedGraphBuildManager.html#aebc5e1159128e9da64aa47587cde2ad6">operations_research::AnnotatedGraphBuildManager::AnnotatedGraphBuildManager</a></div><div class="ttdeci">AnnotatedGraphBuildManager(typename GraphType::NodeIndex num_nodes, typename GraphType::ArcIndex num_arcs, bool sort_arcs)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l02068">ebert_graph.h:2068</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardEbertGraph_html_a408829a652c1c14c0dc1245fc396820f"><div class="ttname"><a href="classoperations__research_1_1ForwardEbertGraph.html#a408829a652c1c14c0dc1245fc396820f">operations_research::ForwardEbertGraph::ForwardEbertGraph</a></div><div class="ttdeci">ForwardEbertGraph()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01601">ebert_graph.h:1601</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a2b88b717e42d7137a884c36e35052191"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a2b88b717e42d7137a884c36e35052191">operations_research::StarGraphBase::IsNodeValid</a></div><div class="ttdeci">bool IsNodeValid(NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00279">ebert_graph.h:279</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs_html_ab8c76fdd7493de9946f7551ed3ca16bc"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html#ab8c76fdd7493de9946f7551ed3ca16bc">operations_research::ForwardStaticGraph::CycleHandlerForAnnotatedArcs::SetIndexFromTemp</a></div><div class="ttdeci">void SetIndexFromTemp(ArcIndexType destination) const override</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00592">ebert_graph.h:592</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_ab059bfdc4854ebf3ffa22cc778a436c3"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#ab059bfdc4854ebf3ffa22cc778a436c3">operations_research::StarGraphBase::max_num_nodes_</a></div><div class="ttdeci">NodeIndexType max_num_nodes_</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00486">ebert_graph.h:486</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs_html_a98dbfe5b691e0943198565a525d17886"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#a98dbfe5b691e0943198565a525d17886">operations_research::EbertGraphBase::CycleHandlerForAnnotatedArcs::CycleHandlerForAnnotatedArcs</a></div><div class="ttdeci">CycleHandlerForAnnotatedArcs(PermutationCycleHandler< ArcIndexType > *annotation_handler, DerivedGraph *graph)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01050">ebert_graph.h:1050</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a4d3fc55a2fe209a908470199437cec9a"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a4d3fc55a2fe209a908470199437cec9a">operations_research::StarGraphBase::num_arcs</a></div><div class="ttdeci">ArcIndexType num_arcs() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00241">ebert_graph.h:241</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardEbertGraph_html_a6310ea59fd0f4f0f5de8671c87134fd9"><div class="ttname"><a href="classoperations__research_1_1ForwardEbertGraph.html#a6310ea59fd0f4f0f5de8671c87134fd9">operations_research::ForwardEbertGraph::ReleaseTailArray</a></div><div class="ttdeci">void ReleaseTailArray()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01684">ebert_graph.h:1684</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_a91ea251fe7caa0122a01f738892dd03b"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#a91ea251fe7caa0122a01f738892dd03b">operations_research::EbertGraphBase::Initialize</a></div><div class="ttdeci">void Initialize(NodeIndexType max_num_nodes, ArcIndexType max_num_arcs)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01112">ebert_graph.h:1112</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_aab3a7c235c6a6000a25a5a79d680f1ba"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">operations_research::StarGraphBase::kNilArc</a></div><div class="ttdeci">static const ArcIndexType kNilArc</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00219">ebert_graph.h:219</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a58b521f62562f51a79f9c95f1902804a"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a58b521f62562f51a79f9c95f1902804a">operations_research::StarGraphBase::first_incident_arc_</a></div><div class="ttdeci">ZVector< ArcIndexType > first_incident_arc_</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00502">ebert_graph.h:502</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator_html_adac23a27a3389aea80f75741569afe35"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#adac23a27a3389aea80f75741569afe35">operations_research::StarGraphBase::OutgoingArcIterator::Index</a></div><div class="ttdeci">ArcIndexType Index() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00402">ebert_graph.h:402</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html">operations_research::EbertGraphBase</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00948">ebert_graph.h:948</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardEbertGraph_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="classoperations__research_1_1ForwardEbertGraph.html#a764be64f3029f8b8e23511061d8de355">operations_research::ForwardEbertGraph::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01698">ebert_graph.h:1698</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_acaaf3f4354888c162f6c562f0bd2ae2b"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">operations_research::StarGraphBase::kFirstNode</a></div><div class="ttdeci">static const NodeIndexType kFirstNode</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00222">ebert_graph.h:222</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_html_aae684b1eb132c8c201f437d88e367b55"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph.html#aae684b1eb132c8c201f437d88e367b55">operations_research::ForwardStaticGraph::Tail</a></div><div class="ttdeci">NodeIndexType Tail(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00756">ebert_graph.h:756</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#a764be64f3029f8b8e23511061d8de355">operations_research::EbertGraph::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01458">ebert_graph.h:1458</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_a05ceae7fb550b3f3728c9c56ed4729d6"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#a05ceae7fb550b3f3728c9c56ed4729d6">operations_research::EbertGraph::IsDirect</a></div><div class="ttdeci">bool IsDirect(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01417">ebert_graph.h:1417</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardEbertGraph_html_a553e5eeb2887a1d7663e1200b7466e6c"><div class="ttname"><a href="classoperations__research_1_1ForwardEbertGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">operations_research::ForwardEbertGraph::CheckArcValidity</a></div><div class="ttdeci">bool CheckArcValidity(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01620">ebert_graph.h:1620</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_a782ee113d75db4336845c90858a110ce"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#a782ee113d75db4336845c90858a110ce">operations_research::EbertGraph::IsReverse</a></div><div class="ttdeci">bool IsReverse(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01423">ebert_graph.h:1423</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4_html_ae13ccc497c6bd89aabe9b7f03b2a91b8"><div class="ttname"><a href="structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4.html#ae13ccc497c6bd89aabe9b7f03b2a91b8">operations_research::or_internal::TailArrayBuilder< GraphType, false >::TailArrayBuilder</a></div><div class="ttdeci">TailArrayBuilder(GraphType *graph)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01883">ebert_graph.h:1883</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4_html_a29714e1125e2707087a39d1d11467d34"><div class="ttname"><a href="structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4.html#a29714e1125e2707087a39d1d11467d34">operations_research::or_internal::TailArrayBuilder< GraphType, false >::graph_</a></div><div class="ttdeci">GraphType *const graph_</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01887">ebert_graph.h:1887</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ArcFunctorOrderingByTailAndHead_html_a7fc8cebeaaae309b2282772d6cac1888"><div class="ttname"><a href="classoperations__research_1_1ArcFunctorOrderingByTailAndHead.html#a7fc8cebeaaae309b2282772d6cac1888">operations_research::ArcFunctorOrderingByTailAndHead::operator()</a></div><div class="ttdeci">bool operator()(typename GraphType::ArcIndex a, typename GraphType::ArcIndex b) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01944">ebert_graph.h:1944</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_a04c9ae002dae9ce9a47d37156a6d0c88"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#a04c9ae002dae9ce9a47d37156a6d0c88">operations_research::EbertGraphBase::EbertGraphBase</a></div><div class="ttdeci">EbertGraphBase()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01108">ebert_graph.h:1108</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_ad90a9fc7d16bb2c98a088a4162bbbc9d"><div class="ttname"><a href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">operations_research::ArcIndex</a></div><div class="ttdeci">int32 ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00201">ebert_graph.h:201</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_a7b505ba4a01bce342d049f5a8674da72"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#a7b505ba4a01bce342d049f5a8674da72">operations_research::EbertGraphBase::AddArc</a></div><div class="ttdeci">ArcIndexType AddArc(NodeIndexType tail, NodeIndexType head)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01001">ebert_graph.h:1001</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_html_ac6532804a8bcf9ca89e41b0e3139d5fb"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">operations_research::ForwardStaticGraph::CheckArcBounds</a></div><div class="ttdeci">bool CheckArcBounds(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00770">ebert_graph.h:770</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator_html_a9161ace1ff0d056c1895c2cab31b308c"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#a9161ace1ff0d056c1895c2cab31b308c">operations_research::StarGraphBase::OutgoingArcIterator::operator=</a></div><div class="ttdeci">void operator=(const OutgoingArcIterator &iterator)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00386">ebert_graph.h:386</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a3a725c1fd4db4e67a7f13b36652e0fa8"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">operations_research::StarGraphBase::max_num_arcs_</a></div><div class="ttdeci">ArcIndexType max_num_arcs_</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00489">ebert_graph.h:489</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_acaaf3f4354888c162f6c562f0bd2ae2b"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#acaaf3f4354888c162f6c562f0bd2ae2b">operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, EbertGraph< NodeIndexType, ArcIndexType > >::kFirstNode</a></div><div class="ttdeci">static const NodeIndexType kFirstNode</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00222">ebert_graph.h:222</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4_html_a90d82914da1a9f8e547a89a4b39a1ebe"><div class="ttname"><a href="structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4.html#a90d82914da1a9f8e547a89a4b39a1ebe">operations_research::or_internal::TailArrayReleaser< GraphType, false >::ReleaseTailArray</a></div><div class="ttdeci">void ReleaseTailArray() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01908">ebert_graph.h:1908</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_aae684b1eb132c8c201f437d88e367b55"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#aae684b1eb132c8c201f437d88e367b55">operations_research::EbertGraph::Tail</a></div><div class="ttdeci">NodeIndexType Tail(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01376">ebert_graph.h:1376</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1AnnotatedGraphBuildManager_html"><div class="ttname"><a href="classoperations__research_1_1AnnotatedGraphBuildManager.html">operations_research::AnnotatedGraphBuildManager</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l02064">ebert_graph.h:2064</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4_html_aceabecf2a86411c8dd599a21cec79aee"><div class="ttname"><a href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html#aceabecf2a86411c8dd599a21cec79aee">operations_research::or_internal::GraphBuilderFromArcs< GraphType, true >::AddArc</a></div><div class="ttdeci">GraphType::ArcIndex AddArc(const typename GraphType::NodeIndex tail, const typename GraphType::NodeIndex head)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l02036">ebert_graph.h:2036</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs_html_a2fd5ecc6414d07e3456e96c0d665ae9b"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#a2fd5ecc6414d07e3456e96c0d665ae9b">operations_research::EbertGraphBase::CycleHandlerForAnnotatedArcs::SetIndexFromIndex</a></div><div class="ttdeci">void SetIndexFromIndex(ArcIndexType source, ArcIndexType destination) const override</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01066">ebert_graph.h:1066</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_html_a53ee05de8f3dd5145b9c0a5ef903a399"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph.html#a53ee05de8f3dd5145b9c0a5ef903a399">operations_research::ForwardStaticGraph::BuildTailArray</a></div><div class="ttdeci">bool BuildTailArray()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00816">ebert_graph.h:816</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_a2b88b717e42d7137a884c36e35052191"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#a2b88b717e42d7137a884c36e35052191">operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, EbertGraph< NodeIndexType, ArcIndexType > >::IsNodeValid</a></div><div class="ttdeci">bool IsNodeValid(NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00279">ebert_graph.h:279</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_aad16076f9d10c90b9b9e0ccfddf878ed"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#aad16076f9d10c90b9b9e0ccfddf878ed">operations_research::StarGraphBase::max_end_arc_index</a></div><div class="ttdeci">ArcIndexType max_end_arc_index() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00271">ebert_graph.h:271</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4_html_a6cc3533e87bd9593b27e81dbe2921e2d"><div class="ttname"><a href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html#a6cc3533e87bd9593b27e81dbe2921e2d">operations_research::or_internal::GraphBuilderFromArcs< GraphType, true >::Reserve</a></div><div class="ttdeci">bool Reserve(const typename GraphType::NodeIndex new_max_num_nodes, const typename GraphType::ArcIndex new_max_num_arcs)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l02031">ebert_graph.h:2031</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator_html_a659a293dd51073a1b9560bb80f687705"><div class="ttname"><a href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#a659a293dd51073a1b9560bb80f687705">operations_research::EbertGraph::IncomingArcIterator::Next</a></div><div class="ttdeci">void Next()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01329">ebert_graph.h:1329</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_a58b521f62562f51a79f9c95f1902804a"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#a58b521f62562f51a79f9c95f1902804a">operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, EbertGraph< NodeIndexType, ArcIndexType > >::first_incident_arc_</a></div><div class="ttdeci">ZVector< ArcIndexType > first_incident_arc_</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00502">ebert_graph.h:502</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardEbertGraph_html_a4bdbd200e31110f301a3fed9abf15626"><div class="ttname"><a href="classoperations__research_1_1ForwardEbertGraph.html#a4bdbd200e31110f301a3fed9abf15626">operations_research::ForwardEbertGraph::IsIncoming</a></div><div class="ttdeci">bool IsIncoming(ArcIndexType arc, NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01638">ebert_graph.h:1638</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator_html_adac23a27a3389aea80f75741569afe35"><div class="ttname"><a href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#adac23a27a3389aea80f75741569afe35">operations_research::EbertGraph::OutgoingOrOppositeIncomingArcIterator::Index</a></div><div class="ttdeci">ArcIndexType Index() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01275">ebert_graph.h:1275</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_ab059bfdc4854ebf3ffa22cc778a436c3"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#ab059bfdc4854ebf3ffa22cc778a436c3">operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, EbertGraph< NodeIndexType, ArcIndexType > >::max_num_nodes_</a></div><div class="ttdeci">NodeIndexType max_num_nodes_</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00486">ebert_graph.h:486</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_html_a6e87f7e1d0b9600ad5aa56a4fd2a8dd3"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph.html#a6e87f7e1d0b9600ad5aa56a4fd2a8dd3">operations_research::ForwardStaticGraph::ForwardStaticGraph</a></div><div class="ttdeci">ForwardStaticGraph(const NodeIndexType num_nodes, const ArcIndexType num_arcs, const bool sort_arcs_by_head, std::vector< std::pair< NodeIndexType, NodeIndexType > > *client_input_arcs, operations_research::PermutationCycleHandler< ArcIndexType > *const client_cycle_handler)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00621">ebert_graph.h:621</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1ArcIterator_html_aa7e07ffe21ad6b4c71a0d22c65f30347"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347">operations_research::StarGraphBase::ArcIterator::Ok</a></div><div class="ttdeci">bool Ok() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00349">ebert_graph.h:349</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_a707eda1519f71617e80ebacaab4d4e25"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#a707eda1519f71617e80ebacaab4d4e25">operations_research::EbertGraph::IsOutgoing</a></div><div class="ttdeci">bool IsOutgoing(ArcIndexType arc, NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01440">ebert_graph.h:1440</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_ab161c9ccc8667340cc3dc656d490f260"><div class="ttname"><a href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">operations_research::FlowQuantity</a></div><div class="ttdeci">int64 FlowQuantity</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00202">ebert_graph.h:202</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a8b9175b7d6fd63f5ae764a7ea44d13e0"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a8b9175b7d6fd63f5ae764a7ea44d13e0">operations_research::StarGraphBase::end_arc_index</a></div><div class="ttdeci">ArcIndexType end_arc_index() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00252">ebert_graph.h:252</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_a7f3e3ed5cf6c2c8668068a997dd7c95e"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#a7f3e3ed5cf6c2c8668068a997dd7c95e">operations_research::EbertGraph::ReverseArc</a></div><div class="ttdeci">ArcIndexType ReverseArc(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01402">ebert_graph.h:1402</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1NodeIterator_html_a6576678b506bfba6711ae32c3f87beb4"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html#a6576678b506bfba6711ae32c3f87beb4">operations_research::StarGraphBase::NodeIterator::NodeIterator</a></div><div class="ttdeci">NodeIterator(const DerivedGraph &graph)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00322">ebert_graph.h:322</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1NodeIterator_html_aa7e07ffe21ad6b4c71a0d22c65f30347"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347">operations_research::StarGraphBase::NodeIterator::Ok</a></div><div class="ttdeci">bool Ok() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00326">ebert_graph.h:326</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_a3fe1b105925a29cd63741e6dc85cfe45"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#a3fe1b105925a29cd63741e6dc85cfe45">operations_research::EbertGraph::BuildRepresentation</a></div><div class="ttdeci">void BuildRepresentation()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01448">ebert_graph.h:1448</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_aa55bab68a7d29e6fdaf4bb82b16374ba"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#aa55bab68a7d29e6fdaf4bb82b16374ba">operations_research::EbertGraph::DirectArc</a></div><div class="ttdeci">ArcIndexType DirectArc(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01396">ebert_graph.h:1396</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1NodeIterator_html"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html">operations_research::StarGraphBase::NodeIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00320">ebert_graph.h:320</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator_html"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html">operations_research::StarGraphBase::OutgoingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00366">ebert_graph.h:366</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_a0da78a7e517acf1b646ae28ad16216ed"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, EbertGraph< NodeIndexType, ArcIndexType > >::kNilNode</a></div><div class="ttdeci">static const NodeIndexType kNilNode</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00216">ebert_graph.h:216</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a5d6f4ad584d8fae3c29633c75138b177"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a5d6f4ad584d8fae3c29633c75138b177">operations_research::StarGraphBase::kMaxNumArcs</a></div><div class="ttdeci">static const ArcIndexType kMaxNumArcs</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00235">ebert_graph.h:235</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4_html_adb1320c0f546bf857179bd3756e84646"><div class="ttname"><a href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html#adb1320c0f546bf857179bd3756e84646">operations_research::or_internal::GraphBuilderFromArcs< GraphType, true >::GraphBuilderFromArcs</a></div><div class="ttdeci">GraphBuilderFromArcs(typename GraphType::NodeIndex max_num_nodes, typename GraphType::ArcIndex max_num_arcs, bool sort_arcs)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l02025">ebert_graph.h:2025</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_html_a6a53939b18e4b76d6f6ff9274c23b81b"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph.html#a6a53939b18e4b76d6f6ff9274c23b81b">operations_research::ForwardStaticGraph::NextOutgoingArc</a></div><div class="ttdeci">ArcIndexType NextOutgoingArc(const NodeIndexType node, ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00788">ebert_graph.h:788</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator_html_a65a5e101f3d99772be31f3ab1aaed235"><div class="ttname"><a href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#a65a5e101f3d99772be31f3ab1aaed235">operations_research::EbertGraph::IncomingArcIterator::IncomingArcIterator</a></div><div class="ttdeci">IncomingArcIterator(const EbertGraph &graph, NodeIndexType node, ArcIndexType arc)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01309">ebert_graph.h:1309</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_aaf8c9d2900d5470a2b2fd229b6314f1e"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#aaf8c9d2900d5470a2b2fd229b6314f1e">operations_research::EbertGraph::EbertGraph</a></div><div class="ttdeci">EbertGraph(NodeIndexType max_num_nodes, ArcIndexType max_num_arcs)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01228">ebert_graph.h:1228</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardEbertGraph_html_ad800188c6e863c051d5dd24583cfc8ec"><div class="ttname"><a href="classoperations__research_1_1ForwardEbertGraph.html#ad800188c6e863c051d5dd24583cfc8ec">operations_research::ForwardEbertGraph::~ForwardEbertGraph</a></div><div class="ttdeci">~ForwardEbertGraph()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01607">ebert_graph.h:1607</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_html_a92531459eff09455cfa63976f5024906"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph.html#a92531459eff09455cfa63976f5024906">operations_research::ForwardStaticGraph::ArcIndex</a></div><div class="ttdeci">ArcIndexType ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00565">ebert_graph.h:565</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ArcFunctorOrderingByTailAndHead_html"><div class="ttname"><a href="classoperations__research_1_1ArcFunctorOrderingByTailAndHead.html">operations_research::ArcFunctorOrderingByTailAndHead</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01939">ebert_graph.h:1939</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs_html_a999f9e59b55e3f184efa317522f2eeb0"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html#a999f9e59b55e3f184efa317522f2eeb0">operations_research::ForwardStaticGraph::CycleHandlerForAnnotatedArcs::SetTempFromIndex</a></div><div class="ttdeci">void SetTempFromIndex(ArcIndexType source) override</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00581">ebert_graph.h:581</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_html_a6832ebe70da89cb9d2efea26a823d204"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph.html#a6832ebe70da89cb9d2efea26a823d204">operations_research::ForwardStaticGraph::CheckTailIndexValidity</a></div><div class="ttdeci">bool CheckTailIndexValidity(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00783">ebert_graph.h:783</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a4ca086e8da7abeb3cff7ebcfb305719f"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a4ca086e8da7abeb3cff7ebcfb305719f">operations_research::StarGraphBase::~StarGraphBase</a></div><div class="ttdeci">~StarGraphBase()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00434">ebert_graph.h:434</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator_html"><div class="ttname"><a href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html">operations_research::EbertGraph::IncomingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01298">ebert_graph.h:1298</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_a29986e86c1ff5503dd5f162787ae2958"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#a29986e86c1ff5503dd5f162787ae2958">operations_research::EbertGraphBase::~EbertGraphBase</a></div><div class="ttdeci">~EbertGraphBase()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01110">ebert_graph.h:1110</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4_html_ac7bf4bc34a8da9aab008bfdf52d1a9cf"><div class="ttname"><a href="structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4.html#ac7bf4bc34a8da9aab008bfdf52d1a9cf">operations_research::or_internal::TailArrayReleaser< GraphType, false >::TailArrayReleaser</a></div><div class="ttdeci">TailArrayReleaser(GraphType *graph)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01906">ebert_graph.h:1906</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator_html_ae30477c6e9f2a945e1327ee443bf81be"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#ae30477c6e9f2a945e1327ee443bf81be">operations_research::StarGraphBase::OutgoingArcIterator::OutgoingArcIterator</a></div><div class="ttdeci">OutgoingArcIterator(const DerivedGraph &graph, NodeIndexType node)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00368">ebert_graph.h:368</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_a7844e39f2b6fad9b6a59468d63b6b503"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#a7844e39f2b6fad9b6a59468d63b6b503">operations_research::EbertGraphBase::representation_clean_</a></div><div class="ttdeci">bool representation_clean_</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01152">ebert_graph.h:1152</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator_html_a529227be5b4b47f773ceedf31a791fd5"><div class="ttname"><a href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#a529227be5b4b47f773ceedf31a791fd5">operations_research::EbertGraph::OutgoingOrOppositeIncomingArcIterator::OutgoingOrOppositeIncomingArcIterator</a></div><div class="ttdeci">OutgoingOrOppositeIncomingArcIterator(const EbertGraph &graph, NodeIndexType node, ArcIndexType arc)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01250">ebert_graph.h:1250</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a03fc0981d2d99da114ccd8b3abc0c6e1"><div class="ttname"><a href="namespaceoperations__research.html#a03fc0981d2d99da114ccd8b3abc0c6e1">operations_research::QuantityArray</a></div><div class="ttdeci">ZVector< FlowQuantity > QuantityArray</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00209">ebert_graph.h:209</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a29774a2f068745000e90eaf549543144"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a29774a2f068745000e90eaf549543144">operations_research::StarGraphBase::max_num_nodes</a></div><div class="ttdeci">NodeIndexType max_num_nodes() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00255">ebert_graph.h:255</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1or__internal_1_1TailArrayBuilder_html_a8ec6007e04b88bc7ffd141c30faaa898"><div class="ttname"><a href="structoperations__research_1_1or__internal_1_1TailArrayBuilder.html#a8ec6007e04b88bc7ffd141c30faaa898">operations_research::or_internal::TailArrayBuilder::TailArrayBuilder</a></div><div class="ttdeci">TailArrayBuilder(GraphType *unused_graph)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01873">ebert_graph.h:1873</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_a1dbcd0459821908cb2e7719a6e7e32bf"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#a1dbcd0459821908cb2e7719a6e7e32bf">operations_research::EbertGraphBase::next_adjacent_arc_</a></div><div class="ttdeci">ZVector< ArcIndexType > next_adjacent_arc_</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01147">ebert_graph.h:1147</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_aa7eb01c1d6e53fc3eb906761eb69734a"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#aa7eb01c1d6e53fc3eb906761eb69734a">operations_research::EbertGraphBase::FirstOutgoingOrOppositeIncomingArc</a></div><div class="ttdeci">ArcIndexType FirstOutgoingOrOppositeIncomingArc(const NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01123">ebert_graph.h:1123</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1ArcIterator_html"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html">operations_research::StarGraphBase::ArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00343">ebert_graph.h:343</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1or__internal_1_1TailArrayReleaser_html"><div class="ttname"><a href="structoperations__research_1_1or__internal_1_1TailArrayReleaser.html">operations_research::or_internal::TailArrayReleaser</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01895">ebert_graph.h:1895</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_afc2f0055a1b672fbd6102d0d9a3b8c28"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#afc2f0055a1b672fbd6102d0d9a3b8c28">operations_research::StarGraphBase::StartArc</a></div><div class="ttdeci">ArcIndexType StartArc(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00445">ebert_graph.h:445</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1or__internal_1_1TailArrayReleaser_html_ad876770c3b79906872847d8a77115931"><div class="ttname"><a href="structoperations__research_1_1or__internal_1_1TailArrayReleaser.html#ad876770c3b79906872847d8a77115931">operations_research::or_internal::TailArrayReleaser::TailArrayReleaser</a></div><div class="ttdeci">TailArrayReleaser(GraphType *unused_graph)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01896">ebert_graph.h:1896</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_aa90da96a03365b61ef1bbb6167b49837"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#aa90da96a03365b61ef1bbb6167b49837">operations_research::EbertGraphBase::GroupForwardArcsByFunctor</a></div><div class="ttdeci">void GroupForwardArcsByFunctor(const ArcIndexTypeStrictWeakOrderingFunctor &compare, PermutationCycleHandler< ArcIndexType > *annotation_handler)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01022">ebert_graph.h:1022</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_acb53c505b8fd29ceb3abdcc7dfd809ce"><div class="ttname"><a href="namespaceoperations__research.html#acb53c505b8fd29ceb3abdcc7dfd809ce">operations_research::BuildLineGraph</a></div><div class="ttdeci">bool BuildLineGraph(const GraphType &graph, GraphType *const line_graph)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l02088">ebert_graph.h:2088</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs_html_a3764aae97c7333c95ea9f99a176e98df"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html#a3764aae97c7333c95ea9f99a176e98df">operations_research::ForwardStaticGraph::CycleHandlerForAnnotatedArcs::CycleHandlerForAnnotatedArcs</a></div><div class="ttdeci">CycleHandlerForAnnotatedArcs(PermutationCycleHandler< ArcIndexType > *annotation_handler, NodeIndexType *data)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00575">ebert_graph.h:575</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_acbdd6fd1484828a3d5e809c551ba8cf7"><div class="ttname"><a href="namespaceoperations__research.html#acbdd6fd1484828a3d5e809c551ba8cf7">operations_research::CostArray</a></div><div class="ttdeci">ZVector< CostValue > CostArray</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00210">ebert_graph.h:210</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a026ab0f83bfbeba2607959633753ff2e"><div class="ttname"><a href="namespaceoperations__research.html#a026ab0f83bfbeba2607959633753ff2e">operations_research::CostValue</a></div><div class="ttdeci">int64 CostValue</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00203">ebert_graph.h:203</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4_html_a1ab05b86b5f9b013291f26847b626bc8"><div class="ttname"><a href="structoperations__research_1_1or__internal_1_1TailArrayBuilder_3_01GraphType_00_01false_01_4.html#a1ab05b86b5f9b013291f26847b626bc8">operations_research::or_internal::TailArrayBuilder< GraphType, false >::BuildTailArray</a></div><div class="ttdeci">bool BuildTailArray() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01885">ebert_graph.h:1885</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs_html"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html">operations_research::EbertGraphBase::CycleHandlerForAnnotatedArcs</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01047">ebert_graph.h:1047</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_a9e04004960ec7ac63f9ce9b97aa0bcfa"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, EbertGraph< NodeIndexType, ArcIndexType > >::num_nodes_</a></div><div class="ttdeci">NodeIndexType num_nodes_</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00492">ebert_graph.h:492</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_a63560dd4eca6ee672701a59d42c67cbd"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#a63560dd4eca6ee672701a59d42c67cbd">operations_research::EbertGraphBase::Reserve</a></div><div class="ttdeci">bool Reserve(NodeIndexType new_max_num_nodes, ArcIndexType new_max_num_arcs)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00978">ebert_graph.h:978</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs_html_ab8c76fdd7493de9946f7551ed3ca16bc"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#ab8c76fdd7493de9946f7551ed3ca16bc">operations_research::EbertGraphBase::CycleHandlerForAnnotatedArcs::SetIndexFromTemp</a></div><div class="ttdeci">void SetIndexFromTemp(ArcIndexType destination) const override</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01075">ebert_graph.h:1075</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_html_aec05ff3d270a5f888e1623c2a99ff2aa"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph.html#aec05ff3d270a5f888e1623c2a99ff2aa">operations_research::ForwardStaticGraph::NodeIndex</a></div><div class="ttdeci">NodeIndexType NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00564">ebert_graph.h:564</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_a4e27d3270223638ed3a6b9448a71475b"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#a4e27d3270223638ed3a6b9448a71475b">operations_research::EbertGraphBase::NextOutgoingArc</a></div><div class="ttdeci">ArcIndexType NextOutgoingArc(const NodeIndexType unused_node, const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01138">ebert_graph.h:1138</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1ArcIterator_html_adac23a27a3389aea80f75741569afe35"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html#adac23a27a3389aea80f75741569afe35">operations_research::StarGraphBase::ArcIterator::Index</a></div><div class="ttdeci">ArcIndexType Index() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00355">ebert_graph.h:355</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1graph__traits_html"><div class="ttname"><a href="structoperations__research_1_1graph__traits.html">operations_research::graph_traits</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01848">ebert_graph.h:1848</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1or__internal_1_1TailArrayBuilder_html"><div class="ttname"><a href="structoperations__research_1_1or__internal_1_1TailArrayBuilder.html">operations_research::or_internal::TailArrayBuilder</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01872">ebert_graph.h:1872</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs_html_a999f9e59b55e3f184efa317522f2eeb0"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#a999f9e59b55e3f184efa317522f2eeb0">operations_research::EbertGraphBase::CycleHandlerForAnnotatedArcs::SetTempFromIndex</a></div><div class="ttdeci">void SetTempFromIndex(ArcIndexType source) override</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01058">ebert_graph.h:1058</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_a881fc80aead9398df4fbcb6e40903c9a"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, EbertGraph< NodeIndexType, ArcIndexType > >::head_</a></div><div class="ttdeci">ZVector< NodeIndexType > head_</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00498">ebert_graph.h:498</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1NodeIterator_html_a7b78af4fdec0e25f2d56225912f888e6"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1NodeIterator.html#a7b78af4fdec0e25f2d56225912f888e6">operations_research::StarGraphBase::NodeIterator::Index</a></div><div class="ttdeci">NodeIndexType Index() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00332">ebert_graph.h:332</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_a92531459eff09455cfa63976f5024906"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#a92531459eff09455cfa63976f5024906">operations_research::EbertGraph::ArcIndex</a></div><div class="ttdeci">ArcIndexType ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01224">ebert_graph.h:1224</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_a5e97f7ded349bc661bf63bca4c951d6b"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#a5e97f7ded349bc661bf63bca4c951d6b">operations_research::EbertGraph::Opposite</a></div><div class="ttdeci">ArcIndexType Opposite(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01409">ebert_graph.h:1409</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html">operations_research::StarGraphBase</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00213">ebert_graph.h:213</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1PermutationIndexComparisonByArcHead_html_adfac7f64c59dc84fca23bcd984ef2bdd"><div class="ttname"><a href="classoperations__research_1_1PermutationIndexComparisonByArcHead.html#adfac7f64c59dc84fca23bcd984ef2bdd">operations_research::PermutationIndexComparisonByArcHead::operator()</a></div><div class="ttdeci">bool operator()(ArcIndexType a, ArcIndexType b) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00525">ebert_graph.h:525</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_aad916b80da8f95078f693e604c8985ac"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#aad916b80da8f95078f693e604c8985ac">operations_research::StarGraphBase::kMaxNumNodes</a></div><div class="ttdeci">static const NodeIndexType kMaxNumNodes</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00230">ebert_graph.h:230</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator_html"><div class="ttname"><a href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html">operations_research::EbertGraph::OutgoingOrOppositeIncomingArcIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01237">ebert_graph.h:1237</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_html_a4de07ac4885d7183fdb859bd112ad6f1"><div class="ttname"><a href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html#a4de07ac4885d7183fdb859bd112ad6f1">operations_research::or_internal::GraphBuilderFromArcs::AddArc</a></div><div class="ttdeci">GraphType::ArcIndex AddArc(typename GraphType::NodeIndex tail, typename GraphType::NodeIndex head)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01972">ebert_graph.h:1972</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1ArcIterator_html_a659a293dd51073a1b9560bb80f687705"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html#a659a293dd51073a1b9560bb80f687705">operations_research::StarGraphBase::ArcIterator::Next</a></div><div class="ttdeci">void Next()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00352">ebert_graph.h:352</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator_html_adb89d4c88029fe2fa9992864e32c0391"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#adb89d4c88029fe2fa9992864e32c0391">operations_research::StarGraphBase::OutgoingArcIterator::OutgoingArcIterator</a></div><div class="ttdeci">OutgoingArcIterator(const DerivedGraph &graph, NodeIndexType node, ArcIndexType arc)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00377">ebert_graph.h:377</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a272bcc4d6ee0e87a7fc430a5cb13c582"><div class="ttname"><a href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">operations_research::NodeIndex</a></div><div class="ttdeci">int32 NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00192">ebert_graph.h:192</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator_html_a659a293dd51073a1b9560bb80f687705"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#a659a293dd51073a1b9560bb80f687705">operations_research::StarGraphBase::OutgoingArcIterator::Next</a></div><div class="ttdeci">void Next()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00396">ebert_graph.h:396</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1graph__traits_html_a9e3309483a491bf0508bfc471b492a8f"><div class="ttname"><a href="structoperations__research_1_1graph__traits.html#a9e3309483a491bf0508bfc471b492a8f">operations_research::graph_traits::has_reverse_arcs</a></div><div class="ttdeci">static const bool has_reverse_arcs</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01849">ebert_graph.h:1849</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_a0069419fba4f69240c65b8a224ff8d8a"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#a0069419fba4f69240c65b8a224ff8d8a">operations_research::EbertGraph::IsOutgoingOrOppositeIncoming</a></div><div class="ttdeci">bool IsOutgoingOrOppositeIncoming(ArcIndexType arc, NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01429">ebert_graph.h:1429</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardEbertGraph_html_a53ee05de8f3dd5145b9c0a5ef903a399"><div class="ttname"><a href="classoperations__research_1_1ForwardEbertGraph.html#a53ee05de8f3dd5145b9c0a5ef903a399">operations_research::ForwardEbertGraph::BuildTailArray</a></div><div class="ttdeci">bool BuildTailArray()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01656">ebert_graph.h:1656</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_a3caf77fe23c752e7cf9c97116ee9d34a"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, EbertGraph< NodeIndexType, ArcIndexType > >::kFirstArc</a></div><div class="ttdeci">static const ArcIndexType kFirstArc</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00225">ebert_graph.h:225</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_a52c9ef13a9e62da957113d8cc7faa555"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#a52c9ef13a9e62da957113d8cc7faa555">operations_research::EbertGraph::DirectArcHead</a></div><div class="ttdeci">NodeIndexType DirectArcHead(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01391">ebert_graph.h:1391</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator_html_aa7e07ffe21ad6b4c71a0d22c65f30347"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1OutgoingArcIterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347">operations_research::StarGraphBase::OutgoingArcIterator::Ok</a></div><div class="ttdeci">bool Ok() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00393">ebert_graph.h:393</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_ac6532804a8bcf9ca89e41b0e3139d5fb"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">operations_research::EbertGraph::CheckArcBounds</a></div><div class="ttdeci">bool CheckArcBounds(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01363">ebert_graph.h:1363</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1PermutationIndexComparisonByArcHead_html_aaf93c351ba18edcfcc2949a6c31fc9b1"><div class="ttname"><a href="classoperations__research_1_1PermutationIndexComparisonByArcHead.html#aaf93c351ba18edcfcc2949a6c31fc9b1">operations_research::PermutationIndexComparisonByArcHead::PermutationIndexComparisonByArcHead</a></div><div class="ttdeci">PermutationIndexComparisonByArcHead(const ZVector< NodeIndexType > &head)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00521">ebert_graph.h:521</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1or__internal_1_1TailArrayReleaser_html_a90d82914da1a9f8e547a89a4b39a1ebe"><div class="ttname"><a href="structoperations__research_1_1or__internal_1_1TailArrayReleaser.html#a90d82914da1a9f8e547a89a4b39a1ebe">operations_research::or_internal::TailArrayReleaser::ReleaseTailArray</a></div><div class="ttdeci">void ReleaseTailArray() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01898">ebert_graph.h:1898</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_afa0c44b50a5e9459e3339ec50082e635"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, EbertGraph< NodeIndexType, ArcIndexType > >::num_arcs_</a></div><div class="ttdeci">ArcIndexType num_arcs_</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00495">ebert_graph.h:495</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardEbertGraph_html_a3204d12d83e8425b42e6450999cfbcfa"><div class="ttname"><a href="classoperations__research_1_1ForwardEbertGraph.html#a3204d12d83e8425b42e6450999cfbcfa">operations_research::ForwardEbertGraph::ForwardEbertGraph</a></div><div class="ttdeci">ForwardEbertGraph(NodeIndexType max_num_nodes, ArcIndexType max_num_arcs)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01603">ebert_graph.h:1603</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_a261f8641bf78570222a84ad4c10d8b81"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#a261f8641bf78570222a84ad4c10d8b81">operations_research::EbertGraph::~EbertGraph</a></div><div class="ttdeci">~EbertGraph()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01232">ebert_graph.h:1232</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardEbertGraph_html_aec05ff3d270a5f888e1623c2a99ff2aa"><div class="ttname"><a href="classoperations__research_1_1ForwardEbertGraph.html#aec05ff3d270a5f888e1623c2a99ff2aa">operations_research::ForwardEbertGraph::NodeIndex</a></div><div class="ttdeci">NodeIndexType NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01598">ebert_graph.h:1598</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_af1dc9501f2032d9e6b42c49714ad2f67"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#af1dc9501f2032d9e6b42c49714ad2f67">operations_research::EbertGraph::DirectArcTail</a></div><div class="ttdeci">NodeIndexType DirectArcTail(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01384">ebert_graph.h:1384</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_ad2ab85b2912dbf12804d3d1ddea9ec15"><div class="ttname"><a href="namespaceoperations__research.html#ad2ab85b2912dbf12804d3d1ddea9ec15">operations_research::ArcIndexArray</a></div><div class="ttdeci">ZVector< ArcIndex > ArcIndexArray</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00208">ebert_graph.h:208</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a58d0c72004cf773e707cb9d43dafc308"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a58d0c72004cf773e707cb9d43dafc308">operations_research::StarGraphBase::ArcDebugString</a></div><div class="ttdeci">std::string ArcDebugString(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00310">ebert_graph.h:310</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1TailArrayManager_html_a5b9e3e11b5999e1e2265f9f14a824214"><div class="ttname"><a href="classoperations__research_1_1TailArrayManager.html#a5b9e3e11b5999e1e2265f9f14a824214">operations_research::TailArrayManager::BuildTailArrayFromAdjacencyListsIfForwardGraph</a></div><div class="ttdeci">bool BuildTailArrayFromAdjacencyListsIfForwardGraph() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01920">ebert_graph.h:1920</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardEbertGraph_html_adf0cfc6d2bc79267111a8d38a1f6ffea"><div class="ttname"><a href="classoperations__research_1_1ForwardEbertGraph.html#adf0cfc6d2bc79267111a8d38a1f6ffea">operations_research::ForwardEbertGraph::TailArrayComplete</a></div><div class="ttdeci">bool TailArrayComplete() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01687">ebert_graph.h:1687</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1TailArrayManager_html_a8175cb3b018fe1f6b5910c669f014c76"><div class="ttname"><a href="classoperations__research_1_1TailArrayManager.html#a8175cb3b018fe1f6b5910c669f014c76">operations_research::TailArrayManager::TailArrayManager</a></div><div class="ttdeci">TailArrayManager(GraphType *g)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01918">ebert_graph.h:1918</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator_html_ab0fa4991e548ecbe6666e461ac898b32"><div class="ttname"><a href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#ab0fa4991e548ecbe6666e461ac898b32">operations_research::EbertGraph::OutgoingOrOppositeIncomingArcIterator::OutgoingOrOppositeIncomingArcIterator</a></div><div class="ttdeci">OutgoingOrOppositeIncomingArcIterator(const EbertGraph &graph, NodeIndexType node)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01239">ebert_graph.h:1239</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_html_aea1f600a21e54d8a78df733a4fc2f7f9"><div class="ttname"><a href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html#aea1f600a21e54d8a78df733a4fc2f7f9">operations_research::or_internal::GraphBuilderFromArcs::Graph</a></div><div class="ttdeci">GraphType * Graph(PermutationCycleHandler< typename GraphType::ArcIndex > *client_cycle_handler)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01991">ebert_graph.h:1991</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardEbertGraph_html_a92531459eff09455cfa63976f5024906"><div class="ttname"><a href="classoperations__research_1_1ForwardEbertGraph.html#a92531459eff09455cfa63976f5024906">operations_research::ForwardEbertGraph::ArcIndex</a></div><div class="ttdeci">ArcIndexType ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01599">ebert_graph.h:1599</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardEbertGraph_html_aae684b1eb132c8c201f437d88e367b55"><div class="ttname"><a href="classoperations__research_1_1ForwardEbertGraph.html#aae684b1eb132c8c201f437d88e367b55">operations_research::ForwardEbertGraph::Tail</a></div><div class="ttdeci">NodeIndexType Tail(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01631">ebert_graph.h:1631</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4_html_a29714e1125e2707087a39d1d11467d34"><div class="ttname"><a href="structoperations__research_1_1or__internal_1_1TailArrayReleaser_3_01GraphType_00_01false_01_4.html#a29714e1125e2707087a39d1d11467d34">operations_research::or_internal::TailArrayReleaser< GraphType, false >::graph_</a></div><div class="ttdeci">GraphType *const graph_</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01910">ebert_graph.h:1910</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs_html_af0a6d99cf6168e896bd3ed5808c6a64f"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#af0a6d99cf6168e896bd3ed5808c6a64f">operations_research::EbertGraphBase::CycleHandlerForAnnotatedArcs::SetSeen</a></div><div class="ttdeci">void SetSeen(ArcIndexType *permutation_element) const override</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01087">ebert_graph.h:1087</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_a3a725c1fd4db4e67a7f13b36652e0fa8"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#a3a725c1fd4db4e67a7f13b36652e0fa8">operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, EbertGraph< NodeIndexType, ArcIndexType > >::max_num_arcs_</a></div><div class="ttdeci">ArcIndexType max_num_arcs_</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00489">ebert_graph.h:489</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator_html_aa7e07ffe21ad6b4c71a0d22c65f30347"><div class="ttname"><a href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347">operations_research::EbertGraph::IncomingArcIterator::Ok</a></div><div class="ttdeci">bool Ok() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01326">ebert_graph.h:1326</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a9e04004960ec7ac63f9ce9b97aa0bcfa"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a9e04004960ec7ac63f9ce9b97aa0bcfa">operations_research::StarGraphBase::num_nodes_</a></div><div class="ttdeci">NodeIndexType num_nodes_</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00492">ebert_graph.h:492</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a48bfd7172b9a8af435198c373a8cf5e4"><div class="ttname"><a href="namespaceoperations__research.html#a48bfd7172b9a8af435198c373a8cf5e4">operations_research::NodeIndexArray</a></div><div class="ttdeci">ZVector< NodeIndex > NodeIndexArray</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00207">ebert_graph.h:207</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a74cc112e18e1496d720c48f6082d2671"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a74cc112e18e1496d720c48f6082d2671">operations_research::StarGraphBase::NodeDebugString</a></div><div class="ttdeci">std::string NodeDebugString(const NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00302">ebert_graph.h:302</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardEbertGraph_html_a6832ebe70da89cb9d2efea26a823d204"><div class="ttname"><a href="classoperations__research_1_1ForwardEbertGraph.html#a6832ebe70da89cb9d2efea26a823d204">operations_research::ForwardEbertGraph::CheckTailIndexValidity</a></div><div class="ttdeci">bool CheckTailIndexValidity(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01625">ebert_graph.h:1625</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator_html_af251b7da74772dec7390bcc35f5e57f9"><div class="ttname"><a href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#af251b7da74772dec7390bcc35f5e57f9">operations_research::EbertGraph::OutgoingOrOppositeIncomingArcIterator::operator=</a></div><div class="ttdeci">void operator=(const OutgoingOrOppositeIncomingArcIterator &iterator)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01259">ebert_graph.h:1259</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_html_adb1320c0f546bf857179bd3756e84646"><div class="ttname"><a href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html#adb1320c0f546bf857179bd3756e84646">operations_research::or_internal::GraphBuilderFromArcs::GraphBuilderFromArcs</a></div><div class="ttdeci">GraphBuilderFromArcs(typename GraphType::NodeIndex max_num_nodes, typename GraphType::ArcIndex max_num_arcs, bool sort_arcs)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01965">ebert_graph.h:1965</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00033">christofides.h:33</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html">operations_research::EbertGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00188">ebert_graph.h:188</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1graph__traits_html_ab96eca623728389006cfa013da781e1e"><div class="ttname"><a href="structoperations__research_1_1graph__traits.html#ab96eca623728389006cfa013da781e1e">operations_research::graph_traits::is_dynamic</a></div><div class="ttdeci">static const bool is_dynamic</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01850">ebert_graph.h:1850</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_af24b13c27331f67db15d6c2a3f3507e3"><div class="ttname"><a href="namespaceoperations__research.html#af24b13c27331f67db15d6c2a3f3507e3">operations_research::StarGraph</a></div><div class="ttdeci">EbertGraph< NodeIndex, ArcIndex > StarGraph</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00204">ebert_graph.h:204</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a6a2df5042167b234f6dc3aed4acfa6c9"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a6a2df5042167b234f6dc3aed4acfa6c9">operations_research::StarGraphBase::num_nodes</a></div><div class="ttdeci">NodeIndexType num_nodes() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00237">ebert_graph.h:237</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_html_a4bdbd200e31110f301a3fed9abf15626"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph.html#a4bdbd200e31110f301a3fed9abf15626">operations_research::ForwardStaticGraph::IsIncoming</a></div><div class="ttdeci">bool IsIncoming(ArcIndexType arc, NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00763">ebert_graph.h:763</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a6dea64dce5de0432befc47f85176ab19"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a6dea64dce5de0432befc47f85176ab19">operations_research::StarGraphBase::max_num_arcs</a></div><div class="ttdeci">ArcIndexType max_num_arcs() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00259">ebert_graph.h:259</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_1_1ArcIterator_html_a7daec7672f0f4e44962e7c6061ca2632"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase_1_1ArcIterator.html#a7daec7672f0f4e44962e7c6061ca2632">operations_research::StarGraphBase::ArcIterator::ArcIterator</a></div><div class="ttdeci">ArcIterator(const DerivedGraph &graph)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00345">ebert_graph.h:345</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator_html_aa7e07ffe21ad6b4c71a0d22c65f30347"><div class="ttname"><a href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347">operations_research::EbertGraph::OutgoingOrOppositeIncomingArcIterator::Ok</a></div><div class="ttdeci">bool Ok() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01266">ebert_graph.h:1266</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1PermutationIndexComparisonByArcHead_html"><div class="ttname"><a href="classoperations__research_1_1PermutationIndexComparisonByArcHead.html">operations_research::PermutationIndexComparisonByArcHead</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00519">ebert_graph.h:519</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1TailArrayManager_html"><div class="ttname"><a href="classoperations__research_1_1TailArrayManager.html">operations_research::TailArrayManager</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01916">ebert_graph.h:1916</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_ae4bf065dd416af2bc622a829172e43a9"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#ae4bf065dd416af2bc622a829172e43a9">operations_research::EbertGraphBase::NextAdjacentArc</a></div><div class="ttdeci">ArcIndexType NextAdjacentArc(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01131">ebert_graph.h:1131</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_ab2ba507587a78ec3b72a0d62c024bc7e"><div class="ttname"><a href="namespaceoperations__research.html#ab2ba507587a78ec3b72a0d62c024bc7e">operations_research::ForwardStarStaticGraph</a></div><div class="ttdeci">ForwardStaticGraph< NodeIndex, ArcIndex > ForwardStarStaticGraph</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00206">ebert_graph.h:206</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_a553e5eeb2887a1d7663e1200b7466e6c"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#a553e5eeb2887a1d7663e1200b7466e6c">operations_research::EbertGraph::CheckArcValidity</a></div><div class="ttdeci">bool CheckArcValidity(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01371">ebert_graph.h:1371</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardEbertGraph_html_a3fe1b105925a29cd63741e6dc85cfe45"><div class="ttname"><a href="classoperations__research_1_1ForwardEbertGraph.html#a3fe1b105925a29cd63741e6dc85cfe45">operations_research::ForwardEbertGraph::BuildRepresentation</a></div><div class="ttdeci">void BuildRepresentation()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01646">ebert_graph.h:1646</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_html"><div class="ttname"><a href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs.html">operations_research::or_internal::GraphBuilderFromArcs</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01963">ebert_graph.h:1963</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardEbertGraph_html"><div class="ttname"><a href="classoperations__research_1_1ForwardEbertGraph.html">operations_research::ForwardEbertGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00190">ebert_graph.h:190</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator_html_a659a293dd51073a1b9560bb80f687705"><div class="ttname"><a href="classoperations__research_1_1EbertGraph_1_1OutgoingOrOppositeIncomingArcIterator.html#a659a293dd51073a1b9560bb80f687705">operations_research::EbertGraph::OutgoingOrOppositeIncomingArcIterator::Next</a></div><div class="ttdeci">void Next()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01269">ebert_graph.h:1269</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_ab49bc230c31b15a51efb44be25b30472"><div class="ttname"><a href="namespaceoperations__research.html#ab49bc230c31b15a51efb44be25b30472">operations_research::ForwardStarGraph</a></div><div class="ttdeci">ForwardEbertGraph< NodeIndex, ArcIndex > ForwardStarGraph</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00205">ebert_graph.h:205</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_abe63d4d83bcc1da204931b4687494460"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#abe63d4d83bcc1da204931b4687494460">operations_research::StarGraphBase::end_node_index</a></div><div class="ttdeci">NodeIndexType end_node_index() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00247">ebert_graph.h:247</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a0da78a7e517acf1b646ae28ad16216ed"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a0da78a7e517acf1b646ae28ad16216ed">operations_research::StarGraphBase::kNilNode</a></div><div class="ttdeci">static const NodeIndexType kNilNode</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00216">ebert_graph.h:216</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4_html_aea1f600a21e54d8a78df733a4fc2f7f9"><div class="ttname"><a href="classoperations__research_1_1or__internal_1_1GraphBuilderFromArcs_3_01GraphType_00_01true_01_4.html#aea1f600a21e54d8a78df733a4fc2f7f9">operations_research::or_internal::GraphBuilderFromArcs< GraphType, true >::Graph</a></div><div class="ttdeci">GraphType * Graph(PermutationCycleHandler< typename GraphType::ArcIndex > *client_cycle_handler)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l02042">ebert_graph.h:2042</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a5237cfbb86ec8f305e498e873e5c4e95"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a5237cfbb86ec8f305e498e873e5c4e95">operations_research::StarGraphBase::Head</a></div><div class="ttdeci">NodeIndexType Head(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00297">ebert_graph.h:297</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator_html_adac23a27a3389aea80f75741569afe35"><div class="ttname"><a href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#adac23a27a3389aea80f75741569afe35">operations_research::EbertGraph::IncomingArcIterator::Index</a></div><div class="ttdeci">ArcIndexType Index() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01335">ebert_graph.h:1335</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ArcFunctorOrderingByTailAndHead_html_abb35cb80d5dd70122c4b741cde50db2e"><div class="ttname"><a href="classoperations__research_1_1ArcFunctorOrderingByTailAndHead.html#abb35cb80d5dd70122c4b741cde50db2e">operations_research::ArcFunctorOrderingByTailAndHead::ArcFunctorOrderingByTailAndHead</a></div><div class="ttdeci">ArcFunctorOrderingByTailAndHead(const GraphType &graph)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01941">ebert_graph.h:1941</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_ac16ad50a1e5ffab13d1022bcc7fe75d8"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#ac16ad50a1e5ffab13d1022bcc7fe75d8">operations_research::StarGraphBase::FirstOutgoingArc</a></div><div class="ttdeci">ArcIndexType FirstOutgoingArc(const NodeIndexType node) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00479">ebert_graph.h:479</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a3caf77fe23c752e7cf9c97116ee9d34a"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a3caf77fe23c752e7cf9c97116ee9d34a">operations_research::StarGraphBase::kFirstArc</a></div><div class="ttdeci">static const ArcIndexType kFirstArc</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00225">ebert_graph.h:225</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs_html"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html">operations_research::ForwardStaticGraph::CycleHandlerForAnnotatedArcs</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00570">ebert_graph.h:570</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a110289c48d7a56f42f2ff83123a2ec85"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a110289c48d7a56f42f2ff83123a2ec85">operations_research::StarGraphBase::NextArc</a></div><div class="ttdeci">ArcIndexType NextArc(const ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00472">ebert_graph.h:472</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a881fc80aead9398df4fbcb6e40903c9a"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a881fc80aead9398df4fbcb6e40903c9a">operations_research::StarGraphBase::head_</a></div><div class="ttdeci">ZVector< NodeIndexType > head_</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00498">ebert_graph.h:498</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_a87a0f5a59b776268f0b57353ac3e7dcc"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#a87a0f5a59b776268f0b57353ac3e7dcc">operations_research::StarGraphBase::StarGraphBase</a></div><div class="ttdeci">StarGraphBase()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00427">ebert_graph.h:427</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_html_aab3a7c235c6a6000a25a5a79d680f1ba"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase.html#aab3a7c235c6a6000a25a5a79d680f1ba">operations_research::EbertGraphBase< NodeIndexType, ArcIndexType, EbertGraph< NodeIndexType, ArcIndexType > >::kNilArc</a></div><div class="ttdeci">static const ArcIndexType kNilArc</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00219">ebert_graph.h:219</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_html_a764be64f3029f8b8e23511061d8de355"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph.html#a764be64f3029f8b8e23511061d8de355">operations_research::ForwardStaticGraph::DebugString</a></div><div class="ttdeci">std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00802">ebert_graph.h:802</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator_html_a22389499759a3a1fc6747d4bd0f2a120"><div class="ttname"><a href="classoperations__research_1_1EbertGraph_1_1IncomingArcIterator.html#a22389499759a3a1fc6747d4bd0f2a120">operations_research::EbertGraph::IncomingArcIterator::operator=</a></div><div class="ttdeci">void operator=(const IncomingArcIterator &iterator)</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01319">ebert_graph.h:1319</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1StarGraphBase_html_afa0c44b50a5e9459e3339ec50082e635"><div class="ttname"><a href="classoperations__research_1_1StarGraphBase.html#afa0c44b50a5e9459e3339ec50082e635">operations_research::StarGraphBase::num_arcs_</a></div><div class="ttdeci">ArcIndexType num_arcs_</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00495">ebert_graph.h:495</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_html"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph.html">operations_research::ForwardStaticGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00192">ebert_graph.h:192</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_aec05ff3d270a5f888e1623c2a99ff2aa"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#aec05ff3d270a5f888e1623c2a99ff2aa">operations_research::EbertGraph::NodeIndex</a></div><div class="ttdeci">NodeIndexType NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01223">ebert_graph.h:1223</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraph_html_a64a62fbecf28877dbeb8b077378b8932"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html#a64a62fbecf28877dbeb8b077378b8932">operations_research::EbertGraph::EbertGraph</a></div><div class="ttdeci">EbertGraph()</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01226">ebert_graph.h:1226</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs_html_a620585eea46339771ef3f9eae9aef25a"><div class="ttname"><a href="classoperations__research_1_1EbertGraphBase_1_1CycleHandlerForAnnotatedArcs.html#a620585eea46339771ef3f9eae9aef25a">operations_research::EbertGraphBase::CycleHandlerForAnnotatedArcs::Unseen</a></div><div class="ttdeci">bool Unseen(ArcIndexType permutation_element) const override</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01091">ebert_graph.h:1091</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1or__internal_1_1TailArrayBuilder_html_a1ab05b86b5f9b013291f26847b626bc8"><div class="ttname"><a href="structoperations__research_1_1or__internal_1_1TailArrayBuilder.html#a1ab05b86b5f9b013291f26847b626bc8">operations_research::or_internal::TailArrayBuilder::BuildTailArray</a></div><div class="ttdeci">bool BuildTailArray() const</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l01875">ebert_graph.h:1875</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs_html_a2fd5ecc6414d07e3456e96c0d665ae9b"><div class="ttname"><a href="classoperations__research_1_1ForwardStaticGraph_1_1CycleHandlerForAnnotatedArcs.html#a2fd5ecc6414d07e3456e96c0d665ae9b">operations_research::ForwardStaticGraph::CycleHandlerForAnnotatedArcs::SetIndexFromIndex</a></div><div class="ttdeci">void SetIndexFromIndex(ArcIndexType source, ArcIndexType destination) const override</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00586">ebert_graph.h:586</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div>
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|