Files
ortools-clone/docs/cpp_graph/linear__assignment_8h_source.html

108 lines
266 KiB
HTML
Raw Normal View History

2019-06-13 15:36:14 +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"/>-->
2019-06-20 23:08:48 +02:00
<link rel="stylesheet" type="text/css" href="ortools.css" title="default" media="screen,print" />
2019-06-13 15:36:14 +02:00
<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">
2019-09-12 09:22:44 +02:00
<span id="sfml">Google OR-Tools 7.4</span>
2019-06-13 15:36:14 +02:00
</div>
</div>
2019-08-07 18:01:08 -07:00
<div id="content" style="width: 100%; overflow: hidden;">
<div style="margin-left: 15px; margin-top: 5px; float: left; color: #145A32;">
2019-08-12 09:16:03 -07:00
<h2>C++ Reference</h2>
2019-08-07 18:01:08 -07:00
<ul>
<li><a href="../cpp_algorithms/annotated.html">Algorithms</a></li>
2019-08-12 09:16:03 -07:00
<li><a href="../cpp_sat/annotated.html">CP-SAT</a></li>
2019-08-07 18:01:08 -07:00
<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>
2019-06-13 15:36:14 +02:00
<div id="content">
2019-08-07 18:01:08 -07:00
<div align="center">
<h1 style="color: #145A32;">C++ Reference: Graph</h1>
</div>
2019-09-12 09:22:44 +02:00
<!-- Generated by Doxygen 1.8.15 -->
2019-06-13 15:36:14 +02:00
<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>
2019-07-15 17:42:24 -07:00
<li class="current"><a href="files.html"><span>Files</span></a></li>
2019-06-13 15:36:14 +02:00
</ul>
</div>
2019-08-07 18:01:08 -07:00
<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>
2019-07-12 13:25:23 -07:00
</div>
2019-08-07 18:01:08 -07:00
</div><!-- top -->
2019-06-13 15:36:14 +02:00
<div class="header">
<div class="headertitle">
<div class="title">linear_assignment.h</div> </div>
</div><!--header-->
<div class="contents">
2019-09-12 09:22:44 +02:00
<a href="linear__assignment_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">//</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="comment">// An implementation of a cost-scaling push-relabel algorithm for the</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;<span class="comment">// assignment problem (minimum-cost perfect bipartite matching), from</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="comment">// the paper of Goldberg and Kennedy (1995).</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="comment">// This implementation finds the minimum-cost perfect assignment in</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="comment">// the given graph with integral edge weights set through the</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="comment">// SetArcCost method.</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="comment">// The running time is O(n*m*log(nC)) where n is the number of nodes,</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160;<span class="comment">// m is the number of edges, and C is the largest magnitude of an edge cost.</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160;<span class="comment">// In principle it
<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_1CostValueCycleHandler_html_a11007fbe576099d4e9ba5a433036a8ed"><div class="ttname"><a href="classoperations__research_1_1CostValueCycleHandler.html#a11007fbe576099d4e9ba5a433036a8ed">operations_research::CostValueCycleHandler::~CostValueCycleHandler</a></div><div class="ttdeci">~CostValueCycleHandler() override</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l01042">linear_assignment.h:1042</a></div></div>
<div class="ttc" id="linear__assignment_8h_html_a9982454bded965321d3f3b7d5300b0dc"><div class="ttname"><a href="linear__assignment_8h.html#a9982454bded965321d3f3b7d5300b0dc">DECLARE_bool</a></div><div class="ttdeci">DECLARE_bool(assignment_stack_order)</div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_a77a0519df5fb71834593bb661b72921c"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#a77a0519df5fb71834593bb661b72921c">operations_research::LinearSumAssignment::SetArcCost</a></div><div class="ttdeci">void SetArcCost(ArcIndex arc, CostValue cost)</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l01009">linear_assignment.h:1009</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_1ArcIndexOrderingByTailNode_html_a7fc8cebeaaae309b2282772d6cac1888"><div class="ttname"><a href="classoperations__research_1_1ArcIndexOrderingByTailNode.html#a7fc8cebeaaae309b2282772d6cac1888">operations_research::ArcIndexOrderingByTailNode::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="linear__assignment_8h_source.html#l01064">linear_assignment.h:1064</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_aececfe5b0affea1dd1b8a38d8c1fb769"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#aececfe5b0affea1dd1b8a38d8c1fb769">operations_research::LinearSumAssignment::SetGraph</a></div><div class="ttdeci">void SetGraph(const GraphType *graph)</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00247">linear_assignment.h:247</a></div></div>
<div class="ttc" id="classoperations__research_1_1CostValueCycleHandler_html_a8bd36eabd11be9f5c4e3094418412544"><div class="ttname"><a href="classoperations__research_1_1CostValueCycleHandler.html#a8bd36eabd11be9f5c4e3094418412544">operations_research::CostValueCycleHandler::CostValueCycleHandler</a></div><div class="ttdeci">CostValueCycleHandler(std::vector&lt; CostValue &gt; *cost)</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l01026">linear_assignment.h:1026</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_1_1BipartiteLeftNodeIterator_html_ab6dfabf93ff38b84d807d6190e88011f"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment_1_1BipartiteLeftNodeIterator.html#ab6dfabf93ff38b84d807d6190e88011f">operations_research::LinearSumAssignment::BipartiteLeftNodeIterator::BipartiteLeftNodeIterator</a></div><div class="ttdeci">BipartiteLeftNodeIterator(const LinearSumAssignment &amp;assignment)</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00364">linear_assignment.h:364</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_a63b3d12e721188086870cc42cc46a258"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#a63b3d12e721188086870cc42cc46a258">operations_research::LinearSumAssignment::ComputeAssignment</a></div><div class="ttdeci">bool ComputeAssignment()</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l01448">linear_assignment.h:1448</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_1_1BipartiteLeftNodeIterator_html_a659a293dd51073a1b9560bb80f687705"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment_1_1BipartiteLeftNodeIterator.html#a659a293dd51073a1b9560bb80f687705">operations_research::LinearSumAssignment::BipartiteLeftNodeIterator::Next</a></div><div class="ttdeci">void Next()</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00371">linear_assignment.h:371</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_1_1BipartiteLeftNodeIterator_html_afadba1101a25565c8c207f7e81a67950"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment_1_1BipartiteLeftNodeIterator.html#afadba1101a25565c8c207f7e81a67950">operations_research::LinearSumAssignment::BipartiteLeftNodeIterator::Index</a></div><div class="ttdeci">NodeIndex Index() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00367">linear_assignment.h:367</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_1_1BipartiteLeftNodeIterator_html"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment_1_1BipartiteLeftNodeIterator.html">operations_research::LinearSumAssignment::BipartiteLeftNodeIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00359">linear_assignment.h:359</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_ad253fe3f1dd016a976d0713d8a54a0ab"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#ad253fe3f1dd016a976d0713d8a54a0ab">operations_research::LinearSumAssignment::GetMate</a></div><div class="ttdeci">NodeIndex GetMate(NodeIndex left_node) const</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00350">linear_assignment.h:350</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_accac1fc7c4ac9bff1591ec627a59a4f7"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#accac1fc7c4ac9bff1591ec627a59a4f7">operations_research::LinearSumAssignment::SetCostScalingDivisor</a></div><div class="ttdeci">void SetCostScalingDivisor(CostValue factor)</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00254">linear_assignment.h:254</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="linear__assignment_8h_html_a7e9c0b76beb761af447a08684cded9a7"><div class="ttname"><a href="linear__assignment_8h.html#a7e9c0b76beb761af447a08684cded9a7">DECLARE_int32</a></div><div class="ttdeci">DECLARE_int32(assignment_progress_logging_period)</div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_a4f658e59dd3bd0b8cd1269e19b730cee"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#a4f658e59dd3bd0b8cd1269e19b730cee">operations_research::LinearSumAssignment::~LinearSumAssignment</a></div><div class="ttdeci">~LinearSumAssignment()</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00242">linear_assignment.h:242</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_aa5f729a6274027e5e5478e4bd76603ca"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#aa5f729a6274027e5e5478e4bd76603ca">operations_research::LinearSumAssignment::Head</a></div><div class="ttdeci">NodeIndex Head(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00287">linear_assignment.h:287</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_a1286f5a02e4b2a9e89431626e12fd498"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#a1286f5a02e4b2a9e89431626e12fd498">operations_research::LinearSumAssignment::StatsString</a></div><div class="ttdeci">std::string StatsString() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00357">linear_assignment.h:357</a></div></div>
<div class="ttc" id="classoperations__research_1_1CostValueCycleHandler_html_a2fd5ecc6414d07e3456e96c0d665ae9b"><div class="ttname"><a href="classoperations__research_1_1CostValueCycleHandler.html#a2fd5ecc6414d07e3456e96c0d665ae9b">operations_research::CostValueCycleHandler::SetIndexFromIndex</a></div><div class="ttdeci">void SetIndexFromIndex(ArcIndexType source, ArcIndexType destination) const override</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l01033">linear_assignment.h:1033</a></div></div>
<div class="ttc" id="classoperations__research_1_1CostValueCycleHandler_html_ab8c76fdd7493de9946f7551ed3ca16bc"><div class="ttname"><a href="classoperations__research_1_1CostValueCycleHandler.html#ab8c76fdd7493de9946f7551ed3ca16bc">operations_research::CostValueCycleHandler::SetIndexFromTemp</a></div><div class="ttdeci">void SetIndexFromTemp(ArcIndexType destination) const override</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l01038">linear_assignment.h:1038</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_aa64fbe18913fc55f5d41182666751728"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#aa64fbe18913fc55f5d41182666751728">operations_research::LinearSumAssignment::ArcCost</a></div><div class="ttdeci">CostValue ArcCost(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00291">linear_assignment.h:291</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_afb41339280a9b3dd128f9a376ec38007"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#afb41339280a9b3dd128f9a376ec38007">operations_research::LinearSumAssignment::FinalizeSetup</a></div><div class="ttdeci">bool FinalizeSetup()</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l01388">linear_assignment.h:1388</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_ab70deec1644ce0de2f383c97830391e7"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#ab70deec1644ce0de2f383c97830391e7">operations_research::LinearSumAssignment::ArcAnnotationCycleHandler</a></div><div class="ttdeci">operations_research::PermutationCycleHandler&lt; typename GraphType::ArcIndex &gt; * ArcAnnotationCycleHandler()</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l01082">linear_assignment.h:1082</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_a11815dc60d6275c8272be0771883d573"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#a11815dc60d6275c8272be0771883d573">operations_research::LinearSumAssignment::NumLeftNodes</a></div><div class="ttdeci">NodeIndex NumLeftNodes() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00335">linear_assignment.h:335</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_aca73212d30b08a7c287c311b74311a6e"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#aca73212d30b08a7c287c311b74311a6e">operations_research::LinearSumAssignment::NodeIndex</a></div><div class="ttdeci">GraphType::NodeIndex NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00228">linear_assignment.h:228</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_1LinearSumAssignment_1_1BipartiteLeftNodeIterator_html_aa7e07ffe21ad6b4c71a0d22c65f30347"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment_1_1BipartiteLeftNodeIterator.html#aa7e07ffe21ad6b4c71a0d22c65f30347">operations_research::LinearSumAssignment::BipartiteLeftNodeIterator::Ok</a></div><div class="ttdeci">bool Ok() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00369">linear_assignment.h:369</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_a3be0f6fcc44bc6a4a1e976c1e60b31d0"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#a3be0f6fcc44bc6a4a1e976c1e60b31d0">operations_research::LinearSumAssignment::NumNodes</a></div><div class="ttdeci">NodeIndex NumNodes() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00323">linear_assignment.h:323</a></div></div>
<div class="ttc" id="linear__assignment_8h_html_aeb1d0880abde13d03b5dc361d19d8cf3"><div class="ttname"><a href="linear__assignment_8h.html#aeb1d0880abde13d03b5dc361d19d8cf3">DECLARE_int64</a></div><div class="ttdeci">DECLARE_int64(assignment_alpha)</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_1ArcIndexOrderingByTailNode_html_a6d178bcb4ffb6f497b77a9faedd8601c"><div class="ttname"><a href="classoperations__research_1_1ArcIndexOrderingByTailNode.html#a6d178bcb4ffb6f497b77a9faedd8601c">operations_research::ArcIndexOrderingByTailNode::ArcIndexOrderingByTailNode</a></div><div class="ttdeci">ArcIndexOrderingByTailNode(const GraphType &amp;graph)</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l01059">linear_assignment.h:1059</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_aa4b556b7bee4c7f3fb60781e7ebda1b2"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#aa4b556b7bee4c7f3fb60781e7ebda1b2">operations_research::LinearSumAssignment::OptimizeGraphLayout</a></div><div class="ttdeci">void OptimizeGraphLayout(GraphType *graph)</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l01088">linear_assignment.h:1088</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_a13537686f25d401f7112b9fa4f63d1ab"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#a13537686f25d401f7112b9fa4f63d1ab">operations_research::LinearSumAssignment::GetAssignmentArc</a></div><div class="ttdeci">ArcIndex GetAssignmentArc(NodeIndex left_node) const</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00338">linear_assignment.h:338</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_a28178bb3e97b7c81dc157fe283b8cd64"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#a28178bb3e97b7c81dc157fe283b8cd64">operations_research::LinearSumAssignment::ArcIndex</a></div><div class="ttdeci">GraphType::ArcIndex ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00229">linear_assignment.h:229</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_a5afb9dde1c31f5f053cc83bf6e594db0"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#a5afb9dde1c31f5f053cc83bf6e594db0">operations_research::LinearSumAssignment::GetCost</a></div><div class="ttdeci">CostValue GetCost() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l01473">linear_assignment.h:1473</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_aa9b122f6d2e28bf78a0339f26cfbd432"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#aa9b122f6d2e28bf78a0339f26cfbd432">operations_research::LinearSumAssignment::GetAssignmentCost</a></div><div class="ttdeci">CostValue GetAssignmentCost(NodeIndex node) const</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00345">linear_assignment.h:345</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_1_1BipartiteLeftNodeIterator_html_a64734b3e0ff85820aba52f5109432f51"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment_1_1BipartiteLeftNodeIterator.html#a64734b3e0ff85820aba52f5109432f51">operations_research::LinearSumAssignment::BipartiteLeftNodeIterator::BipartiteLeftNodeIterator</a></div><div class="ttdeci">BipartiteLeftNodeIterator(const GraphType &amp;graph, NodeIndex num_left_nodes)</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00361">linear_assignment.h:361</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="ebert__graph_8h_html"><div class="ttname"><a href="ebert__graph_8h.html">ebert_graph.h</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_adb325b7bb71f0f00df13383ad0b2adae"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#adb325b7bb71f0f00df13383ad0b2adae">operations_research::LinearSumAssignment::Graph</a></div><div class="ttdeci">const GraphType &amp; Graph() const</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00281">linear_assignment.h:281</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_1CostValueCycleHandler_html_a999f9e59b55e3f184efa317522f2eeb0"><div class="ttname"><a href="classoperations__research_1_1CostValueCycleHandler.html#a999f9e59b55e3f184efa317522f2eeb0">operations_research::CostValueCycleHandler::SetTempFromIndex</a></div><div class="ttdeci">void SetTempFromIndex(ArcIndexType source) override</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l01029">linear_assignment.h:1029</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html_af45fdf861fabd6a46ce230a9f6101eda"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html#af45fdf861fabd6a46ce230a9f6101eda">operations_research::LinearSumAssignment::LinearSumAssignment</a></div><div class="ttdeci">LinearSumAssignment(const GraphType &amp;graph, NodeIndex num_left_nodes)</div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00963">linear_assignment.h:963</a></div></div>
<div class="ttc" id="classoperations__research_1_1LinearSumAssignment_html"><div class="ttname"><a href="classoperations__research_1_1LinearSumAssignment.html">operations_research::LinearSumAssignment</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l00226">linear_assignment.h:226</a></div></div>
<div class="ttc" id="classoperations__research_1_1CostValueCycleHandler_html"><div class="ttname"><a href="classoperations__research_1_1CostValueCycleHandler.html">operations_research::CostValueCycleHandler</a></div><div class="ttdef"><b>Definition:</b> <a href="linear__assignment_8h_source.html#l01024">linear_assignment.h:1024</a></div></div>
2019-06-13 15:36:14 +02:00
</div><!-- fragment --></div><!-- contents -->
2019-08-07 18:01:08 -07:00
</div>
2019-06-13 15:36:14 +02:00
</div>
<div id="footer-container">
<div id="footer">
</div>
</div>
</body>
</html>