817 lines
126 KiB
HTML
817 lines
126 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: hungarian.cc 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">8.2</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('hungarian_8cc_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">hungarian.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="hungarian_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// See: //depot/google3/java/com/google/wireless/genie/frontend</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// /mixer/matching/HungarianOptimizer.java</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  </div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include "<a class="code" href="hungarian_8h.html">ortools/algorithms/hungarian.h</a>"</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>  </div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <cstdio></span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  </div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "absl/strings/str_format.h"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  </div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  </div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_hungarian_optimizer.html"> 28</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_hungarian_optimizer.html">HungarianOptimizer</a> {</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="keyword">static</span> constexpr <span class="keywordtype">int</span> kHungarianOptimizerRowNotFound = -1;</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="keyword">static</span> constexpr <span class="keywordtype">int</span> kHungarianOptimizerColNotFound = -2;</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  </div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="comment">// Setup the initial conditions for the algorithm.</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  </div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="comment">// Parameters: costs is a matrix of the cost of assigning each agent to</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="comment">// each task. costs[i][j] is the cost of assigning agent i to task j.</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="comment">// All the costs must be non-negative. This matrix does not have to</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="comment">// be square (i.e. we can have different numbers of agents and tasks), but it</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="comment">// must be regular (i.e. there must be the same number of entries in each row</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="comment">// of the matrix).</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_hungarian_optimizer.html#a84bfc6935454125fdfa263910e7c5663">HungarianOptimizer</a>(<span class="keyword">const</span> std::vector<std::vector<double>>& costs);</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  </div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="comment">// Find an assignment which maximizes the total cost.</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="comment">// Returns the assignment in the two vectors passed as argument.</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// preimage[i] is assigned to image[i].</span></div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_hungarian_optimizer.html#af9f5df225aff9d876650f829050f78e9">Maximize</a>(std::vector<int>* preimage, std::vector<int>* image);</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="comment">// Like Maximize(), but minimizing the cost instead.</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_hungarian_optimizer.html#ab14e1591074136eb2ae00cae73c92002">Minimize</a>(std::vector<int>* preimage, std::vector<int>* image);</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="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">typedef</span> void (<a class="code" href="classoperations__research_1_1_hungarian_optimizer.html">HungarianOptimizer</a>::*Step)();</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  </div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">typedef</span> <span class="keyword">enum</span> { NONE, PRIME, STAR } Mark;</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  </div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="comment">// Convert the final cost matrix into a set of assignments of preimage->image.</span></div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// Returns the assignment in the two vectors passed as argument, the same as</span></div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// Minimize and Maximize</span></div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordtype">void</span> FindAssignments(std::vector<int>* preimage, std::vector<int>* image);</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  </div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// Is the cell (row, col) starred?</span></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordtype">bool</span> IsStarred(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> marks_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] == STAR; }</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  </div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// Mark cell (row, col) with a star</span></div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordtype">void</span> Star(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  marks_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = STAR;</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  stars_in_col_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>]++;</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  }</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  </div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">// Remove a star from cell (row, col)</span></div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordtype">void</span> UnStar(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  marks_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = NONE;</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  stars_in_col_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>]--;</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  </div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// Find a column in row 'row' containing a star, or return</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// kHungarianOptimizerColNotFound if no such column exists.</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordtype">int</span> FindStarInRow(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</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">// Find a row in column 'col' containing a star, or return</span></div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="comment">// kHungarianOptimizerRowNotFound if no such row exists.</span></div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordtype">int</span> FindStarInCol(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  </div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// Is cell (row, col) marked with a prime?</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">bool</span> IsPrimed(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> marks_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] == PRIME; }</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  </div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// Mark cell (row, col) with a prime.</span></div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordtype">void</span> Prime(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) { marks_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = PRIME; }</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  </div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// Find a column in row containing a prime, or return</span></div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// kHungarianOptimizerColNotFound if no such column exists.</span></div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordtype">int</span> FindPrimeInRow(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  </div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// Remove the prime marks_ from every cell in the matrix.</span></div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordtype">void</span> ClearPrimes();</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  </div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">// Does column col contain a star?</span></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordtype">bool</span> ColContainsStar(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> stars_in_col_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] > 0; }</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  </div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// Is row 'row' covered?</span></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordtype">bool</span> RowCovered(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> rows_covered_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>]; }</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  </div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// Cover row 'row'.</span></div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordtype">void</span> CoverRow(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) { rows_covered_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>] = <span class="keyword">true</span>; }</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  </div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// Uncover row 'row'.</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordtype">void</span> UncoverRow(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) { rows_covered_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>] = <span class="keyword">false</span>; }</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  </div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">// Is column col covered?</span></div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordtype">bool</span> ColCovered(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> cols_covered_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>]; }</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">// Cover column col.</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordtype">void</span> CoverCol(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) { cols_covered_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = <span class="keyword">true</span>; }</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  </div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// Uncover column col.</span></div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordtype">void</span> UncoverCol(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) { cols_covered_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = <span class="keyword">false</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="comment">// Uncover ever row and column in the matrix.</span></div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordtype">void</span> ClearCovers();</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  </div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="comment">// Find the smallest uncovered cell in the matrix.</span></div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordtype">double</span> FindSmallestUncovered() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  </div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="comment">// Find an uncovered zero and store its coordinates in (zeroRow_, zeroCol_)</span></div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="comment">// and return true, or return false if no such cell exists.</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordtype">bool</span> FindZero(<span class="keywordtype">int</span>* zero_row, <span class="keywordtype">int</span>* zero_col) <span class="keyword">const</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">// Print the matrix to stdout (for debugging.)</span></div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keywordtype">void</span> PrintMatrix();</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  </div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="comment">// Run the Munkres algorithm!</span></div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordtype">void</span> DoMunkres();</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  </div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="comment">// Step 1.</span></div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="comment">// For each row of the matrix, find the smallest element and subtract it</span></div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="comment">// from every element in its row. Go to Step 2.</span></div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordtype">void</span> ReduceRows();</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  </div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// Step 2.</span></div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">// Find a zero (Z) in the matrix. If there is no starred zero in its row</span></div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">// or column, star Z. Repeat for every element in the matrix. Go to step 3.</span></div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="comment">// Note: profiling shows this method to use 9.2% of the CPU - the next</span></div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">// slowest step takes 0.6%. I can't think of a way of speeding it up though.</span></div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordtype">void</span> StarZeroes();</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  </div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">// Step 3.</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// Cover each column containing a starred zero. If all columns are</span></div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="comment">// covered, the starred zeros describe a complete set of unique assignments.</span></div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="comment">// In this case, terminate the algorithm. Otherwise, go to step 4.</span></div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordtype">void</span> CoverStarredZeroes();</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  </div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="comment">// Step 4.</span></div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="comment">// Find a noncovered zero and prime it. If there is no starred zero in the</span></div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// row containing this primed zero, Go to Step 5. Otherwise, cover this row</span></div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// and uncover the column containing the starred zero. Continue in this manner</span></div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">// until there are no uncovered zeros left, then go to Step 6.</span></div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordtype">void</span> PrimeZeroes();</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  </div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="comment">// Step 5.</span></div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="comment">// Construct a series of alternating primed and starred zeros as follows.</span></div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">// Let Z0 represent the uncovered primed zero found in Step 4. Let Z1 denote</span></div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">// the starred zero in the column of Z0 (if any). Let Z2 denote the primed</span></div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="comment">// zero in the row of Z1 (there will always be one). Continue until the</span></div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="comment">// series terminates at a primed zero that has no starred zero in its column.</span></div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="comment">// Unstar each starred zero of the series, star each primed zero of the</span></div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// series, erase all primes and uncover every line in the matrix. Return to</span></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="comment">// Step 3.</span></div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordtype">void</span> MakeAugmentingPath();</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  </div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// Step 6.</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">// Add the smallest uncovered value in the matrix to every element of each</span></div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// covered row, and subtract it from every element of each uncovered column.</span></div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// Return to Step 4 without altering any stars, primes, or covered lines.</span></div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordtype">void</span> AugmentPath();</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  </div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">// The size of the problem, i.e. max(#agents, #tasks).</span></div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordtype">int</span> matrix_size_;</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  </div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">// The expanded cost matrix.</span></div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  std::vector<std::vector<double>> costs_;</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  </div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// The greatest cost in the initial cost matrix.</span></div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordtype">double</span> max_cost_;</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  </div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="comment">// Which rows and columns are currently covered.</span></div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  std::vector<bool> rows_covered_;</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  std::vector<bool> cols_covered_;</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  </div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">// The marks_ (star/prime/none) on each element of the cost matrix.</span></div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  std::vector<std::vector<Mark>> marks_;</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  </div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">// The number of stars in each column - used to speed up coverStarredZeroes.</span></div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  std::vector<int> stars_in_col_;</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  </div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="comment">// Representation of a path_ through the matrix - used in step 5.</span></div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  std::vector<int> preimage_; <span class="comment">// i.e. the agents</span></div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  std::vector<int> image_; <span class="comment">// i.e. the tasks</span></div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  </div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// The width_ and height_ of the initial (non-expanded) cost matrix.</span></div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordtype">int</span> width_;</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordtype">int</span> height_;</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  </div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// The current state of the algorithm</span></div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  HungarianOptimizer::Step state_;</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span> };</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  </div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_hungarian_optimizer.html#a84bfc6935454125fdfa263910e7c5663"> 207</a></span> <a class="code" href="classoperations__research_1_1_hungarian_optimizer.html#a84bfc6935454125fdfa263910e7c5663">HungarianOptimizer::HungarianOptimizer</a>(</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keyword">const</span> std::vector<std::vector<double>>& costs)</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  : matrix_size_(0),</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  costs_(),</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  max_cost_(0),</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  rows_covered_(),</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  cols_covered_(),</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  marks_(),</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  stars_in_col_(),</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  preimage_(),</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  image_(),</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  width_(0),</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  height_(0),</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  state_(nullptr) {</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  width_ = costs.size();</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  </div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">if</span> (width_ > 0) {</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  height_ = costs[0].size();</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  height_ = 0;</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  }</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  </div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  matrix_size_ = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(width_, height_);</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  max_cost_ = 0;</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  </div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">// Generate the expanded cost matrix by adding extra 0-valued elements in</span></div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="comment">// order to make a square matrix. At the same time, find the greatest cost</span></div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="comment">// in the matrix (used later if we want to maximize rather than minimize the</span></div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="comment">// overall cost.)</span></div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  costs_.resize(matrix_size_);</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = 0; <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  costs_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].resize(matrix_size_);</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  </div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = 0; <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = 0; <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keywordflow">if</span> ((<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> >= width_) || (<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> >= height_)) {</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  costs_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = 0;</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  costs_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = costs[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>];</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  max_cost_ = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(max_cost_, costs_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>]);</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  }</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  }</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  }</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  </div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="comment">// Initially, none of the cells of the matrix are marked.</span></div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  marks_.resize(matrix_size_);</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = 0; <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  marks_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>].resize(matrix_size_);</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = 0; <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  marks_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = NONE;</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  }</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  }</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  </div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  stars_in_col_.resize(matrix_size_);</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  </div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  rows_covered_.resize(matrix_size_);</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  cols_covered_.resize(matrix_size_);</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  </div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  preimage_.resize(matrix_size_ * 2);</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  image_.resize(matrix_size_ * 2);</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span> }</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  </div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="comment">// Find an assignment which maximizes the total cost.</span></div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="comment">// Return an array of pairs of integers. Each pair (i, j) corresponds to</span></div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span> <span class="comment">// assigning agent i to task j.</span></div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_hungarian_optimizer.html#af9f5df225aff9d876650f829050f78e9"> 273</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_hungarian_optimizer.html#af9f5df225aff9d876650f829050f78e9">HungarianOptimizer::Maximize</a>(std::vector<int>* preimage,</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  std::vector<int>* image) {</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">// Find a maximal assignment by subtracting each of the</span></div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// original costs from max_cost_ and then minimizing.</span></div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = 0; <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < width_; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = 0; <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < height_; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  costs_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = max_cost_ - costs_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>];</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  }</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  }</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <a class="code" href="classoperations__research_1_1_hungarian_optimizer.html#ab14e1591074136eb2ae00cae73c92002">Minimize</a>(preimage, image);</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span> }</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  </div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span> <span class="comment">// Find an assignment which minimizes the total cost.</span></div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span> <span class="comment">// Return an array of pairs of integers. Each pair (i, j) corresponds to</span></div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span> <span class="comment">// assigning agent i to task j.</span></div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_hungarian_optimizer.html#ab14e1591074136eb2ae00cae73c92002"> 288</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_hungarian_optimizer.html#ab14e1591074136eb2ae00cae73c92002">HungarianOptimizer::Minimize</a>(std::vector<int>* preimage,</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  std::vector<int>* image) {</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  DoMunkres();</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  FindAssignments(preimage, image);</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span> }</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  </div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="comment">// Convert the final cost matrix into a set of assignments of agents -> tasks.</span></div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="comment">// Return an array of pairs of integers, the same as the return values of</span></div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="comment">// Minimize() and Maximize()</span></div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="keywordtype">void</span> HungarianOptimizer::FindAssignments(std::vector<int>* preimage,</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  std::vector<int>* image) {</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  preimage->clear();</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  image->clear();</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = 0; <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < width_; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = 0; <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < height_; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">if</span> (IsStarred(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)) {</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  preimage->push_back(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>);</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  image->push_back(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>);</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  }</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  }</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  }</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">// TODO(user)</span></div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="comment">// result_size = min(width_, height_);</span></div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="comment">// CHECK image.size() == result_size</span></div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="comment">// CHECK preimage.size() == result_size</span></div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span> }</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  </div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span> <span class="comment">// Find a column in row 'row' containing a star, or return</span></div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="comment">// kHungarianOptimizerColNotFound if no such column exists.</span></div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span> <span class="keywordtype">int</span> HungarianOptimizer::FindStarInRow(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = 0; <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordflow">if</span> (IsStarred(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)) {</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keywordflow">return</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>;</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  }</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  }</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  </div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keywordflow">return</span> kHungarianOptimizerColNotFound;</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span> }</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  </div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span> <span class="comment">// Find a row in column 'col' containing a star, or return</span></div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <span class="comment">// kHungarianOptimizerRowNotFound if no such row exists.</span></div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="keywordtype">int</span> HungarianOptimizer::FindStarInCol(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">if</span> (!ColContainsStar(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)) {</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">return</span> kHungarianOptimizerRowNotFound;</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  }</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  </div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = 0; <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keywordflow">if</span> (IsStarred(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)) {</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keywordflow">return</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>;</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  }</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  }</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  </div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="comment">// NOTREACHED</span></div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">return</span> kHungarianOptimizerRowNotFound;</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span> }</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  </div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span> <span class="comment">// Find a column in row containing a prime, or return</span></div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span> <span class="comment">// kHungarianOptimizerColNotFound if no such column exists.</span></div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span> <span class="keywordtype">int</span> HungarianOptimizer::FindPrimeInRow(<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = 0; <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keywordflow">if</span> (IsPrimed(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)) {</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keywordflow">return</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>;</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  }</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  }</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  </div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordflow">return</span> kHungarianOptimizerColNotFound;</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span> }</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  </div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span> <span class="comment">// Remove the prime marks from every cell in the matrix.</span></div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span> <span class="keywordtype">void</span> HungarianOptimizer::ClearPrimes() {</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = 0; <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = 0; <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">if</span> (IsPrimed(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)) {</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  marks_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = NONE;</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  }</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  }</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  }</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span> }</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  </div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="comment">// Uncovery ever row and column in the matrix.</span></div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span> <span class="keywordtype">void</span> HungarianOptimizer::ClearCovers() {</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < matrix_size_; x++) {</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  UncoverRow(x);</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  UncoverCol(x);</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  }</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span> }</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  </div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span> <span class="comment">// Find the smallest uncovered cell in the matrix.</span></div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="keywordtype">double</span> HungarianOptimizer::FindSmallestUncovered()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordtype">double</span> minval = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::numeric_limits<double>::max</a>();</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  </div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = 0; <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordflow">if</span> (RowCovered(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>)) {</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  }</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  </div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = 0; <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">if</span> (ColCovered(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)) {</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  }</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  </div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  minval = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(minval, costs_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>]);</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  }</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  }</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  </div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordflow">return</span> minval;</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span> }</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  </div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span> <span class="comment">// Find an uncovered zero and store its co-ordinates in (zeroRow, zeroCol)</span></div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="comment">// and return true, or return false if no such cell exists.</span></div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="keywordtype">bool</span> HungarianOptimizer::FindZero(<span class="keywordtype">int</span>* zero_row, <span class="keywordtype">int</span>* zero_col)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = 0; <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keywordflow">if</span> (RowCovered(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>)) {</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  }</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  </div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = 0; <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keywordflow">if</span> (ColCovered(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)) {</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  }</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  </div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordflow">if</span> (costs_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] == 0) {</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  *zero_row = <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>;</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  *zero_col = <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>;</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  }</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  }</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  }</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  </div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span> }</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  </div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="comment">// Print the matrix to stdout (for debugging.)</span></div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="keywordtype">void</span> HungarianOptimizer::PrintMatrix() {</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = 0; <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = 0; <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  absl::PrintF(<span class="stringliteral">"%g "</span>, costs_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>]);</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  </div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">if</span> (IsStarred(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)) {</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  absl::PrintF(<span class="stringliteral">"*"</span>);</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  }</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  </div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">if</span> (IsPrimed(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)) {</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  absl::PrintF(<span class="stringliteral">"'"</span>);</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  }</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  }</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  absl::PrintF(<span class="stringliteral">"\n"</span>);</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  }</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span> }</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  </div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="comment">// Run the Munkres algorithm!</span></div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="keywordtype">void</span> HungarianOptimizer::DoMunkres() {</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  state_ = &HungarianOptimizer::ReduceRows;</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keywordflow">while</span> (state_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  (this->*state_)();</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  }</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span> }</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  </div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span> <span class="comment">// Step 1.</span></div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span> <span class="comment">// For each row of the matrix, find the smallest element and subtract it</span></div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span> <span class="comment">// from every element in its row. Go to Step 2.</span></div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="keywordtype">void</span> HungarianOptimizer::ReduceRows() {</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = 0; <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordtype">double</span> min_cost = costs_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][0];</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = 1; <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  min_cost = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(min_cost, costs_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>]);</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  }</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = 0; <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  costs_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] -= min_cost;</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  }</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  }</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  state_ = &HungarianOptimizer::StarZeroes;</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span> }</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  </div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span> <span class="comment">// Step 2.</span></div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span> <span class="comment">// Find a zero (Z) in the matrix. If there is no starred zero in its row</span></div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span> <span class="comment">// or column, star Z. Repeat for every element in the matrix. Go to step 3.</span></div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span> <span class="comment">// of the CPU - the next slowest step takes 0.6%. I can't think of a way</span></div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span> <span class="comment">// of speeding it up though.</span></div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span> <span class="keywordtype">void</span> HungarianOptimizer::StarZeroes() {</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="comment">// Since no rows or columns are covered on entry to this step, we use the</span></div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="comment">// covers as a quick way of marking which rows & columns have stars in them.</span></div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = 0; <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordflow">if</span> (RowCovered(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>)) {</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  }</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  </div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = 0; <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keywordflow">if</span> (ColCovered(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)) {</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  }</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  </div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordflow">if</span> (costs_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] == 0) {</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  Star(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>);</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  CoverRow(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>);</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  CoverCol(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>);</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  }</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  }</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  }</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  </div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  ClearCovers();</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  state_ = &HungarianOptimizer::CoverStarredZeroes;</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span> }</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  </div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span> <span class="comment">// Step 3.</span></div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span> <span class="comment">// Cover each column containing a starred zero. If all columns are</span></div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span> <span class="comment">// covered, the starred zeros describe a complete set of unique assignments.</span></div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span> <span class="comment">// In this case, terminate the algorithm. Otherwise, go to step 4.</span></div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span> <span class="keywordtype">void</span> HungarianOptimizer::CoverStarredZeroes() {</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordtype">int</span> num_covered = 0;</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  </div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = 0; <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">if</span> (ColContainsStar(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)) {</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  CoverCol(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>);</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  num_covered++;</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  }</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  }</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  </div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordflow">if</span> (num_covered >= matrix_size_) {</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  state_ = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  }</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  state_ = &HungarianOptimizer::PrimeZeroes;</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span> }</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  </div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span> <span class="comment">// Step 4.</span></div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span> <span class="comment">// Find a noncovered zero and prime it. If there is no starred zero in the</span></div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span> <span class="comment">// row containing this primed zero, Go to Step 5. Otherwise, cover this row</span></div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span> <span class="comment">// and uncover the column containing the starred zero. Continue in this manner</span></div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span> <span class="comment">// until there are no uncovered zeros left, then go to Step 6.</span></div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  </div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span> <span class="keywordtype">void</span> HungarianOptimizer::PrimeZeroes() {</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="comment">// This loop is guaranteed to terminate in at most matrix_size_ iterations,</span></div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="comment">// as findZero() returns a location only if there is at least one uncovered</span></div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="comment">// zero in the matrix. Each iteration, either one row is covered or the</span></div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="comment">// loop terminates. Since there are matrix_size_ rows, after that many</span></div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="comment">// iterations there are no uncovered cells and hence no uncovered zeroes,</span></div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="comment">// so the loop terminates.</span></div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keywordflow">for</span> (;;) {</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keywordtype">int</span> zero_row, zero_col;</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keywordflow">if</span> (!FindZero(&zero_row, &zero_col)) {</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="comment">// No uncovered zeroes.</span></div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  state_ = &HungarianOptimizer::AugmentPath;</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  }</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  </div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  Prime(zero_row, zero_col);</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keywordtype">int</span> star_col = FindStarInRow(zero_row);</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  </div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keywordflow">if</span> (star_col != kHungarianOptimizerColNotFound) {</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  CoverRow(zero_row);</div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  UncoverCol(star_col);</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  preimage_[0] = zero_row;</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  image_[0] = zero_col;</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  state_ = &HungarianOptimizer::MakeAugmentingPath;</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  }</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  }</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span> }</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  </div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span> <span class="comment">// Step 5.</span></div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span> <span class="comment">// Construct a series of alternating primed and starred zeros as follows.</span></div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span> <span class="comment">// Let Z0 represent the uncovered primed zero found in Step 4. Let Z1 denote</span></div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span> <span class="comment">// the starred zero in the column of Z0 (if any). Let Z2 denote the primed</span></div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span> <span class="comment">// zero in the row of Z1 (there will always be one). Continue until the</span></div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span> <span class="comment">// series terminates at a primed zero that has no starred zero in its column.</span></div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span> <span class="comment">// Unstar each starred zero of the series, star each primed zero of the</span></div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span> <span class="comment">// series, erase all primes and uncover every line in the matrix. Return to</span></div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span> <span class="comment">// Step 3.</span></div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span> <span class="keywordtype">void</span> HungarianOptimizer::MakeAugmentingPath() {</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordtype">bool</span> done = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keywordtype">int</span> count = 0;</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  </div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="comment">// Note: this loop is guaranteed to terminate within matrix_size_ iterations</span></div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="comment">// because:</span></div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="comment">// 1) on entry to this step, there is at least 1 column with no starred zero</span></div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="comment">// (otherwise we would have terminated the algorithm already.)</span></div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="comment">// 2) each row containing a star also contains exactly one primed zero.</span></div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="comment">// 4) each column contains at most one starred zero.</span></div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="comment">// Since the path_ we construct visits primed and starred zeroes alternately,</span></div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="comment">// and terminates if we reach a primed zero in a column with no star, our</span></div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="comment">// path_ must either contain matrix_size_ or fewer stars (in which case the</span></div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="comment">// loop iterates fewer than matrix_size_ times), or it contains more. In</span></div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="comment">// that case, because (1) implies that there are fewer than</span></div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="comment">// matrix_size_ stars, we must have visited at least one star more than once.</span></div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="comment">// Consider the first such star that we visit more than once; it must have</span></div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="comment">// been reached immediately after visiting a prime in the same row. By (2),</span></div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="comment">// this prime is unique and so must have also been visited more than once.</span></div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="comment">// Therefore, that prime must be in the same column as a star that has been</span></div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="comment">// visited more than once, contradicting the assumption that we chose the</span></div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="comment">// first multiply visited star, or it must be in the same column as more</span></div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="comment">// than one star, contradicting (3). Therefore, we never visit any star</span></div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="comment">// more than once and the loop terminates within matrix_size_ iterations.</span></div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  </div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keywordflow">while</span> (!done) {</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="comment">// First construct the alternating path...</span></div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = FindStarInCol(image_[count]);</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  </div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordflow">if</span> (<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> != kHungarianOptimizerRowNotFound) {</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  count++;</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  preimage_[count] = <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>;</div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  image_[count] = image_[count - 1];</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  done = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  }</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  </div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="keywordflow">if</span> (!done) {</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = FindPrimeInRow(preimage_[count]);</div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  count++;</div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  preimage_[count] = preimage_[count - 1];</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  image_[count] = <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>;</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  }</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  }</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  </div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="comment">// Then modify it.</span></div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i <= count; ++i) {</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = preimage_[i];</div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = image_[i];</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  </div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keywordflow">if</span> (IsStarred(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)) {</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  UnStar(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>);</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  Star(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>);</div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  }</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  }</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  </div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  ClearCovers();</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  ClearPrimes();</div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  state_ = &HungarianOptimizer::CoverStarredZeroes;</div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span> }</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  </div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span> <span class="comment">// Step 6</span></div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span> <span class="comment">// Add the smallest uncovered value in the matrix to every element of each</span></div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span> <span class="comment">// covered row, and subtract it from every element of each uncovered column.</span></div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span> <span class="comment">// Return to Step 4 without altering any stars, primes, or covered lines.</span></div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span> <span class="keywordtype">void</span> HungarianOptimizer::AugmentPath() {</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="keywordtype">double</span> minval = FindSmallestUncovered();</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  </div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = 0; <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>) {</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = 0; <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < matrix_size_; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keywordflow">if</span> (RowCovered(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>)) {</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  costs_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] += minval;</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  }</div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  </div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="keywordflow">if</span> (!ColCovered(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>)) {</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  costs_[<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>][<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] -= minval;</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  }</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  }</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  }</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  </div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  state_ = &HungarianOptimizer::PrimeZeroes;</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span> }</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  </div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ad2f70b568650cff5c9a578485a83d154"> 645</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research.html#ad2f70b568650cff5c9a578485a83d154">InputContainsNan</a>(<span class="keyword">const</span> std::vector<std::vector<double>>& <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>) {</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& subvector : <a class="code" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>) {</div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& num : subvector) {</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="keywordflow">if</span> (std::isnan(num)) {</div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ac9bcbe19995a8140cd4ec61773cd6e67">ERROR</a>) << <span class="stringliteral">"The provided input contains "</span> << num << <span class="stringliteral">"."</span>;</div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  }</div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  }</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  }</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span> }</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  </div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a7bc69774d7c37497e8dea11cce25ce30"> 657</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#a7bc69774d7c37497e8dea11cce25ce30">MinimizeLinearAssignment</a>(</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keyword">const</span> std::vector<std::vector<double>>& <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>,</div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  absl::flat_hash_map<int, int>* direct_assignment,</div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  absl::flat_hash_map<int, int>* reverse_assignment) {</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#ad2f70b568650cff5c9a578485a83d154">InputContainsNan</a>(<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>)) {</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ac9bcbe19995a8140cd4ec61773cd6e67">ERROR</a>) << <span class="stringliteral">"Returning before invoking the Hungarian optimizer."</span>;</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  }</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  std::vector<int> agent;</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  std::vector<int> task;</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <a class="code" href="classoperations__research_1_1_hungarian_optimizer.html">HungarianOptimizer</a> hungarian_optimizer(<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>);</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  hungarian_optimizer.<a class="code" href="classoperations__research_1_1_hungarian_optimizer.html#ab14e1591074136eb2ae00cae73c92002">Minimize</a>(&agent, &task);</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < agent.size(); ++i) {</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  (*direct_assignment)[agent[i]] = task[i];</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  (*reverse_assignment)[task[i]] = agent[i];</div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  }</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span> }</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  </div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a5b5b68992f8a3ad22b89d61bcbd72504"> 675</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#a5b5b68992f8a3ad22b89d61bcbd72504">MaximizeLinearAssignment</a>(</div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keyword">const</span> std::vector<std::vector<double>>& <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>,</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  absl::flat_hash_map<int, int>* direct_assignment,</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  absl::flat_hash_map<int, int>* reverse_assignment) {</div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#ad2f70b568650cff5c9a578485a83d154">InputContainsNan</a>(<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>)) {</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ac9bcbe19995a8140cd4ec61773cd6e67">ERROR</a>) << <span class="stringliteral">"Returning before invoking the Hungarian optimizer."</span>;</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  }</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  std::vector<int> agent;</div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  std::vector<int> task;</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <a class="code" href="classoperations__research_1_1_hungarian_optimizer.html">HungarianOptimizer</a> hungarian_optimizer(<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>);</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  hungarian_optimizer.<a class="code" href="classoperations__research_1_1_hungarian_optimizer.html#af9f5df225aff9d876650f829050f78e9">Maximize</a>(&agent, &task);</div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < agent.size(); ++i) {</div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  (*direct_assignment)[agent[i]] = task[i];</div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  (*reverse_assignment)[task[i]] = agent[i];</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  }</div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span> }</div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  </div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a021e695f54a13bd809c34b2f4ca87c37"><div class="ttname"><a href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">min</a></div><div class="ttdeci">int64 min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00138">alldiff_cst.cc:138</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a9d0c202d5fdd62f4fa2c613339ff168a"><div class="ttname"><a href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">max</a></div><div class="ttdeci">int64 max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00420">base/logging.h:420</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_hungarian_optimizer_html"><div class="ttname"><a href="classoperations__research_1_1_hungarian_optimizer.html">operations_research::HungarianOptimizer</a></div><div class="ttdef"><b>Definition:</b> <a href="hungarian_8cc_source.html#l00028">hungarian.cc:28</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_hungarian_optimizer_html_a84bfc6935454125fdfa263910e7c5663"><div class="ttname"><a href="classoperations__research_1_1_hungarian_optimizer.html#a84bfc6935454125fdfa263910e7c5663">operations_research::HungarianOptimizer::HungarianOptimizer</a></div><div class="ttdeci">HungarianOptimizer(const std::vector< std::vector< double >> &costs)</div><div class="ttdef"><b>Definition:</b> <a href="hungarian_8cc_source.html#l00207">hungarian.cc:207</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_hungarian_optimizer_html_ab14e1591074136eb2ae00cae73c92002"><div class="ttname"><a href="classoperations__research_1_1_hungarian_optimizer.html#ab14e1591074136eb2ae00cae73c92002">operations_research::HungarianOptimizer::Minimize</a></div><div class="ttdeci">void Minimize(std::vector< int > *preimage, std::vector< int > *image)</div><div class="ttdef"><b>Definition:</b> <a href="hungarian_8cc_source.html#l00288">hungarian.cc:288</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_hungarian_optimizer_html_af9f5df225aff9d876650f829050f78e9"><div class="ttname"><a href="classoperations__research_1_1_hungarian_optimizer.html#af9f5df225aff9d876650f829050f78e9">operations_research::HungarianOptimizer::Maximize</a></div><div class="ttdeci">void Maximize(std::vector< int > *preimage, std::vector< int > *image)</div><div class="ttdef"><b>Definition:</b> <a href="hungarian_8cc_source.html#l00273">hungarian.cc:273</a></div></div>
|
|
<div class="ttc" id="ahungarian_8h_html"><div class="ttname"><a href="hungarian_8h.html">hungarian.h</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_ac9bcbe19995a8140cd4ec61773cd6e67"><div class="ttname"><a href="log__severity_8h.html#ac9bcbe19995a8140cd4ec61773cd6e67">ERROR</a></div><div class="ttdeci">const int ERROR</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00032">log_severity.h:32</a></div></div>
|
|
<div class="ttc" id="amarkowitz_8cc_html_aa9d6c98fdf8d89b0e2321fda02adc82c"><div class="ttname"><a href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a></div><div class="ttdeci">ColIndex col</div><div class="ttdef"><b>Definition:</b> <a href="markowitz_8cc_source.html#l00176">markowitz.cc:176</a></div></div>
|
|
<div class="ttc" id="amarkowitz_8cc_html_aea35f36ba98d5bbd8d033382f50c9e52"><div class="ttname"><a href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a></div><div class="ttdeci">RowIndex row</div><div class="ttdef"><b>Definition:</b> <a href="markowitz_8cc_source.html#l00175">markowitz.cc:175</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">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</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_a5b5b68992f8a3ad22b89d61bcbd72504"><div class="ttname"><a href="namespaceoperations__research.html#a5b5b68992f8a3ad22b89d61bcbd72504">operations_research::MaximizeLinearAssignment</a></div><div class="ttdeci">void MaximizeLinearAssignment(const std::vector< std::vector< double >> &cost, absl::flat_hash_map< int, int > *direct_assignment, absl::flat_hash_map< int, int > *reverse_assignment)</div><div class="ttdef"><b>Definition:</b> <a href="hungarian_8cc_source.html#l00675">hungarian.cc:675</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a7bc69774d7c37497e8dea11cce25ce30"><div class="ttname"><a href="namespaceoperations__research.html#a7bc69774d7c37497e8dea11cce25ce30">operations_research::MinimizeLinearAssignment</a></div><div class="ttdeci">void MinimizeLinearAssignment(const std::vector< std::vector< double >> &cost, absl::flat_hash_map< int, int > *direct_assignment, absl::flat_hash_map< int, int > *reverse_assignment)</div><div class="ttdef"><b>Definition:</b> <a href="hungarian_8cc_source.html#l00657">hungarian.cc:657</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ad2f70b568650cff5c9a578485a83d154"><div class="ttname"><a href="namespaceoperations__research.html#ad2f70b568650cff5c9a578485a83d154">operations_research::InputContainsNan</a></div><div class="ttdeci">bool InputContainsNan(const std::vector< std::vector< double >> &input)</div><div class="ttdef"><b>Definition:</b> <a href="hungarian_8cc_source.html#l00645">hungarian.cc:645</a></div></div>
|
|
<div class="ttc" id="aparser_8yy_8cc_html_a5a634cf4429798b1c921a81de8250051"><div class="ttname"><a href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a></div><div class="ttdeci">static int input(yyscan_t yyscanner)</div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a26a8cbbc7bcf4117c2bf65104b4a54b4"><div class="ttname"><a href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a></div><div class="ttdeci">int64 cost</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00130">routing_flow.cc:130</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_80dda7a75b0dfcf996988638a63eb03a.html">algorithms</a></li><li class="navelem"><a class="el" href="hungarian_8cc.html">hungarian.cc</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>
|