Files
ortools-clone/docs/cpp_routing/routing_8h_source.html

204 lines
594 KiB
HTML
Raw Normal View History

2019-06-13 15:51:12 +02:00
<!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="doxygen.css" title="default" media="screen,print" />
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
</head>
<body>
<div id="banner-container">
<div id="banner">
<span id="sfml">OR-Tools 7.1@</span>
</div>
</div>
<div id="content">
<!-- Generated by Doxygen 1.8.15 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main&#160;Page</span></a></li>
<li><a href="pages.html"><span>Related&#160;Pages</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File&#160;List</span></a></li>
<li><a href="globals.html"><span>File&#160;Members</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_afbb39f66221aac28bbdefd1dca2b2b0.html">constraint_solver</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">routing.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="routing_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>&#160;<span class="comment">// Copyright 2010-2018 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment">// Licensed under the Apache License, Version 2.0 (the &quot;License&quot;);</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<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>&#160;<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>&#160;<span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<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>&#160;<span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<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>&#160;<span class="comment">// distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<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>&#160;<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>&#160;<span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160;</div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="comment">// The vehicle routing library lets one model and solve generic vehicle routing</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="comment">// problems ranging from the Traveling Salesman Problem to more complex</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;<span class="comment">// problems such as the Capacitated Vehicle Routing Problem with Time Windows.</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="comment">// The objective of a vehicle routing problem is to build routes covering a set</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="comment">// of nodes minimizing the overall cost of the routes (usually proportional to</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="comment">// the sum of the lengths of each segment of the routes) while respecting some</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="comment">// problem-specific constraints (such as the length of a route). A route is</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="comment">// equivalent to a path connecting nodes, starting/ending at specific</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160;<span class="comment">// starting/ending nodes.</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160;<span class=
<div class="ttc" id="routing_8h_html_ab313d84a56c5e9b1b8f28da70b8d4045"><div class="ttname"><a href="routing_8h.html#ab313d84a56c5e9b1b8f28da70b8d4045">HasTypeRegulations</a></div><div class="ttdeci">bool HasTypeRegulations() const</div><div class="ttdoc">Returns true iff the model has any incompatibilities or requirements set on node types.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00762">routing.h:762</a></div></div>
<div class="ttc" id="routing_8h_html_a0e23be986e4c3b96a50c8798aa5f536d"><div class="ttname"><a href="routing_8h.html#a0e23be986e4c3b96a50c8798aa5f536d">AddSearchMonitor</a></div><div class="ttdeci">void AddSearchMonitor(SearchMonitor *const monitor)</div><div class="ttdoc">Adds a search monitor to the search used to solve the routing model.</div></div>
<div class="ttc" id="routing_8h_html_adb0524e488894fa8f88764c74abb31f5"><div class="ttname"><a href="routing_8h.html#adb0524e488894fa8f88764c74abb31f5">RemainingTime</a></div><div class="ttdeci">absl::Duration RemainingTime() const</div><div class="ttdoc">Returns the time left in the search limit.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01173">routing.h:1173</a></div></div>
<div class="ttc" id="routing_8h_html_ae1acdfe3dcf892d108d2a2ecab94e936"><div class="ttname"><a href="routing_8h.html#ae1acdfe3dcf892d108d2a2ecab94e936">SetAmortizedCostFactorsOfVehicle</a></div><div class="ttdeci">void SetAmortizedCostFactorsOfVehicle(int64 linear_cost_factor, int64 quadratic_cost_factor, int vehicle)</div><div class="ttdoc">Sets the linear and quadratic cost factor of the given vehicle.</div></div>
<div class="ttc" id="routing_8h_html_acfcef421e8c8cd243157543f741d6a73"><div class="ttname"><a href="routing_8h.html#acfcef421e8c8cd243157543f741d6a73">WriteAssignment</a></div><div class="ttdeci">bool WriteAssignment(const std::string &amp;file_name) const</div><div class="ttdoc">Writes the current solution to a file containing an AssignmentProto.</div></div>
<div class="ttc" id="routing_8h_html_a410f7da30cf944b7874eebe57eebe41a"><div class="ttname"><a href="routing_8h.html#a410f7da30cf944b7874eebe57eebe41a">ApplyLocksToAllVehicles</a></div><div class="ttdeci">bool ApplyLocksToAllVehicles(const std::vector&lt; std::vector&lt; int64 &gt;&gt; &amp;locks, bool close_routes)</div><div class="ttdoc">Applies lock chains to all vehicles to the next search, such that locks[p] is the lock chain for rout...</div></div>
<div class="ttc" id="routing_8h_html_a92ee209f167d3974329301d784010b63"><div class="ttname"><a href="routing_8h.html#a92ee209f167d3974329301d784010b63">AddTemporalRequiredTypeAlternatives</a></div><div class="ttdeci">void AddTemporalRequiredTypeAlternatives(int dependent_type, absl::flat_hash_set&lt; int &gt; required_type_alternatives)</div><div class="ttdoc">If type_D temporally depends on type_R, any non-delivery node_D of type_D requires at least one non-d...</div></div>
<div class="ttc" id="routing_8h_html_ad3b144985c2b4b24cf39b839dbd9c16d"><div class="ttname"><a href="routing_8h.html#ad3b144985c2b4b24cf39b839dbd9c16d">GetCostClassesCount</a></div><div class="ttdeci">int GetCostClassesCount() const</div><div class="ttdoc">Returns the number of different cost classes in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01119">routing.h:1119</a></div></div>
<div class="ttc" id="routing_8h_html_ab69145472d51d341f82d3ad29e9c6be2"><div class="ttname"><a href="routing_8h.html#ab69145472d51d341f82d3ad29e9c6be2">SetFirstSolutionEvaluator</a></div><div class="ttdeci">void SetFirstSolutionEvaluator(Solver::IndexEvaluator2 evaluator)</div><div class="ttdoc">Takes ownership of evaluator.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00845">routing.h:845</a></div></div>
<div class="ttc" id="routing_8h_html_a66fb44c05f9875685e9c332fbdfb643b"><div class="ttname"><a href="routing_8h.html#a66fb44c05f9875685e9c332fbdfb643b">NextVar</a></div><div class="ttdeci">IntVar * NextVar(int64 index) const</div><div class="ttdoc">Returns the next variable of the node corresponding to index.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01066">routing.h:1066</a></div></div>
<div class="ttc" id="structSimpleBoundCosts_1_1BoundCost_html_a8e9bc21d85a15811daec7d1b03b50704"><div class="ttname"><a href="structSimpleBoundCosts_1_1BoundCost.html#a8e9bc21d85a15811daec7d1b03b50704">SimpleBoundCosts::BoundCost::cost</a></div><div class="ttdeci">int64 cost</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01966">routing.h:1966</a></div></div>
<div class="ttc" id="routing_8h_html_a660cb5477a6d3fbf146657aa7af73968"><div class="ttname"><a href="routing_8h.html#a660cb5477a6d3fbf146657aa7af73968">first_solution_evaluator</a></div><div class="ttdeci">const Solver::IndexEvaluator2 &amp; first_solution_evaluator() const</div><div class="ttdoc">Search Gets/sets the evaluator used during the search.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00840">routing.h:840</a></div></div>
<div class="ttc" id="structDisjunctivePropagator_1_1Tasks_html_a480a1199c2254e1b14f5124b77a65fe9"><div class="ttname"><a href="structDisjunctivePropagator_1_1Tasks.html#a480a1199c2254e1b14f5124b77a65fe9">DisjunctivePropagator::Tasks::forbidden_intervals</a></div><div class="ttdeci">std::vector&lt; const SortedDisjointIntervalList * &gt; forbidden_intervals</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01681">routing.h:1681</a></div></div>
<div class="ttc" id="routing_8h_html_a5e3f4c6871f7b2c67fd5b1ad6c94d891"><div class="ttname"><a href="routing_8h.html#a5e3f4c6871f7b2c67fd5b1ad6c94d891">HasTemporalTypeRequirements</a></div><div class="ttdeci">bool HasTemporalTypeRequirements() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00756">routing.h:756</a></div></div>
<div class="ttc" id="routing_8h_html_aa9e7ba89833775f29889744fe9480d29"><div class="ttname"><a href="routing_8h.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a></div><div class="ttdeci">int vehicles() const</div><div class="ttdoc">Returns the number of vehicle routes in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01182">routing.h:1182</a></div></div>
<div class="ttc" id="routing_8h_html_ac8347e84488d1b5eb7b5e6972fb32be3"><div class="ttname"><a href="routing_8h.html#ac8347e84488d1b5eb7b5e6972fb32be3">IsMatchingModel</a></div><div class="ttdeci">bool IsMatchingModel() const</div><div class="ttdoc">Returns true if a vehicle/node matching problem is detected.</div></div>
<div class="ttc" id="routing_8h_html_abaa74f74aefe075aedb6b16259a4404e"><div class="ttname"><a href="routing_8h.html#abaa74f74aefe075aedb6b16259a4404e">GetNonZeroCostClassesCount</a></div><div class="ttdeci">int GetNonZeroCostClassesCount() const</div><div class="ttdoc">Ditto, minus the 'always zero', built-in cost class.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01121">routing.h:1121</a></div></div>
<div class="ttc" id="routing_8h_html_ad19492313b68e5a963af3793aaec8d90"><div class="ttname"><a href="routing_8h.html#ad19492313b68e5a963af3793aaec8d90">HasTemporalTypeIncompatibilities</a></div><div class="ttdeci">bool HasTemporalTypeIncompatibilities() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00723">routing.h:723</a></div></div>
<div class="ttc" id="routing_8h_html_a566ddf59563c1b37e8c178b1805aa0f4"><div class="ttname"><a href="routing_8h.html#a566ddf59563c1b37e8c178b1805aa0f4">RestoreAssignment</a></div><div class="ttdeci">Assignment * RestoreAssignment(const Assignment &amp;solution)</div><div class="ttdoc">Restores an assignment as a solution in the routing model and returns the new solution.</div></div>
<div class="ttc" id="structDisjunctivePropagator_1_1Tasks_html_a78f61265441dff8a40873494e79e90bd"><div class="ttname"><a href="structDisjunctivePropagator_1_1Tasks.html#a78f61265441dff8a40873494e79e90bd">DisjunctivePropagator::Tasks::distance_duration</a></div><div class="ttdeci">std::vector&lt; std::pair&lt; int64, int64 &gt; &gt; distance_duration</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01682">routing.h:1682</a></div></div>
<div class="ttc" id="routing_8h_html_aa01519be299cb5ddef36111ee6f8a5cc"><div class="ttname"><a href="routing_8h.html#aa01519be299cb5ddef36111ee6f8a5cc">GetAmortizedLinearCostFactorOfVehicles</a></div><div class="ttdeci">const std::vector&lt; int64 &gt; &amp; GetAmortizedLinearCostFactorOfVehicles() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00819">routing.h:819</a></div></div>
<div class="ttc" id="routing_8h_html_a7ccaa3133378da76d3fd5cdb560038ae"><div class="ttname"><a href="routing_8h.html#a7ccaa3133378da76d3fd5cdb560038ae">ConsiderEmptyRouteCostsForVehicle</a></div><div class="ttdeci">void ConsiderEmptyRouteCostsForVehicle(bool consider_costs, int vehicle)</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00826">routing.h:826</a></div></div>
<div class="ttc" id="routing_8h_html_aa1c45751ee316e0948ba32494262f006"><div class="ttname"><a href="routing_8h.html#aa1c45751ee316e0948ba32494262f006">MakeGreedyDescentLSOperator</a></div><div class="ttdeci">static std::unique_ptr&lt; LocalSearchOperator &gt; MakeGreedyDescentLSOperator(std::vector&lt; IntVar * &gt; variables)</div></div>
<div class="ttc" id="constraint__solver_8h_html"><div class="ttname"><a href="constraint__solver_8h.html">constraint_solver.h</a></div></div>
<div class="ttc" id="routing_8h_html_a97d152b7049084186342b719eee6fa15"><div class="ttname"><a href="routing_8h.html#a97d152b7049084186342b719eee6fa15">AssignmentToRoutes</a></div><div class="ttdeci">void AssignmentToRoutes(const Assignment &amp;assignment, std::vector&lt; std::vector&lt; int64 &gt;&gt; *const routes) const</div><div class="ttdoc">Converts the solution in the given assignment to routes for all vehicles.</div></div>
<div class="ttc" id="routing_8h_html_a3e87a7710617f6ac19dca14adad9c5a6"><div class="ttname"><a href="routing_8h.html#a3e87a7710617f6ac19dca14adad9c5a6">CompactAndCheckAssignment</a></div><div class="ttdeci">Assignment * CompactAndCheckAssignment(const Assignment &amp;assignment) const</div><div class="ttdoc">Same as CompactAssignment() but also checks the validity of the final compact solution; if it is not ...</div></div>
<div class="ttc" id="routing__index__manager_8h_html"><div class="ttname"><a href="routing__index__manager_8h.html">routing_index_manager.h</a></div></div>
<div class="ttc" id="structDisjunctivePropagator_1_1Tasks_html_a2dcba5165de6aec6cf5ab9dd3e703712"><div class="ttname"><a href="structDisjunctivePropagator_1_1Tasks.html#a2dcba5165de6aec6cf5ab9dd3e703712">DisjunctivePropagator::Tasks::duration_min</a></div><div class="ttdeci">std::vector&lt; int64 &gt; duration_min</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01676">routing.h:1676</a></div></div>
<div class="ttc" id="routing_8h_html_ac22e9cfd1fbf1b4af4f8a9be46ec88a1"><div class="ttname"><a href="routing_8h.html#ac22e9cfd1fbf1b4af4f8a9be46ec88a1">AddSameVehicleRequiredTypeAlternatives</a></div><div class="ttdeci">void AddSameVehicleRequiredTypeAlternatives(int dependent_type, absl::flat_hash_set&lt; int &gt; required_type_alternatives)</div><div class="ttdoc">Requirements:</div></div>
<div class="ttc" id="structCheapestInsertionFilteredDecisionBuilder_1_1StartEndValue_html_a843944b58d95caa2634a4c6b2792da2a"><div class="ttname"><a href="structCheapestInsertionFilteredDecisionBuilder_1_1StartEndValue.html#a843944b58d95caa2634a4c6b2792da2a">CheapestInsertionFilteredDecisionBuilder::StartEndValue::vehicle</a></div><div class="ttdeci">int vehicle</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02574">routing.h:2574</a></div></div>
<div class="ttc" id="routing_8h_html_a562e4c0a80f7f4eda9573a482af288d1"><div class="ttname"><a href="routing_8h.html#a562e4c0a80f7f4eda9573a482af288d1">Solve</a></div><div class="ttdeci">const Assignment * Solve(const Assignment *assignment=nullptr)</div><div class="ttdoc">Solves the current routing model; closes the current model.</div></div>
<div class="ttc" id="routing_8h_html_abc101a64a3c876dcdf1b7176d59bd2c9"><div class="ttname"><a href="routing_8h.html#abc101a64a3c876dcdf1b7176d59bd2c9">HasSameVehicleTypeRequirements</a></div><div class="ttdeci">bool HasSameVehicleTypeRequirements() const</div><div class="ttdoc">clang-format on Returns true iff any same-route (resp.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00753">routing.h:753</a></div></div>
<div class="ttc" id="routing_8h_html_a8cded3d3d6746c179a8ec0eddad24342"><div class="ttname"><a href="routing_8h.html#a8cded3d3d6746c179a8ec0eddad24342">VehicleVar</a></div><div class="ttdeci">IntVar * VehicleVar(int64 index) const</div><div class="ttdoc">Returns the vehicle variable of the node corresponding to index.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01076">routing.h:1076</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_a009f247167f32509baf749083e4bc984"><div class="ttname"><a href="namespaceoperations__research.html#a009f247167f32509baf749083e4bc984">operations_research::Zero</a></div><div class="ttdeci">int64 Zero()</div><div class="ttdoc">-------— Misc -------—</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03118">constraint_solver.h:3118</a></div></div>
<div class="ttc" id="routing_8h_html_a9c58894df747f5498c335a3a8c5c0c88"><div class="ttname"><a href="routing_8h.html#a9c58894df747f5498c335a3a8c5c0c88">HasHardTypeIncompatibilities</a></div><div class="ttdeci">bool HasHardTypeIncompatibilities() const</div><div class="ttdoc">Returns true iff any hard (resp.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00720">routing.h:720</a></div></div>
<div class="ttc" id="routing_8h_html_aa241abc19460575d250a5788f03afbf6"><div class="ttname"><a href="routing_8h.html#aa241abc19460575d250a5788f03afbf6">GetHomogeneousCost</a></div><div class="ttdeci">int64 GetHomogeneousCost(int64 from_index, int64 to_index) const</div><div class="ttdoc">Returns the cost of the segment between two nodes supposing all vehicle costs are the same (returns t...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01090">routing.h:1090</a></div></div>
<div class="ttc" id="routing_8h_html_a7c2d33eef73401442fd9f2e205056c73"><div class="ttname"><a href="routing_8h.html#a7c2d33eef73401442fd9f2e205056c73">VehicleCostsConsideredVar</a></div><div class="ttdeci">IntVar * VehicleCostsConsideredVar(int vehicle) const</div><div class="ttdoc">Returns the variable specifying whether or not costs are considered for vehicle.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01071">routing.h:1071</a></div></div>
<div class="ttc" id="routing_8h_html_afadc1348f0318e9bc8cebb75b2fc4234"><div class="ttname"><a href="routing_8h.html#afadc1348f0318e9bc8cebb75b2fc4234">ActiveVar</a></div><div class="ttdeci">IntVar * ActiveVar(int64 index) const</div><div class="ttdoc">Returns the active variable of the node corresponding to index.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01068">routing.h:1068</a></div></div>
<div class="ttc" id="routing_8h_html_af4e97be54c31d45d312d168ce1c8ba6f"><div class="ttname"><a href="routing_8h.html#af4e97be54c31d45d312d168ce1c8ba6f">SolveWithParameters</a></div><div class="ttdeci">const Assignment * SolveWithParameters(const RoutingSearchParameters &amp;search_parameters, std::vector&lt; const Assignment * &gt; *solutions=nullptr)</div><div class="ttdoc">Solves the current routing model with the given parameters.</div></div>
<div class="ttc" id="namespaceoperations__research_html_ae7851f8d6518e3180b9d9f0ec69826e7"><div class="ttname"><a href="namespaceoperations__research.html#ae7851f8d6518e3180b9d9f0ec69826e7">operations_research::RoutingTransitCallback2</a></div><div class="ttdeci">std::function&lt; int64(int64, int64)&gt; RoutingTransitCallback2</div><div class="ttdef"><b>Definition:</b> <a href="routing__types_8h_source.html#l00042">routing_types.h:42</a></div></div>
<div class="ttc" id="constraint__solveri_8h_html"><div class="ttname"><a href="constraint__solveri_8h.html">constraint_solveri.h</a></div></div>
<div class="ttc" id="routing_8h_html_ae2530e17cabaf267e12929ca0ee1bee0"><div class="ttname"><a href="routing_8h.html#ae2530e17cabaf267e12929ca0ee1bee0">IsEnd</a></div><div class="ttdeci">bool IsEnd(int64 index) const</div><div class="ttdoc">Returns true if 'index' represents the last node of a route.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01045">routing.h:1045</a></div></div>
<div class="ttc" id="routing_8h_html_a32bba655accbd7dc8e23d30bf679b880"><div class="ttname"><a href="routing_8h.html#a32bba655accbd7dc8e23d30bf679b880">GetCostClassIndexOfVehicle</a></div><div class="ttdeci">CostClassIndex GetCostClassIndexOfVehicle(int64 vehicle) const</div><div class="ttdoc">Get the cost class index of the given vehicle.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01105">routing.h:1105</a></div></div>
<div class="ttc" id="routing_8h_html_abcbe77312783c0a5aa4926ace764533b"><div class="ttname"><a href="routing_8h.html#abcbe77312783c0a5aa4926ace764533b">CostVar</a></div><div class="ttdeci">IntVar * CostVar() const</div><div class="ttdoc">Returns the global cost variable which is being minimized.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01078">routing.h:1078</a></div></div>
<div class="ttc" id="structRoutingDimension_1_1NodePrecedence_html_a0fcec9ed1d122c19028064641f0445a6"><div class="ttname"><a href="structRoutingDimension_1_1NodePrecedence.html#a0fcec9ed1d122c19028064641f0445a6">RoutingDimension::NodePrecedence::offset</a></div><div class="ttdeci">int64 offset</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02234">routing.h:2234</a></div></div>
<div class="ttc" id="routing_8h_html_ae1adbc353c105572655ae866124c61b6"><div class="ttname"><a href="routing_8h.html#ae1adbc353c105572655ae866124c61b6">IsStart</a></div><div class="ttdeci">bool IsStart(int64 index) const</div><div class="ttdoc">Returns true if 'index' represents the first node of a route.</div></div>
<div class="ttc" id="routing_8h_html_a46a69d9769aa92122c7e5e20f49e3da3"><div class="ttname"><a href="routing_8h.html#a46a69d9769aa92122c7e5e20f49e3da3">Next</a></div><div class="ttdeci">int64 Next(const Assignment &amp;assignment, int64 index) const</div><div class="ttdoc">Assignment inspection Returns the variable index of the node directly after the node corresponding to...</div></div>
<div class="ttc" id="routing_8h_html_ae033bc458ffce1ecc4874f3e212896f7"><div class="ttname"><a href="routing_8h.html#ae033bc458ffce1ecc4874f3e212896f7">PreAssignment</a></div><div class="ttdeci">const Assignment *const PreAssignment() const</div><div class="ttdoc">Returns an assignment used to fix some of the variables of the problem.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00935">routing.h:935</a></div></div>
<div class="ttc" id="classSavingsFilteredDecisionBuilder_1_1SavingsContainer_html"><div class="ttname"><a href="classSavingsFilteredDecisionBuilder_1_1SavingsContainer.html">SavingsFilteredDecisionBuilder::SavingsContainer</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02966">routing.h:2966</a></div></div>
<div class="ttc" id="routing_8h_html_a796b4eed03ed53bbbaed642f4ae94952"><div class="ttname"><a href="routing_8h.html#a796b4eed03ed53bbbaed642f4ae94952">AddHardTypeIncompatibility</a></div><div class="ttdeci">void AddHardTypeIncompatibility(int type1, int type2)</div><div class="ttdoc">Incompatibilities: Two nodes with &quot;hard&quot; incompatible types cannot share the same route at all,...</div></div>
<div class="ttc" id="routing_8h_html_a9d8ead500db4128d0d27f8066d1f8208"><div class="ttname"><a href="routing_8h.html#a9d8ead500db4128d0d27f8066d1f8208">GetTemporalTypeIncompatibilitiesOfType</a></div><div class="ttdeci">const absl::flat_hash_set&lt; int &gt; &amp; GetTemporalTypeIncompatibilitiesOfType(int type) const</div></div>
<div class="ttc" id="classoperations__research_1_1Solver_html_af24d476da11ebf69fae9d4890447cc95"><div class="ttname"><a href="classoperations__research_1_1Solver.html#af24d476da11ebf69fae9d4890447cc95">operations_research::Solver::VariableValueComparator</a></div><div class="ttdeci">std::function&lt; bool(int64, int64, int64)&gt; VariableValueComparator</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00735">constraint_solver.h:735</a></div></div>
<div class="ttc" id="routing_8h_html_aedb8dca94b15e5465fef1667d1a81db6"><div class="ttname"><a href="routing_8h.html#aedb8dca94b15e5465fef1667d1a81db6">IsVehicleUsed</a></div><div class="ttdeci">bool IsVehicleUsed(const Assignment &amp;assignment, int vehicle) const</div><div class="ttdoc">Returns true if the route of 'vehicle' is non empty in 'assignment'.</div></div>
<div class="ttc" id="routing_8h_html_ae9b2404a26ab1e6acf562b8261eeba38"><div class="ttname"><a href="routing_8h.html#ae9b2404a26ab1e6acf562b8261eeba38">ComputeLowerBound</a></div><div class="ttdeci">int64 ComputeLowerBound()</div><div class="ttdoc">Computes a lower bound to the routing problem solving a linear assignment problem.</div></div>
<div class="ttc" id="routing_8h_html_a97dca877bb5083a72c147628a8439770"><div class="ttname"><a href="routing_8h.html#a97dca877bb5083a72c147628a8439770">ReadAssignmentFromRoutes</a></div><div class="ttdeci">Assignment * ReadAssignmentFromRoutes(const std::vector&lt; std::vector&lt; int64 &gt;&gt; &amp;routes, bool ignore_inactive_indices)</div><div class="ttdoc">Restores the routes as the current solution.</div></div>
<div class="ttc" id="routing_8h_html_a80572a238b48c2cefe38409e7544f161"><div class="ttname"><a href="routing_8h.html#a80572a238b48c2cefe38409e7544f161">VehicleVars</a></div><div class="ttdeci">const std::vector&lt; IntVar * &gt; &amp; VehicleVars() const</div><div class="ttdoc">Returns all vehicle variables of the model, such that VehicleVars(i) is the vehicle variable of the n...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01062">routing.h:1062</a></div></div>
<div class="ttc" id="routing_8h_html_aa79f8d482de4dd0ef86a1b54999686af"><div class="ttname"><a href="routing_8h.html#aa79f8d482de4dd0ef86a1b54999686af">CloseModelWithParameters</a></div><div class="ttdeci">void CloseModelWithParameters(const RoutingSearchParameters &amp;search_parameters)</div><div class="ttdoc">Same as above taking search parameters (as of 10/2015 some the parameters have to be set when closing...</div></div>
<div class="ttc" id="routing_8h_html_a3f5d70fe48cb54cbc5d8f6bba55b007d"><div class="ttname"><a href="routing_8h.html#a3f5d70fe48cb54cbc5d8f6bba55b007d">CheckLimit</a></div><div class="ttdeci">bool CheckLimit()</div><div class="ttdoc">Returns true if the search limit has been crossed.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01167">routing.h:1167</a></div></div>
<div class="ttc" id="routing_8h_html_ae8364b53d49a5b46e994d41124c4ffd6"><div class="ttname"><a href="routing_8h.html#ae8364b53d49a5b46e994d41124c4ffd6">UnperformedPenaltyOrValue</a></div><div class="ttdeci">int64 UnperformedPenaltyOrValue(int64 default_value, int64 var_index) const</div><div class="ttdoc">Same as above except that it returns default_value instead of 0 when penalty is not well defined (def...</div></div>
<div class="ttc" id="routing_8h_html_a50dd6fccc1cca84aa10efc8f3ece396c"><div class="ttname"><a href="routing_8h.html#a50dd6fccc1cca84aa10efc8f3ece396c">GetArcCostForVehicle</a></div><div class="ttdeci">int64 GetArcCostForVehicle(int64 from_index, int64 to_index, int64 vehicle) const</div><div class="ttdoc">Returns the cost of the transit arc between two nodes for a given vehicle.</div></div>
<div class="ttc" id="routing_8h_html_a25d079aaf52ffdf6d547384b523ff018"><div class="ttname"><a href="routing_8h.html#a25d079aaf52ffdf6d547384b523ff018">DebugOutputAssignment</a></div><div class="ttdeci">std::string DebugOutputAssignment(const Assignment &amp;solution_assignment, const std::string &amp;dimension_to_print) const</div><div class="ttdoc">Print some debugging information about an assignment, including the feasible intervals of the CumulVa...</div></div>
<div class="ttc" id="routing_8h_html_add71470f4175a0859e6e3d69c2a53988"><div class="ttname"><a href="routing_8h.html#add71470f4175a0859e6e3d69c2a53988">CloseModel</a></div><div class="ttdeci">void CloseModel()</div><div class="ttdoc">Closes the current routing model; after this method is called, no modification to the model can be do...</div></div>
<div class="ttc" id="routing_8h_html_a1dc8d32892f78532c8ee7a7186158e07"><div class="ttname"><a href="routing_8h.html#a1dc8d32892f78532c8ee7a7186158e07">End</a></div><div class="ttdeci">int64 End(int vehicle) const</div><div class="ttdoc">Returns the variable index of the ending node of a vehicle route.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01041">routing.h:1041</a></div></div>
<div class="ttc" id="routing_8h_html_a4768ba91c34c542eddec212a68d79473"><div class="ttname"><a href="routing_8h.html#a4768ba91c34c542eddec212a68d79473">AddVariableMinimizedByFinalizer</a></div><div class="ttdeci">void AddVariableMinimizedByFinalizer(IntVar *var)</div><div class="ttdoc">Adds a variable to minimize in the solution finalizer.</div></div>
<div class="ttc" id="routing_8h_html_a0e106a97f0156868f1d1c741b283793e"><div class="ttname"><a href="routing_8h.html#a0e106a97f0156868f1d1c741b283793e">GetTabuVarsCallback</a></div><div class="ttdeci">std::function&lt; std::vector&lt; operations_research::IntVar * &gt;(RoutingModel *)&gt; GetTabuVarsCallback</div><div class="ttdoc">Sets the callback returning the variable to use for the Tabu Search metaheuristic.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01200">routing.h:1200</a></div></div>
<div class="ttc" id="routing_8h_html_a92d7882c311f7d9d0c55c4def34150dd"><div class="ttname"><a href="routing_8h.html#a92d7882c311f7d9d0c55c4def34150dd">GetArcCostForClass</a></div><div class="ttdeci">int64 GetArcCostForClass(int64 from_index, int64 to_index, int64 cost_class_index) const</div><div class="ttdoc">Returns the cost of the segment between two nodes for a given cost class.</div></div>
<div class="ttc" id="routing_8h_html_ab878a81ace850e3ecd26e95966409f61"><div class="ttname"><a href="routing_8h.html#ab878a81ace850e3ecd26e95966409f61">AddIntervalToAssignment</a></div><div class="ttdeci">void AddIntervalToAssignment(IntervalVar *const interval)</div></div>
<div class="ttc" id="routing_8h_html_a20d0a3f5cec2e425c86f358e5f06b4a8"><div class="ttname"><a href="routing_8h.html#a20d0a3f5cec2e425c86f358e5f06b4a8">MakeGuidedSlackFinalizer</a></div><div class="ttdeci">DecisionBuilder * MakeGuidedSlackFinalizer(const RoutingDimension *dimension, std::function&lt; int64(int64)&gt; initializer)</div><div class="ttdoc">The next few members are in the public section only for testing purposes.</div></div>
<div class="ttc" id="routing_8h_html_ab8d61705aa4291d2cd437ba0a7dfccbf"><div class="ttname"><a href="routing_8h.html#ab8d61705aa4291d2cd437ba0a7dfccbf">SetArcCostEvaluatorOfAllVehicles</a></div><div class="ttdeci">void SetArcCostEvaluatorOfAllVehicles(int evaluator_index)</div><div class="ttdoc">Sets the cost function of the model such that the cost of a segment of a route between node 'from' an...</div></div>
<div class="ttc" id="structDisjunctivePropagator_1_1Tasks_html_a646bf1d98f0bcb2b157072f8dca5661d"><div class="ttname"><a href="structDisjunctivePropagator_1_1Tasks.html#a646bf1d98f0bcb2b157072f8dca5661d">DisjunctivePropagator::Tasks::duration_max</a></div><div class="ttdeci">std::vector&lt; int64 &gt; duration_max</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01677">routing.h:1677</a></div></div>
<div class="ttc" id="routing_8h_html_a07b796e9f91ee5b4c5e99c7f23e2f743"><div class="ttname"><a href="routing_8h.html#a07b796e9f91ee5b4c5e99c7f23e2f743">SetFixedCostOfAllVehicles</a></div><div class="ttdeci">void SetFixedCostOfAllVehicles(int64 cost)</div><div class="ttdoc">Sets the fixed cost of all vehicle routes.</div></div>
<div class="ttc" id="routing_8h_html_a822458cc9a9a6fa02e86af3e3a1e5c89"><div class="ttname"><a href="routing_8h.html#a822458cc9a9a6fa02e86af3e3a1e5c89">CloseVisitTypes</a></div><div class="ttdeci">void CloseVisitTypes()</div><div class="ttdoc">This function should be called once all node visit types have been set and prior to adding any incomp...</div></div>
<div class="ttc" id="structCheapestInsertionFilteredDecisionBuilder_1_1StartEndValue_html"><div class="ttname"><a href="structCheapestInsertionFilteredDecisionBuilder_1_1StartEndValue.html">CheapestInsertionFilteredDecisionBuilder::StartEndValue</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02572">routing.h:2572</a></div></div>
<div class="ttc" id="structSimpleBoundCosts_1_1BoundCost_html_aafe091324086df78a56f418adf2dc202"><div class="ttname"><a href="structSimpleBoundCosts_1_1BoundCost.html#aafe091324086df78a56f418adf2dc202">SimpleBoundCosts::BoundCost::bound</a></div><div class="ttdeci">int64 bound</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01965">routing.h:1965</a></div></div>
<div class="ttc" id="routing_8h_html_acca75b5d3bfe2433c5805b049815f533"><div class="ttname"><a href="routing_8h.html#acca75b5d3bfe2433c5805b049815f533">GetDepot</a></div><div class="ttdeci">int64 GetDepot() const</div><div class="ttdoc">Returns the variable index of the first starting or ending node of all routes.</div></div>
<div class="ttc" id="routing__types_8h_html"><div class="ttname"><a href="routing__types_8h.html">routing_types.h</a></div></div>
<div class="ttc" id="structSavingsFilteredDecisionBuilder_1_1SavingsParameters_html"><div class="ttname"><a href="structSavingsFilteredDecisionBuilder_1_1SavingsParameters.html">SavingsFilteredDecisionBuilder::SavingsParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02940">routing.h:2940</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_a40e66c7b62d7c023af6f08912fdc3f9c"><div class="ttname"><a href="namespaceoperations__research.html#a40e66c7b62d7c023af6f08912fdc3f9c">operations_research::RoutingTransitCallback1</a></div><div class="ttdeci">std::function&lt; int64(int64)&gt; RoutingTransitCallback1</div><div class="ttdef"><b>Definition:</b> <a href="routing__types_8h_source.html#l00041">routing_types.h:41</a></div></div>
<div class="ttc" id="routing_8h_html_abd33c037942b971eeefad43c6022c20e"><div class="ttname"><a href="routing_8h.html#abd33c037942b971eeefad43c6022c20e">VehicleIndex</a></div><div class="ttdeci">int VehicleIndex(int index) const</div><div class="ttdoc">Returns the vehicle of the given start/end index, and -1 if the given index is not a vehicle start/en...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01048">routing.h:1048</a></div></div>
<div class="ttc" id="routing_8h_html_a00141bd90e555aea59a9e98cfbcda6eb"><div class="ttname"><a href="routing_8h.html#a00141bd90e555aea59a9e98cfbcda6eb">RoutingModelInspector</a></div><div class="ttdeci">friend class RoutingModelInspector</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01648">routing.h:1648</a></div></div>
<div class="ttc" id="routing_8h_html_a34ab0d5fa45360b5e6a42b9a78cfe5a8"><div class="ttname"><a href="routing_8h.html#a34ab0d5fa45360b5e6a42b9a78cfe5a8">GetVehicleClassesCount</a></div><div class="ttdeci">int GetVehicleClassesCount() const</div><div class="ttdoc">Returns the number of different vehicle classes in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01129">routing.h:1129</a></div></div>
<div class="ttc" id="routing_8h_html_a700982f228080c6278eb5a2f7f06f31d"><div class="ttname"><a href="routing_8h.html#a700982f228080c6278eb5a2f7f06f31d">SetSweepArranger</a></div><div class="ttdeci">void SetSweepArranger(SweepArranger *sweep_arranger)</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01018">routing.h:1018</a></div></div>
<div class="ttc" id="routing_8h_html_a3600327c657a0c83430d7bd9566e9ab6"><div class="ttname"><a href="routing_8h.html#a3600327c657a0c83430d7bd9566e9ab6">UnperformedPenalty</a></div><div class="ttdeci">int64 UnperformedPenalty(int64 var_index) const</div><div class="ttdoc">Get the &quot;unperformed&quot; penalty of a node.</div></div>
<div class="ttc" id="routing_8h_html_ae0c21c6d4e99cb309b8b298d280e4853"><div class="ttname"><a href="routing_8h.html#ae0c21c6d4e99cb309b8b298d280e4853">CostsAreHomogeneousAcrossVehicles</a></div><div class="ttdeci">bool CostsAreHomogeneousAcrossVehicles() const</div><div class="ttdoc">Whether costs are homogeneous across all vehicles.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01085">routing.h:1085</a></div></div>
<div class="ttc" id="routing_8h_html_a874eb2862dd884ad47e30746e03627f5"><div class="ttname"><a href="routing_8h.html#a874eb2862dd884ad47e30746e03627f5">GetVisitType</a></div><div class="ttdeci">routing_no_lns(default:false) int GetVisitType(int64 index) const</div><div class="ttdoc">Licensed under the Apache License, Version 2.0 (the &quot;License&quot;); you may not use this file except in c...</div></div>
<div class="ttc" id="routing_8h_html_acbdbdfc9491ef0586459d38cc5ef4cb8"><div class="ttname"><a href="routing_8h.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a></div><div class="ttdeci">int64 Start(int vehicle) const</div><div class="ttdoc">Model inspection.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01039">routing.h:1039</a></div></div>
<div class="ttc" id="structRoutingDimension_1_1NodePrecedence_html_a791690768d878b2fabe6adfdd35383e5"><div class="ttname"><a href="structRoutingDimension_1_1NodePrecedence.html#a791690768d878b2fabe6adfdd35383e5">RoutingDimension::NodePrecedence::first_node</a></div><div class="ttdeci">int64 first_node</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02232">routing.h:2232</a></div></div>
<div class="ttc" id="routing_8h_html_a5cc6e6b421a6dfc8650cc38e116fff03"><div class="ttname"><a href="routing_8h.html#a5cc6e6b421a6dfc8650cc38e116fff03">PackCumulsOfOptimizerDimensionsFromAssignment</a></div><div class="ttdeci">const Assignment * PackCumulsOfOptimizerDimensionsFromAssignment(const Assignment *original_assignment, absl::Duration duration_limit)</div><div class="ttdoc">For every dimension in the model's dimensions_for_local/global_optimizer_, this method tries to pack ...</div></div>
<div class="ttc" id="routing_8h_html_a51fb0661acf38ed1442819e2cc452311"><div class="ttname"><a href="routing_8h.html#a51fb0661acf38ed1442819e2cc452311">GetHardTypeIncompatibilitiesOfType</a></div><div class="ttdeci">const absl::flat_hash_set&lt; int &gt; &amp; GetHardTypeIncompatibilitiesOfType(int type) const</div><div class="ttdoc">Returns visit types incompatible with a given type.</div></div>
<div class="ttc" id="routing_8h_html_adb1490a44086db009cdb51f854a02a65"><div class="ttname"><a href="routing_8h.html#adb1490a44086db009cdb51f854a02a65">status</a></div><div class="ttdeci">Status status() const</div><div class="ttdoc">Returns the current status of the routing model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00912">routing.h:912</a></div></div>
<div class="ttc" id="routing_8h_html_a67e8d10adbcc563f428069f9b2c04b63"><div class="ttname"><a href="routing_8h.html#a67e8d10adbcc563f428069f9b2c04b63">HasVehicleWithCostClassIndex</a></div><div class="ttdeci">bool HasVehicleWithCostClassIndex(CostClassIndex cost_class_index) const</div><div class="ttdoc">Returns true iff the model contains a vehicle with the given cost_class_index.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01111">routing.h:1111</a></div></div>
<div class="ttc" id="routing_8h_html_a566384949e6395952f6f6b48603fd87f"><div class="ttname"><a href="routing_8h.html#a566384949e6395952f6f6b48603fd87f">AddLocalSearchFilter</a></div><div class="ttdeci">void AddLocalSearchFilter(LocalSearchFilter *filter)</div><div class="ttdoc">Adds a custom local search filter to the list of filters used to speed up local search by pruning unf...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01029">routing.h:1029</a></div></div>
<div class="ttc" id="routing_8h_html_a7086a908f1890a7e1550c97b774e6384"><div class="ttname"><a href="routing_8h.html#a7086a908f1890a7e1550c97b774e6384">AddTemporalTypeIncompatibility</a></div><div class="ttdeci">void AddTemporalTypeIncompatibility(int type1, int type2)</div></div>
<div class="ttc" id="routing_8h_html_a04bd106a61d493872cabb0f41f7f118f"><div class="ttname"><a href="routing_8h.html#a04bd106a61d493872cabb0f41f7f118f">GetNumberOfDecisionsInFirstSolution</a></div><div class="ttdeci">int64 GetNumberOfDecisionsInFirstSolution(const RoutingSearchParameters &amp;search_parameters) const</div><div class="ttdoc">Returns statistics on first solution search, number of decisions sent to filters, number of decisions...</div></div>
<div class="ttc" id="routing_8h_html_aed6760664a6e4f3427832ee3b7ba0602"><div class="ttname"><a href="routing_8h.html#aed6760664a6e4f3427832ee3b7ba0602">AreEmptyRouteCostsConsideredForVehicle</a></div><div class="ttdeci">bool AreEmptyRouteCostsConsideredForVehicle(int vehicle) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00831">routing.h:831</a></div></div>
<div class="ttc" id="structCheapestInsertionFilteredDecisionBuilder_1_1StartEndValue_html_a0c85e075940ea179577a2e090395b446"><div class="ttname"><a href="structCheapestInsertionFilteredDecisionBuilder_1_1StartEndValue.html#a0c85e075940ea179577a2e090395b446">CheapestInsertionFilteredDecisionBuilder::StartEndValue::operator&lt;</a></div><div class="ttdeci">bool operator&lt;(const StartEndValue &amp;other) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02576">routing.h:2576</a></div></div>
<div class="ttc" id="structDisjunctivePropagator_1_1Tasks_html"><div class="ttname"><a href="structDisjunctivePropagator_1_1Tasks.html">DisjunctivePropagator::Tasks</a></div><div class="ttdoc">A structure to hold tasks described by their features.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01672">routing.h:1672</a></div></div>
<div class="ttc" id="structDisjunctivePropagator_1_1Tasks_html_a29e9e4b732a34a405f0f43b746ebc741"><div class="ttname"><a href="structDisjunctivePropagator_1_1Tasks.html#a29e9e4b732a34a405f0f43b746ebc741">DisjunctivePropagator::Tasks::end_min</a></div><div class="ttdeci">std::vector&lt; int64 &gt; end_min</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01678">routing.h:1678</a></div></div>
<div class="ttc" id="routing_8h_html_a1156fa8214dba09e2a2a94862244aa1f"><div class="ttname"><a href="routing_8h.html#a1156fa8214dba09e2a2a94862244aa1f">AddLocalSearchOperator</a></div><div class="ttdeci">void AddLocalSearchOperator(LocalSearchOperator *ls_operator)</div><div class="ttdoc">Adds a local search operator to the set of operators used to solve the vehicle routing problem.</div></div>
<div class="ttc" id="structDisjunctivePropagator_1_1Tasks_html_a020532a499977a36e38da249afc71230"><div class="ttname"><a href="structDisjunctivePropagator_1_1Tasks.html#a020532a499977a36e38da249afc71230">DisjunctivePropagator::Tasks::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01684">routing.h:1684</a></div></div>
<div class="ttc" id="routing_8h_html_a3af1158b77552d60afc3f0473de3892d"><div class="ttname"><a href="routing_8h.html#a3af1158b77552d60afc3f0473de3892d">MutablePreAssignment</a></div><div class="ttdeci">Assignment * MutablePreAssignment()</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00936">routing.h:936</a></div></div>
<div class="ttc" id="routing_8h_html_aabdcf3bd412a5a61d811ef85e115e5ff"><div class="ttname"><a href="routing_8h.html#aabdcf3bd412a5a61d811ef85e115e5ff">AddVariableMaximizedByFinalizer</a></div><div class="ttdeci">void AddVariableMaximizedByFinalizer(IntVar *var)</div><div class="ttdoc">Adds a variable to maximize in the solution finalizer (see above for information on the solution fina...</div></div>
<div class="ttc" id="structTypeRegulationsChecker_1_1NodeCount_html"><div class="ttname"><a href="structTypeRegulationsChecker_1_1NodeCount.html">TypeRegulationsChecker::NodeCount</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01859">routing.h:1859</a></div></div>
<div class="ttc" id="routing_8h_html_ac1a2ab630f6b13644ca6853c7893f413"><div class="ttname"><a href="routing_8h.html#ac1a2ab630f6b13644ca6853c7893f413">SetAssignmentFromOtherModelAssignment</a></div><div class="ttdeci">void SetAssignmentFromOtherModelAssignment(Assignment *target_assignment, const RoutingModel *source_model, const Assignment *source_assignment)</div><div class="ttdoc">Given a &quot;source_model&quot; and its &quot;source_assignment&quot;, resets &quot;target_assignment&quot; with the IntVar variab...</div></div>
<div class="ttc" id="routing_8h_html_a0f38add802397fef1f57b7d90ccd5aef"><div class="ttname"><a href="routing_8h.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a></div><div class="ttdeci">int nodes() const</div><div class="ttdoc">Sizes and indices Returns the number of nodes in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01180">routing.h:1180</a></div></div>
<div class="ttc" id="routing_8h_html_a7e2d405cde11bc4a08d752d0e669912c"><div class="ttname"><a href="routing_8h.html#a7e2d405cde11bc4a08d752d0e669912c">SetTabuVarsCallback</a></div><div class="ttdeci">void SetTabuVarsCallback(GetTabuVarsCallback tabu_var_callback)</div></div>
<div class="ttc" id="routing_8h_html_aaeaf95383c1c03da6f22c522d119775b"><div class="ttname"><a href="routing_8h.html#aaeaf95383c1c03da6f22c522d119775b">GetAmortizedQuadraticCostFactorOfVehicles</a></div><div class="ttdeci">const std::vector&lt; int64 &gt; &amp; GetAmortizedQuadraticCostFactorOfVehicles() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00822">routing.h:822</a></div></div>
<div class="ttc" id="structSavingsFilteredDecisionBuilder_1_1VehicleClassEntry_html_a9c61973758bb413be11e59ffaad7216f"><div class="ttname"><a href="structSavingsFilteredDecisionBuilder_1_1VehicleClassEntry.html#a9c61973758bb413be11e59ffaad7216f">SavingsFilteredDecisionBuilder::VehicleClassEntry::operator&lt;</a></div><div class="ttdeci">bool operator&lt;(const VehicleClassEntry &amp;other) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02972">routing.h:2972</a></div></div>
<div class="ttc" id="structDisjunctivePropagator_1_1Tasks_html_ae81bd9ed38788f7ab29ffa6b06c8780a"><div class="ttname"><a href="structDisjunctivePropagator_1_1Tasks.html#ae81bd9ed38788f7ab29ffa6b06c8780a">DisjunctivePropagator::Tasks::start_min</a></div><div class="ttdeci">std::vector&lt; int64 &gt; start_min</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01674">routing.h:1674</a></div></div>
<div class="ttc" id="routing_8h_html_aad154b31953d2b467bbac3e4ac696cd6"><div class="ttname"><a href="routing_8h.html#aad154b31953d2b467bbac3e4ac696cd6">Nexts</a></div><div class="ttdeci">const std::vector&lt; IntVar * &gt; &amp; Nexts() const</div><div class="ttdoc">Variables.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01059">routing.h:1059</a></div></div>
<div class="ttc" id="routing_8h_html_aaf71584ad4bffea7a489dc53787fa6f8"><div class="ttname"><a href="routing_8h.html#aaf71584ad4bffea7a489dc53787fa6f8">ApplyLocks</a></div><div class="ttdeci">IntVar * ApplyLocks(const std::vector&lt; int64 &gt; &amp;locks)</div><div class="ttdoc">Applies a lock chain to the next search.</div></div>
<div class="ttc" id="routing_8h_html_a4bab641f5b9bf8de266adad29558b4c2"><div class="ttname"><a href="routing_8h.html#a4bab641f5b9bf8de266adad29558b4c2">GetFixedCostOfVehicle</a></div><div class="ttdeci">int64 GetFixedCostOfVehicle(int vehicle) const</div><div class="ttdoc">Returns the route fixed cost taken into account if the route of the vehicle is not empty,...</div></div>
<div class="ttc" id="routing_8h_html_a1048b3f7ef92f0d7747f93c8586ea1cc"><div class="ttname"><a href="routing_8h.html#a1048b3f7ef92f0d7747f93c8586ea1cc">ArcIsMoreConstrainedThanArc</a></div><div class="ttdeci">bool ArcIsMoreConstrainedThanArc(int64 from, int64 to1, int64 to2)</div><div class="ttdoc">Returns whether the arc from-&gt;to1 is more constrained than from-&gt;to2, taking into account,...</div></div>
<div class="ttc" id="structSavingsFilteredDecisionBuilder_1_1VehicleClassEntry_html"><div class="ttname"><a href="structSavingsFilteredDecisionBuilder_1_1VehicleClassEntry.html">SavingsFilteredDecisionBuilder::VehicleClassEntry</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02968">routing.h:2968</a></div></div>
<div class="ttc" id="routing_8h_html_a1b7f20d14ae5261cb2f250c6e99f4383"><div class="ttname"><a href="routing_8h.html#a1b7f20d14ae5261cb2f250c6e99f4383">CompactAssignment</a></div><div class="ttdeci">Assignment * CompactAssignment(const Assignment &amp;assignment) const</div><div class="ttdoc">Returns a compacted version of the given assignment, in which all vehicles with id lower or equal to ...</div></div>
<div class="ttc" id="structCheapestInsertionFilteredDecisionBuilder_1_1StartEndValue_html_ad144ade2ac271bf7f285bad778774b87"><div class="ttname"><a href="structCheapestInsertionFilteredDecisionBuilder_1_1StartEndValue.html#ad144ade2ac271bf7f285bad778774b87">CheapestInsertionFilteredDecisionBuilder::StartEndValue::distance</a></div><div class="ttdeci">int64 distance</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02573">routing.h:2573</a></div></div>
<div class="ttc" id="routing_8h_html_a4e8f5b5f090cf084347eda6eb803813a"><div class="ttname"><a href="routing_8h.html#a4e8f5b5f090cf084347eda6eb803813a">SetFixedCostOfVehicle</a></div><div class="ttdeci">void SetFixedCostOfVehicle(int64 cost, int vehicle)</div><div class="ttdoc">Sets the fixed cost of one vehicle route.</div></div>
<div class="ttc" id="classoperations__research_1_1Solver_html_acb354925d9ed2803b56953a9a9ec59df"><div class="ttname"><a href="classoperations__research_1_1Solver.html#acb354925d9ed2803b56953a9a9ec59df">operations_research::Solver::ObjectiveWatcher</a></div><div class="ttdeci">std::function&lt; void(int64)&gt; ObjectiveWatcher</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00736">constraint_solver.h:736</a></div></div>
<div class="ttc" id="routing_8h_html_ae75d9f49c157b7784fc8baa7d623ee35"><div class="ttname"><a href="routing_8h.html#ae75d9f49c157b7784fc8baa7d623ee35">SetArcCostEvaluatorOfVehicle</a></div><div class="ttdeci">void SetArcCostEvaluatorOfVehicle(int evaluator_index, int vehicle)</div><div class="ttdoc">Sets the cost function for a given vehicle route.</div></div>
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Licensed under the Apache License, Version 2.0 (the &quot;License&quot;); you may not use this file except in c...</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00093">constraint_solver.h:93</a></div></div>
<div class="ttc" id="routing_8h_html_a78f7f1cb8b08b7ec1d477a14447bd8d4"><div class="ttname"><a href="routing_8h.html#a78f7f1cb8b08b7ec1d477a14447bd8d4">RoutesToAssignment</a></div><div class="ttdeci">bool RoutesToAssignment(const std::vector&lt; std::vector&lt; int64 &gt;&gt; &amp;routes, bool ignore_inactive_indices, bool close_routes, Assignment *const assignment) const</div><div class="ttdoc">Fills an assignment from a specification of the routes of the vehicles.</div></div>
<div class="ttc" id="routing_8h_html_a71815ec83f6605bddb11578ebb835aae"><div class="ttname"><a href="routing_8h.html#a71815ec83f6605bddb11578ebb835aae">sweep_arranger</a></div><div class="ttdeci">SweepArranger * sweep_arranger() const</div><div class="ttdoc">Returns the sweep arranger to be used by routing heuristics.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01022">routing.h:1022</a></div></div>
<div class="ttc" id="structRoutingDimension_1_1NodePrecedence_html_a380315e16036075ab1d6fa7896f90a01"><div class="ttname"><a href="structRoutingDimension_1_1NodePrecedence.html#a380315e16036075ab1d6fa7896f90a01">RoutingDimension::NodePrecedence::second_node</a></div><div class="ttdeci">int64 second_node</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02233">routing.h:2233</a></div></div>
<div class="ttc" id="routing_8h_html_aefff345740a5db07caea065ec14ec52f"><div class="ttname"><a href="routing_8h.html#aefff345740a5db07caea065ec14ec52f">GetNumberOfRejectsInFirstSolution</a></div><div class="ttdeci">int64 GetNumberOfRejectsInFirstSolution(const RoutingSearchParameters &amp;search_parameters) const</div></div>
<div class="ttc" id="routing_8h_html_a5f32c22c620c811754ba7b6f977db864"><div class="ttname"><a href="routing_8h.html#a5f32c22c620c811754ba7b6f977db864">solver</a></div><div class="ttdeci">Solver * solver() const</div><div class="ttdoc">Returns the underlying constraint solver.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01164">routing.h:1164</a></div></div>
<div class="ttc" id="routing_8h_html_aa3d92ac74ce8d3e57551677e88e2c846"><div class="ttname"><a href="routing_8h.html#aa3d92ac74ce8d3e57551677e88e2c846">SetAmortizedCostFactorsOfAllVehicles</a></div><div class="ttdeci">quadratic_cost_factor_of_vehicle_ *[v] square of length of route v void SetAmortizedCostFactorsOfAllVehicles(int64 linear_cost_factor, int64 quadratic_cost_factor)</div><div class="ttdoc">The following methods set the linear and quadratic cost factors of vehicles (must be positive values)...</div></div>
<div class="ttc" id="structDisjunctivePropagator_1_1Tasks_html_aaa20225fc54638db1493c9ae0b2947f7"><div class="ttname"><a href="structDisjunctivePropagator_1_1Tasks.html#aaa20225fc54638db1493c9ae0b2947f7">DisjunctivePropagator::Tasks::is_preemptible</a></div><div class="ttdeci">std::vector&lt; bool &gt; is_preemptible</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01680">routing.h:1680</a></div></div>
<div class="ttc" id="routing_8h_html_a7a8e134df97e40d1fc498f7f985c33ec"><div class="ttname"><a href="routing_8h.html#a7a8e134df97e40d1fc498f7f985c33ec">GetVehicleClassIndexOfVehicle</a></div><div class="ttdeci">VehicleClassIndex GetVehicleClassIndexOfVehicle(int64 vehicle) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01124">routing.h:1124</a></div></div>
<div class="ttc" id="routing_8h_html_a24478803a7138d68852093b9c2743892"><div class="ttname"><a href="routing_8h.html#a24478803a7138d68852093b9c2743892">GetNumberOfVisitTypes</a></div><div class="ttdeci">int GetNumberOfVisitTypes() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00706">routing.h:706</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_a114ea14886b902c9cf9b988c4ef12672"><div class="ttname"><a href="namespaceoperations__research.html#a114ea14886b902c9cf9b988c4ef12672">operations_research::RoutingIndexPairs</a></div><div class="ttdeci">std::vector&lt; RoutingIndexPair &gt; RoutingIndexPairs</div><div class="ttdef"><b>Definition:</b> <a href="routing__types_8h_source.html#l00045">routing_types.h:45</a></div></div>
<div class="ttc" id="routing_8h_html_a086605d9650ce3c576d8a9c45ce0b9fc"><div class="ttname"><a href="routing_8h.html#a086605d9650ce3c576d8a9c45ce0b9fc">AddAtSolutionCallback</a></div><div class="ttdeci">void AddAtSolutionCallback(std::function&lt; void()&gt; callback)</div><div class="ttdoc">Adds a callback called each time a solution is found during the search.</div></div>
<div class="ttc" id="structSimpleBoundCosts_1_1BoundCost_html"><div class="ttname"><a href="structSimpleBoundCosts_1_1BoundCost.html">SimpleBoundCosts::BoundCost</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01964">routing.h:1964</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_a2f03e5ed2f65164d62fc5f039441596d"><div class="ttname"><a href="namespaceoperations__research.html#a2f03e5ed2f65164d62fc5f039441596d">operations_research::model</a></div><div class="ttdeci">*RoutingModel model(manager)</div></div>
<div class="ttc" id="classoperations__research_1_1Solver_html_a0243986dd2db4b6e1bda331329ae529b"><div class="ttname"><a href="classoperations__research_1_1Solver.html#a0243986dd2db4b6e1bda331329ae529b">operations_research::Solver::IndexEvaluator2</a></div><div class="ttdeci">std::function&lt; int64(int64, int64)&gt; IndexEvaluator2</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00723">constraint_solver.h:723</a></div></div>
<div class="ttc" id="routing_8h_html_ab1652af55e9d83490d9c59d35d991ce9"><div class="ttname"><a href="routing_8h.html#ab1652af55e9d83490d9c59d35d991ce9">GetTemporalRequiredTypeAlternativesOfType</a></div><div class="ttdeci">const std::vector&lt; absl::flat_hash_set&lt; int &gt; &gt; &amp; GetTemporalRequiredTypeAlternativesOfType(int type) const</div></div>
<div class="ttc" id="structDisjunctivePropagator_1_1Tasks_html_aa686b73e8435b6c0052b4e545db897ed"><div class="ttname"><a href="structDisjunctivePropagator_1_1Tasks.html#aa686b73e8435b6c0052b4e545db897ed">DisjunctivePropagator::Tasks::end_max</a></div><div class="ttdeci">std::vector&lt; int64 &gt; end_max</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01679">routing.h:1679</a></div></div>
<div class="ttc" id="structRoutingDimension_1_1NodePrecedence_html"><div class="ttname"><a href="structRoutingDimension_1_1NodePrecedence.html">RoutingDimension::NodePrecedence</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02231">routing.h:2231</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_a30af988d402f0f3d36640575ca87153c"><div class="ttname"><a href="namespaceoperations__research.html#a30af988d402f0f3d36640575ca87153c">operations_research::RoutingIndexPair</a></div><div class="ttdeci">std::pair&lt; std::vector&lt; int64 &gt;, std::vector&lt; int64 &gt; &gt; RoutingIndexPair</div><div class="ttdoc">NOTE(user): keep the &quot;&gt; &gt;&quot; for SWIG.</div><div class="ttdef"><b>Definition:</b> <a href="routing__types_8h_source.html#l00044">routing_types.h:44</a></div></div>
<div class="ttc" id="routing_8h_html_a56e06d63a6d3792ab5cd64e51724632b"><div class="ttname"><a href="routing_8h.html#a56e06d63a6d3792ab5cd64e51724632b">SolveFromAssignmentWithParameters</a></div><div class="ttdeci">const Assignment * SolveFromAssignmentWithParameters(const Assignment *assignment, const RoutingSearchParameters &amp;search_parameters, std::vector&lt; const Assignment * &gt; *solutions=nullptr)</div></div>
<div class="ttc" id="routing_8h_html_a56c3abe7b321f4caf06a0a5e72586cac"><div class="ttname"><a href="routing_8h.html#a56c3abe7b321f4caf06a0a5e72586cac">MakeSelfDependentDimensionFinalizer</a></div><div class="ttdeci">DecisionBuilder * MakeSelfDependentDimensionFinalizer(const RoutingDimension *dimension)</div><div class="ttdoc">MakeSelfDependentDimensionFinalizer is a finalizer for the slacks of a self-dependent dimension.</div></div>
<div class="ttc" id="routing_8h_html_a74e3de2ce73322e1860be0713c07c33e"><div class="ttname"><a href="routing_8h.html#a74e3de2ce73322e1860be0713c07c33e">ReadAssignment</a></div><div class="ttdeci">Assignment * ReadAssignment(const std::string &amp;file_name)</div><div class="ttdoc">Reads an assignment from a file and returns the current solution.</div></div>
<div class="ttc" id="routing_8h_html_ae350d70cb713a6772283e3753f4f2f7a"><div class="ttname"><a href="routing_8h.html#ae350d70cb713a6772283e3753f4f2f7a">GetSameVehicleRequiredTypeAlternativesOfType</a></div><div class="ttdeci">const std::vector&lt; absl::flat_hash_set&lt; int &gt; &gt; &amp; GetSameVehicleRequiredTypeAlternativesOfType(int type) const</div><div class="ttdoc">clang-format off Returns the sets of same-vehicle/temporal requirement alternatives for the given typ...</div></div>
<div class="ttc" id="routing_8h_html_a354dd8c252cf59b748602b342db6019d"><div class="ttname"><a href="routing_8h.html#a354dd8c252cf59b748602b342db6019d">Size</a></div><div class="ttdeci">int64 Size() const</div><div class="ttdoc">Returns the number of next variables in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01184">routing.h:1184</a></div></div>
<div class="ttc" id="routing_8h_html_a6569b0ea25fa25c91c2b8b63bedeacc6"><div class="ttname"><a href="routing_8h.html#a6569b0ea25fa25c91c2b8b63bedeacc6">GetArcCostForFirstSolution</a></div><div class="ttdeci">int64 GetArcCostForFirstSolution(int64 from_index, int64 to_index) const</div><div class="ttdoc">Returns the cost of the arc in the context of the first solution strategy.</div></div>
<div class="ttc" id="routing_8h_html_a437ae499bef0aa64f2753166a000f5bd"><div class="ttname"><a href="routing_8h.html#a437ae499bef0aa64f2753166a000f5bd">AddToAssignment</a></div><div class="ttdeci">void AddToAssignment(IntVar *const var)</div><div class="ttdoc">Adds an extra variable to the vehicle routing assignment.</div></div>
<div class="ttc" id="structSavingsFilteredDecisionBuilder_1_1VehicleClassEntry_html_a27394b3588b9d4b2dfd663669772d698"><div class="ttname"><a href="structSavingsFilteredDecisionBuilder_1_1VehicleClassEntry.html#a27394b3588b9d4b2dfd663669772d698">SavingsFilteredDecisionBuilder::VehicleClassEntry::fixed_cost</a></div><div class="ttdeci">int64 fixed_cost</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02970">routing.h:2970</a></div></div>
<div class="ttc" id="routing_8h_html_a50ba9dd11704e0be7edaa9e9f24142ff"><div class="ttname"><a href="routing_8h.html#a50ba9dd11704e0be7edaa9e9f24142ff">RoutingDimension</a></div><div class="ttdeci">friend class RoutingDimension</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01647">routing.h:1647</a></div></div>
<div class="ttc" id="routing_8h_html_a0f8c7a97b5465ae4ba4cb1a92c39b756"><div class="ttname"><a href="routing_8h.html#a0f8c7a97b5465ae4ba4cb1a92c39b756">GetSameVehicleIndicesOfIndex</a></div><div class="ttdeci">const std::vector&lt; int &gt; &amp; GetSameVehicleIndicesOfIndex(int node) const</div><div class="ttdoc">Returns variable indices of nodes constrained to be on the same route.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01131">routing.h:1131</a></div></div>
<div class="ttc" id="structDisjunctivePropagator_1_1Tasks_html_ad83f5b65e161e0c33b47c44ebe7a5486"><div class="ttname"><a href="structDisjunctivePropagator_1_1Tasks.html#ad83f5b65e161e0c33b47c44ebe7a5486">DisjunctivePropagator::Tasks::start_max</a></div><div class="ttdeci">std::vector&lt; int64 &gt; start_max</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01675">routing.h:1675</a></div></div>
<div class="ttc" id="routing__parameters_8pb_8h_html"><div class="ttname"><a href="routing__parameters_8pb_8h.html">routing_parameters.pb.h</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div>
<div id="footer-container">
<div id="footer">
</div>
</div>
</body>
</html>