266 lines
36 KiB
HTML
266 lines
36 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_test.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">9.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('hungarian__test_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_test.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="hungarian__test_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">// Test file for hungarian.h</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span>  </div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="preprocessor">#include "<a class="code" href="hungarian_8h.html">ortools/algorithms/hungarian.h</a>"</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span>  </div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="preprocessor">#include "gtest/gtest.h"</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#include "<a class="code" href="map__util_8h.html">ortools/base/map_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#include "<a class="code" href="random_8h.html">ortools/base/random.h</a>"</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span>  </div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</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">// Generic check function that checks consistency of a linear assignment</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// result as well as whether the result is the expected one.</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"><a class="line" href="namespaceoperations__research.html#aaa8d9a49b1a63a8931a9d542c26b62d8"> 17</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#aaa8d9a49b1a63a8931a9d542c26b62d8">GenericCheck</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> expected_assignment_size,</div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>  <span class="keyword">const</span> absl::flat_hash_map<int, int>& direct_assignment,</div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  <span class="keyword">const</span> absl::flat_hash_map<int, int>& reverse_assignment,</div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_agents[], <span class="keyword">const</span> <span class="keywordtype">int</span> expected_tasks[]) {</div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>  EXPECT_EQ(expected_assignment_size, direct_assignment.size());</div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  EXPECT_EQ(expected_assignment_size, reverse_assignment.size());</div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < expected_assignment_size; ++i) {</div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  EXPECT_EQ(<a class="code" href="namespacegtl.html#abce27d097bc5680207b294bdad75f59f">gtl::FindOrDie</a>(direct_assignment, expected_agents[i]),</div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  expected_tasks[i]);</div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  EXPECT_EQ(<a class="code" href="namespacegtl.html#abce27d097bc5680207b294bdad75f59f">gtl::FindOrDie</a>(reverse_assignment, expected_tasks[i]),</div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  expected_agents[i]);</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  }</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& direct_iter : direct_assignment) {</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  EXPECT_EQ(<a class="code" href="namespacegtl.html#abce27d097bc5680207b294bdad75f59f">gtl::FindOrDie</a>(reverse_assignment, direct_iter.second),</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  direct_iter.first)</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  << direct_iter.first << <span class="stringliteral">" -> "</span> << direct_iter.second;</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</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>  </div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ab5bea9dc4042e821f42017d8a2ddb51b"> 36</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#ab5bea9dc4042e821f42017d8a2ddb51b">TestMinimization</a>(<span class="keyword">const</span> std::vector<std::vector<double> >& <a class="code" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>,</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_assignment_size,</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_agents[], <span class="keyword">const</span> <span class="keywordtype">int</span> expected_tasks[]) {</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  absl::flat_hash_map<int, int> direct_assignment;</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  absl::flat_hash_map<int, int> reverse_assignment;</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <a class="code" href="namespaceoperations__research.html#a7bc69774d7c37497e8dea11cce25ce30">MinimizeLinearAssignment</a>(<a class="code" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>, &direct_assignment, &reverse_assignment);</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  SCOPED_TRACE(<span class="stringliteral">"Minimization"</span>);</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <a class="code" href="namespaceoperations__research.html#aaa8d9a49b1a63a8931a9d542c26b62d8">GenericCheck</a>(expected_assignment_size, direct_assignment, reverse_assignment,</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  expected_agents, expected_tasks);</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> }</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  </div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a4aa4c1802c8d88cdbf4557e487a76030"> 47</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#a4aa4c1802c8d88cdbf4557e487a76030">TestMaximization</a>(<span class="keyword">const</span> std::vector<std::vector<double> >& <a class="code" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>,</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_assignment_size,</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_agents[], <span class="keyword">const</span> <span class="keywordtype">int</span> expected_tasks[]) {</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  absl::flat_hash_map<int, int> direct_assignment;</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  absl::flat_hash_map<int, int> reverse_assignment;</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <a class="code" href="namespaceoperations__research.html#a5b5b68992f8a3ad22b89d61bcbd72504">MaximizeLinearAssignment</a>(<a class="code" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>, &direct_assignment, &reverse_assignment);</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  SCOPED_TRACE(<span class="stringliteral">"Maximization"</span>);</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <a class="code" href="namespaceoperations__research.html#aaa8d9a49b1a63a8931a9d542c26b62d8">GenericCheck</a>(expected_assignment_size, direct_assignment, reverse_assignment,</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  expected_agents, expected_tasks);</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> }</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  </div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// Test on an empty matrix</span></div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  </div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13"> 60</a></span> <a class="code" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">TEST</a>(LinearAssignmentTest, NullMatrix) {</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  std::vector<std::vector<double> > <a class="code" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>;</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keyword">const</span> <span class="keywordtype">int</span>* expected_agents = NULL;</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">const</span> <span class="keywordtype">int</span>* expected_tasks = NULL;</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <a class="code" href="namespaceoperations__research.html#ab5bea9dc4042e821f42017d8a2ddb51b">TestMinimization</a>(<a class="code" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>, 0, expected_agents, expected_tasks);</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <a class="code" href="namespaceoperations__research.html#a4aa4c1802c8d88cdbf4557e487a76030">TestMaximization</a>(<a class="code" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>, 0, expected_agents, expected_tasks);</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> }</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  </div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"><a class="line" href="hungarian__test_8cc.html#a80f4349f54433856a362447ba5593906"> 68</a></span> <span class="preprocessor">#define MATRIX_TEST \</span></div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="preprocessor"> { \</span></div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="preprocessor"> std::vector<std::vector<double> > cost(kMatrixHeight); \</span></div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="preprocessor"> for (int row = 0; row < kMatrixHeight; ++row) { \</span></div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="preprocessor"> cost[row].resize(kMatrixWidth); \</span></div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="preprocessor"> for (int col = 0; col < kMatrixWidth; ++col) { \</span></div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="preprocessor"> cost[row][col] = kCost[row][col]; \</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="preprocessor"> } \</span></div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="preprocessor"> } \</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="preprocessor"> EXPECT_EQ(arraysize(expected_agents_for_min), \</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="preprocessor"> arraysize(expected_tasks_for_min)); \</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="preprocessor"> EXPECT_EQ(arraysize(expected_agents_for_max), \</span></div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="preprocessor"> arraysize(expected_tasks_for_max)); \</span></div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="preprocessor"> const int assignment_size = arraysize(expected_agents_for_max); \</span></div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="preprocessor"> TestMinimization(cost, assignment_size, expected_agents_for_min, \</span></div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="preprocessor"> expected_tasks_for_min); \</span></div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="preprocessor"> TestMaximization(cost, assignment_size, expected_agents_for_max, \</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="preprocessor"> expected_tasks_for_max); \</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="preprocessor"> }</span></div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  </div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment">// Test on a 1x1 matrix</span></div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  </div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a2cba8c207c6695f1c1c21e8901a63add"> 90</a></span> <a class="code" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">TEST</a>(LinearAssignmentTest, SizeOneMatrix) {</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> kMatrixHeight = 1;</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> kMatrixWidth = 1;</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> kCost[kMatrixHeight][kMatrixWidth] = {{4}};</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_agents_for_min[] = {0};</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_tasks_for_min[] = {0};</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_agents_for_max[] = {0};</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_tasks_for_max[] = {0};</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <a class="code" href="hungarian__test_8cc.html#a80f4349f54433856a362447ba5593906">MATRIX_TEST</a>;</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>  </div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment">// Test on a 4x4 matrix. Example taken at</span></div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// http://www.ee.oulu.fi/~mpa/matreng/eem1_2-1.htm</span></div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ad55d65140946bc20bb288a4364d9cbdb"> 103</a></span> <a class="code" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">TEST</a>(LinearAssignmentTest, Small4x4Matrix) {</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> kMatrixHeight = 4;</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> kMatrixWidth = 4;</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> kCost[kMatrixHeight][kMatrixWidth] = {{90, 75, 75, 80},</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  {35, 85, 55, 65},</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  {125, 95, 90, 105},</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  {45, 110, 95, 115}};</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_agents_for_min[] = {0, 1, 2, 3};</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_tasks_for_min[] = {3, 2, 1, 0};</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_agents_for_max[] = {0, 1, 2, 3};</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_tasks_for_max[] = {2, 1, 0, 3};</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <a class="code" href="hungarian__test_8cc.html#a80f4349f54433856a362447ba5593906">MATRIX_TEST</a>;</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> }</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  </div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// Test on a 3x4 matrix. Sub-problem of Small4x4Matrix</span></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ac690c357cab3e484126077d1a6e56bd2"> 118</a></span> <a class="code" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">TEST</a>(LinearAssignmentTest, Small3x4Matrix) {</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> kMatrixHeight = 3;</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> kMatrixWidth = 4;</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> kCost[kMatrixHeight][kMatrixWidth] = {</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  {90, 75, 75, 80}, {35, 85, 55, 65}, {125, 95, 90, 105}};</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_agents_for_min[] = {0, 1, 2};</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_tasks_for_min[] = {1, 0, 2};</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_agents_for_max[] = {0, 1, 2};</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_tasks_for_max[] = {3, 1, 0};</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <a class="code" href="hungarian__test_8cc.html#a80f4349f54433856a362447ba5593906">MATRIX_TEST</a>;</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> }</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  </div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment">// Test on a 4x3 matrix. Sub-problem of Small4x4Matrix</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ad3bcc056122d299133d834f748002690"> 131</a></span> <a class="code" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">TEST</a>(LinearAssignmentTest, Small4x3Matrix) {</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> kMatrixHeight = 4;</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> kMatrixWidth = 3;</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> kCost[kMatrixHeight][kMatrixWidth] = {</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  {90, 75, 75}, {35, 85, 55}, {125, 95, 90}, {45, 110, 95}};</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_agents_for_min[] = {0, 1, 3};</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_tasks_for_min[] = {1, 2, 0};</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_agents_for_max[] = {0, 2, 3};</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> expected_tasks_for_max[] = {2, 0, 1};</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <a class="code" href="hungarian__test_8cc.html#a80f4349f54433856a362447ba5593906">MATRIX_TEST</a>;</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> }</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  </div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="preprocessor">#undef MATRIX_TEST</span></div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  </div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> } <span class="comment">// namespace operations_research</span></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="ahungarian__test_8cc_html_a80f4349f54433856a362447ba5593906"><div class="ttname"><a href="hungarian__test_8cc.html#a80f4349f54433856a362447ba5593906">MATRIX_TEST</a></div><div class="ttdeci">#define MATRIX_TEST</div><div class="ttdef"><b>Definition:</b> <a href="hungarian__test_8cc_source.html#l00068">hungarian_test.cc:68</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
|
|
<div class="ttc" id="amap__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_abce27d097bc5680207b294bdad75f59f"><div class="ttname"><a href="namespacegtl.html#abce27d097bc5680207b294bdad75f59f">gtl::FindOrDie</a></div><div class="ttdeci">const Collection::value_type::second_type & FindOrDie(const Collection &collection, const typename Collection::value_type::first_type &key)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00206">map_util.h:206</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a4aa4c1802c8d88cdbf4557e487a76030"><div class="ttname"><a href="namespaceoperations__research.html#a4aa4c1802c8d88cdbf4557e487a76030">operations_research::TestMaximization</a></div><div class="ttdeci">void TestMaximization(const std::vector< std::vector< double > > &cost, const int expected_assignment_size, const int expected_agents[], const int expected_tasks[])</div><div class="ttdef"><b>Definition:</b> <a href="hungarian__test_8cc_source.html#l00047">hungarian_test.cc:47</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_a817553ad64738460e5c339f24fe5ea13"><div class="ttname"><a href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">operations_research::TEST</a></div><div class="ttdeci">TEST(LinearAssignmentTest, NullMatrix)</div><div class="ttdef"><b>Definition:</b> <a href="hungarian__test_8cc_source.html#l00060">hungarian_test.cc:60</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aaa8d9a49b1a63a8931a9d542c26b62d8"><div class="ttname"><a href="namespaceoperations__research.html#aaa8d9a49b1a63a8931a9d542c26b62d8">operations_research::GenericCheck</a></div><div class="ttdeci">void GenericCheck(const int expected_assignment_size, const absl::flat_hash_map< int, int > &direct_assignment, const absl::flat_hash_map< int, int > &reverse_assignment, const int expected_agents[], const int expected_tasks[])</div><div class="ttdef"><b>Definition:</b> <a href="hungarian__test_8cc_source.html#l00017">hungarian_test.cc:17</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ab5bea9dc4042e821f42017d8a2ddb51b"><div class="ttname"><a href="namespaceoperations__research.html#ab5bea9dc4042e821f42017d8a2ddb51b">operations_research::TestMinimization</a></div><div class="ttdeci">void TestMinimization(const std::vector< std::vector< double > > &cost, const int expected_assignment_size, const int expected_agents[], const int expected_tasks[])</div><div class="ttdef"><b>Definition:</b> <a href="hungarian__test_8cc_source.html#l00036">hungarian_test.cc:36</a></div></div>
|
|
<div class="ttc" id="arandom_8h_html"><div class="ttname"><a href="random_8h.html">random.h</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a75d7b5e4cab1e156cc7a2c5eba1e16f1"><div class="ttname"><a href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a></div><div class="ttdeci">int64_t cost</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00152">routing_flow.cc:152</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_80dda7a75b0dfcf996988638a63eb03a.html">algorithms</a></li><li class="navelem"><a class="el" href="hungarian__test_8cc.html">hungarian_test.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>
|