258 lines
38 KiB
HTML
258 lines
38 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: assignment.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('assignment_8h_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">assignment.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="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> <span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// Simple interface to solve the linear sum assignment problem. It</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// uses about twice as much memory as directly using the</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// LinearSumAssignment class template, but it is as fast and presents</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// a simpler interface. This is the class you should use in most</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// situations.</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// The assignment problem: Given N "left" nodes and N "right" nodes,</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// and a set of left->right arcs with integer costs, find a perfect</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// matching (i.e., each "left" node is assigned to one "right" node)</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// that minimizes the overall cost.</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// Example usage:</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// #include "ortools/graph/assignment.h"</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// SimpleLinearSumAssignment assignment;</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// for (int arc = 0; arc < num_arcs; ++arc) {</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// assignment.AddArcWithCost(head(arc), tail(arc), cost(arc));</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// }</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// if (assignment.Solve() == SimpleLinearSumAssignment::OPTIMAL) {</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// printf("A perfect matching exists.\n");</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// printf("The best possible cost is %d.\n", assignment.OptimalCost());</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// printf("An optimal assignment is:\n");</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// for (int node = 0; node < assignment.NumNodes(); ++node) {</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// printf("left node %d assigned to right node %d with cost %d.\n",</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// node,</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// assignment.RightMate(node),</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// assignment.AssignmentCost(node));</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// }</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// printf("Note that it may not be the unique optimal assignment.");</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// } else {</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// printf("There is an issue with the input or no perfect matching exists.");</span></div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// }</span></div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  </div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="preprocessor">#ifndef OR_TOOLS_GRAPH_ASSIGNMENT_H_</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="preprocessor">#define OR_TOOLS_GRAPH_ASSIGNMENT_H_</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  </div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  </div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="preprocessor">#include "<a class="code" href="ebert__graph_8h.html">ortools/graph/ebert_graph.h</a>"</span></div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  </div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  </div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_linear_sum_assignment.html"> 57</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html">SimpleLinearSumAssignment</a> {</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="comment">// The constructor takes no size.</span></div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// New node indices will be created lazily by AddArcWithCost().</span></div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html#aab0126f3961082ab46cd5b5e1a7e377c">SimpleLinearSumAssignment</a>();</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  </div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="comment">// Adds an arc from a left node to a right node with a given cost.</span></div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// * Node indices must be non-negative (>= 0). For a perfect</span></div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// matching to exist on n nodes, the values taken by "left_node"</span></div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="comment">// must cover [0, n), same for "right_node".</span></div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="comment">// * The arc cost can be any integer, negative, positive or zero.</span></div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="comment">// * After the method finishes, NumArcs() == the returned ArcIndex + 1.</span></div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <a class="code" href="namespaceoperations__research.html#aecf320bda6e95d1edaf3a546673e3e6b">ArcIndex</a> <a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html#a803958326b7485a7a8f1062f12c00698">AddArcWithCost</a>(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> left_node, <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> right_node,</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>);</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  </div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// Returns the current number of left nodes which is the same as the</span></div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// number of right nodes. This is one greater than the largest node</span></div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// index seen so far in AddArcWithCost().</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html#a3be0f6fcc44bc6a4a1e976c1e60b31d0">NumNodes</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  </div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// Returns the current number of arcs in the graph.</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <a class="code" href="namespaceoperations__research.html#aecf320bda6e95d1edaf3a546673e3e6b">ArcIndex</a> <a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html#a7898be8b7efbfe53a58fcf621cf41315">NumArcs</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  </div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">// Returns user-provided data.</span></div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="comment">// The implementation will crash if "arc" is not in [0, NumArcs()).</span></div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html#a8179543321896d01b2ab3bbd6762ddf9">LeftNode</a>(<a class="code" href="namespaceoperations__research.html#aecf320bda6e95d1edaf3a546673e3e6b">ArcIndex</a> arc) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html#ae4942782ec0c611389341c53839fd4cf">RightNode</a>(<a class="code" href="namespaceoperations__research.html#aecf320bda6e95d1edaf3a546673e3e6b">ArcIndex</a> arc) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html#a536b26b0766e3a1a113f14b3b17be248">Cost</a>(<a class="code" href="namespaceoperations__research.html#aecf320bda6e95d1edaf3a546673e3e6b">ArcIndex</a> arc) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  </div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// Solves the problem (finds the perfect matching that minimizes the</span></div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// cost) and returns the solver status.</span></div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_linear_sum_assignment.html#a67a0db04d321a74b7e7fcfd3f1a3f70b"> 88</a></span>  <span class="keyword">enum</span> <a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">Status</a> {</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_linear_sum_assignment.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad"> 89</a></span>  <a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">OPTIMAL</a>, <span class="comment">// The algorithm found a minimum-cost perfect matching.</span></div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_linear_sum_assignment.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483"> 90</a></span>  <a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">INFEASIBLE</a>, <span class="comment">// The given problem admits no perfect matching.</span></div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_linear_sum_assignment.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba63e6c2750d99f3c548e6a08bb6822fe2"> 91</a></span>  <a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba63e6c2750d99f3c548e6a08bb6822fe2">POSSIBLE_OVERFLOW</a>, <span class="comment">// Some cost magnitude is too large.</span></div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  };</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">Status</a> <a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html#ab2bc69cda9c269014178a0331780b2a0">Solve</a>();</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  </div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// Returns the cost of an assignment with minimal cost.</span></div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="comment">// This is 0 if the last Solve() didn't return OPTIMAL.</span></div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_linear_sum_assignment.html#ad39ce7ee10c34a3ce1f69f179aa4f1e9"> 97</a></span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html#ad39ce7ee10c34a3ce1f69f179aa4f1e9">OptimalCost</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> optimal_cost_; }</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  </div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// Returns the right node assigned to the given left node in the</span></div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// last solution computed by Solve(). This works only if Solve()</span></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// returned OPTIMAL.</span></div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// Note: It is possible that there is more than one optimal</span></div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// solution. The algorithm is deterministic so it will always return</span></div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// the same solution for a given problem. There is no such guarantee</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// from one code version to the next, but the code does not change</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// often.</span></div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_linear_sum_assignment.html#a00214e2ce39d15e6028bd10828ba6477"> 108</a></span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> <a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html#a00214e2ce39d15e6028bd10828ba6477">RightMate</a>(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> left_node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">return</span> arc_head_[assignment_arcs_[left_node]];</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  }</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  </div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">// Returns the cost of the arc used for "left_node"'s assignment.</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="comment">// This works only if Solve() returned OPTIMAL.</span></div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_simple_linear_sum_assignment.html#ab7875735876a2959ef189b32b8e831b5"> 114</a></span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> <a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html#ab7875735876a2959ef189b32b8e831b5">AssignmentCost</a>(<a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> left_node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">return</span> arc_cost_[assignment_arcs_[left_node]];</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  }</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  </div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <a class="code" href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">NodeIndex</a> num_nodes_;</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  std::vector<NodeIndex> arc_tail_;</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  std::vector<NodeIndex> arc_head_;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  std::vector<CostValue> arc_cost_;</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  std::vector<ArcIndex> assignment_arcs_;</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <a class="code" href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">CostValue</a> optimal_cost_;</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1_simple_linear_sum_assignment.html">SimpleLinearSumAssignment</a>);</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> };</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  </div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  </div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_GRAPH_ASSIGNMENT_H_</span></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_linear_sum_assignment_html"><div class="ttname"><a href="classoperations__research_1_1_simple_linear_sum_assignment.html">operations_research::SimpleLinearSumAssignment</a></div><div class="ttdef"><b>Definition:</b> <a href="assignment_8h_source.html#l00057">assignment.h:57</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_linear_sum_assignment_html_a00214e2ce39d15e6028bd10828ba6477"><div class="ttname"><a href="classoperations__research_1_1_simple_linear_sum_assignment.html#a00214e2ce39d15e6028bd10828ba6477">operations_research::SimpleLinearSumAssignment::RightMate</a></div><div class="ttdeci">NodeIndex RightMate(NodeIndex left_node) const</div><div class="ttdef"><b>Definition:</b> <a href="assignment_8h_source.html#l00108">assignment.h:108</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_linear_sum_assignment_html_a3be0f6fcc44bc6a4a1e976c1e60b31d0"><div class="ttname"><a href="classoperations__research_1_1_simple_linear_sum_assignment.html#a3be0f6fcc44bc6a4a1e976c1e60b31d0">operations_research::SimpleLinearSumAssignment::NumNodes</a></div><div class="ttdeci">NodeIndex NumNodes() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_2assignment_8cc_source.html#l00036">graph/assignment.cc:36</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_linear_sum_assignment_html_a536b26b0766e3a1a113f14b3b17be248"><div class="ttname"><a href="classoperations__research_1_1_simple_linear_sum_assignment.html#a536b26b0766e3a1a113f14b3b17be248">operations_research::SimpleLinearSumAssignment::Cost</a></div><div class="ttdeci">CostValue Cost(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_2assignment_8cc_source.html#l00048">graph/assignment.cc:48</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_linear_sum_assignment_html_a67a0db04d321a74b7e7fcfd3f1a3f70b"><div class="ttname"><a href="classoperations__research_1_1_simple_linear_sum_assignment.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">operations_research::SimpleLinearSumAssignment::Status</a></div><div class="ttdeci">Status</div><div class="ttdef"><b>Definition:</b> <a href="assignment_8h_source.html#l00088">assignment.h:88</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_linear_sum_assignment_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad"><div class="ttname"><a href="classoperations__research_1_1_simple_linear_sum_assignment.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">operations_research::SimpleLinearSumAssignment::OPTIMAL</a></div><div class="ttdeci">@ OPTIMAL</div><div class="ttdef"><b>Definition:</b> <a href="assignment_8h_source.html#l00089">assignment.h:89</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_linear_sum_assignment_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483"><div class="ttname"><a href="classoperations__research_1_1_simple_linear_sum_assignment.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2884fa43446c0cbc9c7a9b74d41d7483">operations_research::SimpleLinearSumAssignment::INFEASIBLE</a></div><div class="ttdeci">@ INFEASIBLE</div><div class="ttdef"><b>Definition:</b> <a href="assignment_8h_source.html#l00090">assignment.h:90</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_linear_sum_assignment_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba63e6c2750d99f3c548e6a08bb6822fe2"><div class="ttname"><a href="classoperations__research_1_1_simple_linear_sum_assignment.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba63e6c2750d99f3c548e6a08bb6822fe2">operations_research::SimpleLinearSumAssignment::POSSIBLE_OVERFLOW</a></div><div class="ttdeci">@ POSSIBLE_OVERFLOW</div><div class="ttdef"><b>Definition:</b> <a href="assignment_8h_source.html#l00091">assignment.h:91</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_linear_sum_assignment_html_a7898be8b7efbfe53a58fcf621cf41315"><div class="ttname"><a href="classoperations__research_1_1_simple_linear_sum_assignment.html#a7898be8b7efbfe53a58fcf621cf41315">operations_research::SimpleLinearSumAssignment::NumArcs</a></div><div class="ttdeci">ArcIndex NumArcs() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_2assignment_8cc_source.html#l00038">graph/assignment.cc:38</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_linear_sum_assignment_html_a803958326b7485a7a8f1062f12c00698"><div class="ttname"><a href="classoperations__research_1_1_simple_linear_sum_assignment.html#a803958326b7485a7a8f1062f12c00698">operations_research::SimpleLinearSumAssignment::AddArcWithCost</a></div><div class="ttdeci">ArcIndex AddArcWithCost(NodeIndex left_node, NodeIndex right_node, CostValue cost)</div><div class="ttdef"><b>Definition:</b> <a href="graph_2assignment_8cc_source.html#l00024">graph/assignment.cc:24</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_linear_sum_assignment_html_a8179543321896d01b2ab3bbd6762ddf9"><div class="ttname"><a href="classoperations__research_1_1_simple_linear_sum_assignment.html#a8179543321896d01b2ab3bbd6762ddf9">operations_research::SimpleLinearSumAssignment::LeftNode</a></div><div class="ttdeci">NodeIndex LeftNode(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_2assignment_8cc_source.html#l00040">graph/assignment.cc:40</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_linear_sum_assignment_html_aab0126f3961082ab46cd5b5e1a7e377c"><div class="ttname"><a href="classoperations__research_1_1_simple_linear_sum_assignment.html#aab0126f3961082ab46cd5b5e1a7e377c">operations_research::SimpleLinearSumAssignment::SimpleLinearSumAssignment</a></div><div class="ttdeci">SimpleLinearSumAssignment()</div><div class="ttdef"><b>Definition:</b> <a href="graph_2assignment_8cc_source.html#l00022">graph/assignment.cc:22</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_linear_sum_assignment_html_ab2bc69cda9c269014178a0331780b2a0"><div class="ttname"><a href="classoperations__research_1_1_simple_linear_sum_assignment.html#ab2bc69cda9c269014178a0331780b2a0">operations_research::SimpleLinearSumAssignment::Solve</a></div><div class="ttdeci">Status Solve()</div><div class="ttdef"><b>Definition:</b> <a href="graph_2assignment_8cc_source.html#l00052">graph/assignment.cc:52</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_linear_sum_assignment_html_ab7875735876a2959ef189b32b8e831b5"><div class="ttname"><a href="classoperations__research_1_1_simple_linear_sum_assignment.html#ab7875735876a2959ef189b32b8e831b5">operations_research::SimpleLinearSumAssignment::AssignmentCost</a></div><div class="ttdeci">CostValue AssignmentCost(NodeIndex left_node) const</div><div class="ttdef"><b>Definition:</b> <a href="assignment_8h_source.html#l00114">assignment.h:114</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_linear_sum_assignment_html_ad39ce7ee10c34a3ce1f69f179aa4f1e9"><div class="ttname"><a href="classoperations__research_1_1_simple_linear_sum_assignment.html#ad39ce7ee10c34a3ce1f69f179aa4f1e9">operations_research::SimpleLinearSumAssignment::OptimalCost</a></div><div class="ttdeci">CostValue OptimalCost() const</div><div class="ttdef"><b>Definition:</b> <a href="assignment_8h_source.html#l00097">assignment.h:97</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_simple_linear_sum_assignment_html_ae4942782ec0c611389341c53839fd4cf"><div class="ttname"><a href="classoperations__research_1_1_simple_linear_sum_assignment.html#ae4942782ec0c611389341c53839fd4cf">operations_research::SimpleLinearSumAssignment::RightNode</a></div><div class="ttdeci">NodeIndex RightNode(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_2assignment_8cc_source.html#l00044">graph/assignment.cc:44</a></div></div>
|
|
<div class="ttc" id="aebert__graph_8h_html"><div class="ttname"><a href="ebert__graph_8h.html">ebert_graph.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a7ae31ba4c3b4899478e53ca13df35dfc"><div class="ttname"><a href="namespaceoperations__research.html#a7ae31ba4c3b4899478e53ca13df35dfc">operations_research::NodeIndex</a></div><div class="ttdeci">int32_t NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00200">ebert_graph.h:192</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aecf320bda6e95d1edaf3a546673e3e6b"><div class="ttname"><a href="namespaceoperations__research.html#aecf320bda6e95d1edaf3a546673e3e6b">operations_research::ArcIndex</a></div><div class="ttdeci">int32_t 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="anamespaceoperations__research_html_aee97ac67f280d35acdef2c5d461a85c3"><div class="ttname"><a href="namespaceoperations__research.html#aee97ac67f280d35acdef2c5d461a85c3">operations_research::CostValue</a></div><div class="ttdeci">int64_t 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="arouting__flow_8cc_html_a75d7b5e4cab1e156cc7a2c5eba1e16f1"><div class="ttname"><a href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a></div><div class="ttdeci">int64_t cost</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00152">routing_flow.cc:152</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_725f3a5915051842f84e3ea508be2a62.html">graph</a></li><li class="navelem"><a class="el" href="assignment_8h.html">assignment.h</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|