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

165 lines
206 KiB
HTML
Raw Normal View History

2019-06-13 15:36:14 +02:00
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<title>OR-Tools</title>
<meta http-equiv="Content-Type" content="text/html;"/>
<meta charset="utf-8"/>
<!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
2020-09-01 16:00:33 +02:00
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
2019-06-13 15:36:14 +02:00
</head>
<body>
<div id="banner-container">
<div id="banner">
2021-09-20 15:57:27 +02:00
<span id="sfml">Google OR-Tools 9.1</span>
2019-06-13 15:36:14 +02:00
</div>
</div>
2019-08-07 18:01:08 -07:00
<div id="content" style="width: 100%; overflow: hidden;">
<div style="margin-left: 15px; margin-top: 5px; float: left; color: #145A32;">
2019-08-12 09:16:03 -07:00
<h2>C++ Reference</h2>
2019-08-07 18:01:08 -07:00
<ul>
<li><a href="../cpp_algorithms/annotated.html">Algorithms</a></li>
2019-08-12 09:16:03 -07:00
<li><a href="../cpp_sat/annotated.html">CP-SAT</a></li>
2019-08-07 18:01:08 -07:00
<li><a href="../cpp_graph/annotated.html">Graph</a></li>
<li><a href="../cpp_routing/annotated.html">Routing</a></li>
<li><a href="../cpp_linear/annotated.html">Linear solver</a></li>
</ul>
</div>
2019-06-13 15:36:14 +02:00
<div id="content">
2019-08-07 18:01:08 -07:00
<div align="center">
<h1 style="color: #145A32;">C++ Reference: Graph</h1>
</div>
2021-09-20 15:57:27 +02:00
<!-- Generated by Doxygen 1.8.15 -->
2020-09-01 16:00:33 +02:00
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
2021-09-20 15:57:27 +02:00
var searchBox = new SearchBox("searchBox", "search",false,'Search');
2020-09-01 16:00:33 +02:00
/* @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&amp;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">
2019-06-13 15:36:14 +02:00
</div>
2019-07-12 13:25:23 -07:00
</div>
2020-09-01 16:00:33 +02:00
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
2021-09-20 15:57:27 +02:00
$(document).ready(function(){initNavTree('hamiltonian__path_8h_source.html','');});
2020-09-01 16:00:33 +02:00
/* @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>
2019-06-13 15:36:14 +02:00
<div class="header">
<div class="headertitle">
<div class="title">hamiltonian_path.h</div> </div>
</div><!--header-->
<div class="contents">
2021-09-20 15:57:27 +02:00
<a href="hamiltonian__path_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span>&#160;<span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment">// Licensed under the Apache License, Version 2.0 (the &quot;License&quot;);</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span>&#160;<span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span>&#160;<span class="comment">// distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span>&#160;<span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span>&#160;<span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160;</div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="preprocessor">#ifndef OR_TOOLS_GRAPH_HAMILTONIAN_PATH_H_</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="preprocessor">#define OR_TOOLS_GRAPH_HAMILTONIAN_PATH_H_</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;</div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="comment">// Solves the Shortest Hamiltonian Path Problem using a complete algorithm.</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160;<span class="comment">// The algorithm was first described in</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="comment">// M. Held, R.M. Karp, A dynamic programming approach to sequencing problems,</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160;<span class="comment">// J. SIAM 10 (1962) 196-210</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160;<span class="comment">//</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160;<span class="comment">// The Shortest Hamiltonian Path Problem (SHPP) is similar to the Traveling</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160;<span class="comment">// Salesperson Problem (TSP).</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160;<span class="comment">// You have to visit all the cities, starting from a given one and you</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160;<span class="comment">// do not need to return to your starting point. With the TSP, you can start</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</
<div class="ttc" id="classoperations__research_1_1_lattice_memory_manager_html_a91814684a688a3264fc8f29972969d61"><div class="ttname"><a href="classoperations__research_1_1_lattice_memory_manager.html#a91814684a688a3264fc8f29972969d61">operations_research::LatticeMemoryManager::SetValueAtOffset</a></div><div class="ttdeci">void SetValueAtOffset(uint64_t offset, CostType value)</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00324">hamiltonian_path.h:324</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_range_iterator_html_ad82623d8471ab5eb30f4e19bc89796b9"><div class="ttname"><a href="classoperations__research_1_1_set_range_iterator.html#ad82623d8471ab5eb30f4e19bc89796b9">operations_research::SetRangeIterator::SetRangeIterator</a></div><div class="ttdeci">SetRangeIterator(const SetType set)</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00230">hamiltonian_path.h:230</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_afe05ca596cfc024da65cf61a79812a2f"><div class="ttname"><a href="classoperations__research_1_1_set.html#afe05ca596cfc024da65cf61a79812a2f">operations_research::Set::AddElement</a></div><div class="ttdeci">Set AddElement(int n) const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00156">hamiltonian_path.h:156</a></div></div>
<div class="ttc" id="classoperations__research_1_1_hamiltonian_path_solver_html_a0b31a8637cf8c0fb125444577e6ad92b"><div class="ttname"><a href="classoperations__research_1_1_hamiltonian_path_solver.html#a0b31a8637cf8c0fb125444577e6ad92b">operations_research::HamiltonianPathSolver::HamiltonianCost</a></div><div class="ttdeci">CostType HamiltonianCost(int end_node)</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00838">hamiltonian_path.h:838</a></div></div>
<div class="ttc" id="classoperations__research_1_1_lattice_memory_manager_html_afc715a6711310680640765eb66822f8b"><div class="ttname"><a href="classoperations__research_1_1_lattice_memory_manager.html#afc715a6711310680640765eb66822f8b">operations_research::LatticeMemoryManager::ValueAtOffset</a></div><div class="ttdeci">CostType ValueAtOffset(uint64_t offset) const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00334">hamiltonian_path.h:334</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_abb2b3831b27fd81d60fb39ad01e108a3"><div class="ttname"><a href="classoperations__research_1_1_set.html#abb2b3831b27fd81d60fb39ad01e108a3">operations_research::Set::SmallestElement</a></div><div class="ttdeci">int SmallestElement() const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00176">hamiltonian_path.h:176</a></div></div>
<div class="ttc" id="classoperations__research_1_1_hamiltonian_path_solver_html_ad20cbbfc6081d40231920c3c9543f97e"><div class="ttname"><a href="classoperations__research_1_1_hamiltonian_path_solver.html#ad20cbbfc6081d40231920c3c9543f97e">operations_research::HamiltonianPathSolver::BestHamiltonianPathEndNode</a></div><div class="ttdeci">int BestHamiltonianPathEndNode()</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00832">hamiltonian_path.h:832</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_a715b0dbb9f0903ab629b8c6da1b35b45"><div class="ttname"><a href="namespaceoperations__research.html#a715b0dbb9f0903ab629b8c6da1b35b45">operations_research::MakeHamiltonianPathSolver</a></div><div class="ttdeci">HamiltonianPathSolver&lt; CostType, CostFunction &gt; MakeHamiltonianPathSolver(int num_nodes, CostFunction cost)</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00600">hamiltonian_path.h:600</a></div></div>
<div class="ttc" id="classoperations__research_1_1_hamiltonian_path_solver_html"><div class="ttname"><a href="classoperations__research_1_1_hamiltonian_path_solver.html">operations_research::HamiltonianPathSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00454">hamiltonian_path.h:454</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_a67d03a6e5178376e21bdfa720680e447"><div class="ttname"><a href="classoperations__research_1_1_set.html#a67d03a6e5178376e21bdfa720680e447">operations_research::Set::end</a></div><div class="ttdeci">ElementIterator&lt; Set &gt; end() const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00202">hamiltonian_path.h:202</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_range_iterator_html_a0e4b89b4bb1b1a5bb3c799938380aeb0"><div class="ttname"><a href="classoperations__research_1_1_set_range_iterator.html#a0e4b89b4bb1b1a5bb3c799938380aeb0">operations_research::SetRangeIterator::SetType</a></div><div class="ttdeci">SetRange::SetType SetType</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00227">hamiltonian_path.h:227</a></div></div>
<div class="ttc" id="classoperations__research_1_1_pruning_hamiltonian_solver_html_a4772bfe5f78a696373e531ba983bc695"><div class="ttname"><a href="classoperations__research_1_1_pruning_hamiltonian_solver.html#a4772bfe5f78a696373e531ba983bc695">operations_research::PruningHamiltonianSolver::PruningHamiltonianSolver</a></div><div class="ttdeci">PruningHamiltonianSolver(CostFunction cost)</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00933">hamiltonian_path.h:933</a></div></div>
<div class="ttc" id="classoperations__research_1_1_lattice_memory_manager_html_a1958048f654b22c744e32dfbcdbeb416"><div class="ttname"><a href="classoperations__research_1_1_lattice_memory_manager.html#a1958048f654b22c744e32dfbcdbeb416">operations_research::LatticeMemoryManager::Offset</a></div><div class="ttdeci">uint64_t Offset(Set s, int node) const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00432">hamiltonian_path.h:432</a></div></div>
<div class="ttc" id="classoperations__research_1_1_lattice_memory_manager_html_aab77eae51a0b3e7781df913213ff4372"><div class="ttname"><a href="classoperations__research_1_1_lattice_memory_manager.html#aab77eae51a0b3e7781df913213ff4372">operations_research::LatticeMemoryManager::Value</a></div><div class="ttdeci">CostType Value(Set s, int node) const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00438">hamiltonian_path.h:438</a></div></div>
<div class="ttc" id="classoperations__research_1_1_hamiltonian_path_solver_html_a346635bd62f6d557d98e490ff2f3f306"><div class="ttname"><a href="classoperations__research_1_1_hamiltonian_path_solver.html#a346635bd62f6d557d98e490ff2f3f306">operations_research::HamiltonianPathSolver::Integer</a></div><div class="ttdeci">uint32_t Integer</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00476">hamiltonian_path.h:476</a></div></div>
<div class="ttc" id="classoperations__research_1_1_element_iterator_html_a6eb44ef439441ada8ffaaf6ee33a9c40"><div class="ttname"><a href="classoperations__research_1_1_element_iterator.html#a6eb44ef439441ada8ffaaf6ee33a9c40">operations_research::ElementIterator::operator++</a></div><div class="ttdeci">const ElementIterator &amp; operator++()</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00116">hamiltonian_path.h:116</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_a450e5cf964a0b2c866641c8f4e4b3361"><div class="ttname"><a href="classoperations__research_1_1_set.html#a450e5cf964a0b2c866641c8f4e4b3361">operations_research::Set::Set</a></div><div class="ttdeci">Set(Integer n)</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00139">hamiltonian_path.h:139</a></div></div>
<div class="ttc" id="classoperations__research_1_1_lattice_memory_manager_html"><div class="ttname"><a href="classoperations__research_1_1_lattice_memory_manager.html">operations_research::LatticeMemoryManager</a></div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00292">hamiltonian_path.h:292</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_a879ebf910431019a01f98d0865749c8d"><div class="ttname"><a href="classoperations__research_1_1_set.html#a879ebf910431019a01f98d0865749c8d">operations_research::Set::Cardinality</a></div><div class="ttdeci">int Cardinality() const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00172">hamiltonian_path.h:172</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_a983cf4555b2577512febcc3aa327a3c8"><div class="ttname"><a href="classoperations__research_1_1_set.html#a983cf4555b2577512febcc3aa327a3c8">operations_research::Set::value</a></div><div class="ttdeci">Integer value() const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00145">hamiltonian_path.h:145</a></div></div>
<div class="ttc" id="classoperations__research_1_1_pruning_hamiltonian_solver_html_a0b31a8637cf8c0fb125444577e6ad92b"><div class="ttname"><a href="classoperations__research_1_1_pruning_hamiltonian_solver.html#a0b31a8637cf8c0fb125444577e6ad92b">operations_research::PruningHamiltonianSolver::HamiltonianCost</a></div><div class="ttdeci">CostType HamiltonianCost(int end_node)</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l01007">hamiltonian_path.h:1007</a></div></div>
<div class="ttc" id="classoperations__research_1_1_lattice_memory_manager_html_af4a801d214f8a294a6abf462ac12e80a"><div class="ttname"><a href="classoperations__research_1_1_lattice_memory_manager.html#af4a801d214f8a294a6abf462ac12e80a">operations_research::LatticeMemoryManager::BaseOffset</a></div><div class="ttdeci">uint64_t BaseOffset(int card, Set s) const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00408">hamiltonian_path.h:408</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_a33392f61ea41062250f3664a055cd3bf"><div class="ttname"><a href="classoperations__research_1_1_set.html#a33392f61ea41062250f3664a055cd3bf">operations_research::Set::ElementRank</a></div><div class="ttdeci">int ElementRank(int n) const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00184">hamiltonian_path.h:184</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_a9c628cec54eb559f322c284c096f1837"><div class="ttname"><a href="classoperations__research_1_1_set.html#a9c628cec54eb559f322c284c096f1837">operations_research::Set::Includes</a></div><div class="ttdeci">bool Includes(Set other) const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00166">hamiltonian_path.h:166</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_abbfaa99a45c4a90475cb2f5138f9a162"><div class="ttname"><a href="classoperations__research_1_1_set.html#abbfaa99a45c4a90475cb2f5138f9a162">operations_research::Set::Singleton</a></div><div class="ttdeci">static Set Singleton(Integer n)</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00152">hamiltonian_path.h:152</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_range_iterator_html_a9a69c0a346336b270178d60cd6da6404"><div class="ttname"><a href="classoperations__research_1_1_set_range_iterator.html#a9a69c0a346336b270178d60cd6da6404">operations_research::SetRangeIterator::operator!=</a></div><div class="ttdeci">bool operator!=(const SetRangeIterator &amp;other) const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00234">hamiltonian_path.h:234</a></div></div>
<div class="ttc" id="classoperations__research_1_1_element_iterator_html_a9cf56c599b564897633c67574e2e460b"><div class="ttname"><a href="classoperations__research_1_1_element_iterator.html#a9cf56c599b564897633c67574e2e460b">operations_research::ElementIterator::operator *</a></div><div class="ttdeci">int operator *() const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00113">hamiltonian_path.h:113</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_aabbec0d4f2a126cbdd6c1bce67b7cc8b"><div class="ttname"><a href="classoperations__research_1_1_set.html#aabbec0d4f2a126cbdd6c1bce67b7cc8b">operations_research::Set::IntegerType</a></div><div class="ttdeci">Integer IntegerType</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00131">hamiltonian_path.h:131</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_a31dd4f4c450a217b20db6d8389d71a4e"><div class="ttname"><a href="classoperations__research_1_1_set.html#a31dd4f4c450a217b20db6d8389d71a4e">operations_research::Set::SingletonRank</a></div><div class="ttdeci">int SingletonRank(Set singleton) const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00193">hamiltonian_path.h:193</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_range_with_cardinality_html_af7124add76feb58bf035c3375fe140f9"><div class="ttname"><a href="classoperations__research_1_1_set_range_with_cardinality.html#af7124add76feb58bf035c3375fe140f9">operations_research::SetRangeWithCardinality::end</a></div><div class="ttdeci">SetRangeIterator&lt; SetRangeWithCardinality &gt; end() const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00277">hamiltonian_path.h:277</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_a0faec65dbf29460ec59dfa75d0536efb"><div class="ttname"><a href="classoperations__research_1_1_set.html#a0faec65dbf29460ec59dfa75d0536efb">operations_research::Set::Contains</a></div><div class="ttdeci">bool Contains(int n) const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00163">hamiltonian_path.h:163</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_range_iterator_html_ab199aaba95428b8647f6bfdd83ecb68c"><div class="ttname"><a href="classoperations__research_1_1_set_range_iterator.html#ab199aaba95428b8647f6bfdd83ecb68c">operations_research::SetRangeIterator::operator++</a></div><div class="ttdeci">const SetRangeIterator &amp; operator++()</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00241">hamiltonian_path.h:241</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_range_iterator_html"><div class="ttname"><a href="classoperations__research_1_1_set_range_iterator.html">operations_research::SetRangeIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00224">hamiltonian_path.h:224</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_a5865d6398576a8e71b0f346e79c583e7"><div class="ttname"><a href="classoperations__research_1_1_set.html#a5865d6398576a8e71b0f346e79c583e7">operations_research::Set::RemoveSmallestElement</a></div><div class="ttdeci">Set RemoveSmallestElement() const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00180">hamiltonian_path.h:180</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_ae7cd733dab92b86a3aaac89c4d49503f"><div class="ttname"><a href="classoperations__research_1_1_set.html#ae7cd733dab92b86a3aaac89c4d49503f">operations_research::Set::FullSet</a></div><div class="ttdeci">static Set FullSet(Integer card)</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00147">hamiltonian_path.h:147</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_ac2fa078fad730b08d36dc600a24e21a1"><div class="ttname"><a href="classoperations__research_1_1_set.html#ac2fa078fad730b08d36dc600a24e21a1">operations_research::Set::Zero</a></div><div class="ttdeci">static constexpr Integer Zero</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00135">hamiltonian_path.h:135</a></div></div>
<div class="ttc" id="classoperations__research_1_1_hamiltonian_path_solver_html_ab558649a26fef3a74f0909ef5af45e90"><div class="ttname"><a href="classoperations__research_1_1_hamiltonian_path_solver.html#ab558649a26fef3a74f0909ef5af45e90">operations_research::HamiltonianPathSolver::TravelingSalesmanCost</a></div><div class="ttdeci">CostType TravelingSalesmanCost()</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00859">hamiltonian_path.h:859</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html"><div class="ttname"><a href="classoperations__research_1_1_set.html">operations_research::Set</a></div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00128">hamiltonian_path.h:128</a></div></div>
<div class="ttc" id="classoperations__research_1_1_element_iterator_html"><div class="ttname"><a href="classoperations__research_1_1_element_iterator.html">operations_research::ElementIterator</a></div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00105">hamiltonian_path.h:105</a></div></div>
<div class="ttc" id="classoperations__research_1_1_element_iterator_html_a0a290cf047b502171a3d1770cd194c52"><div class="ttname"><a href="classoperations__research_1_1_element_iterator.html#a0a290cf047b502171a3d1770cd194c52">operations_research::ElementIterator::ElementIterator</a></div><div class="ttdeci">ElementIterator(Set set)</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00107">hamiltonian_path.h:107</a></div></div>
<div class="ttc" id="classoperations__research_1_1_lattice_memory_manager_html_a6789c7b14fc935d7e3d03e1376cb79d8"><div class="ttname"><a href="classoperations__research_1_1_lattice_memory_manager.html#a6789c7b14fc935d7e3d03e1376cb79d8">operations_research::LatticeMemoryManager::OffsetDelta</a></div><div class="ttdeci">uint64_t OffsetDelta(int card, int added_node, int removed_node, int rank) const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00311">hamiltonian_path.h:311</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_a190d6e916c3a1a06e2eff670e8b52da8"><div class="ttname"><a href="classoperations__research_1_1_set.html#a190d6e916c3a1a06e2eff670e8b52da8">operations_research::Set::RemoveElement</a></div><div class="ttdeci">Set RemoveElement(int n) const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00160">hamiltonian_path.h:160</a></div></div>
<div class="ttc" id="classoperations__research_1_1_hamiltonian_path_solver_html_a9c8cdf78154ae6a73f4a272cb8d1ac4a"><div class="ttname"><a href="classoperations__research_1_1_hamiltonian_path_solver.html#a9c8cdf78154ae6a73f4a272cb8d1ac4a">operations_research::HamiltonianPathSolver::HamiltonianPathSolver</a></div><div class="ttdeci">HamiltonianPathSolver(CostFunction cost)</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00607">hamiltonian_path.h:607</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_range_with_cardinality_html_a24d9704faf4d419fdabbde6a716e181d"><div class="ttname"><a href="classoperations__research_1_1_set_range_with_cardinality.html#a24d9704faf4d419fdabbde6a716e181d">operations_research::SetRangeWithCardinality::begin</a></div><div class="ttdeci">SetRangeIterator&lt; SetRangeWithCardinality &gt; begin() const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00274">hamiltonian_path.h:274</a></div></div>
<div class="ttc" id="classoperations__research_1_1_hamiltonian_path_solver_html_a326a998ed18bedda49bd2cab5cbd4079"><div class="ttname"><a href="classoperations__research_1_1_hamiltonian_path_solver.html#a326a998ed18bedda49bd2cab5cbd4079">operations_research::HamiltonianPathSolver::TravelingSalesmanPath</a></div><div class="ttdeci">std::vector&lt; int &gt; TravelingSalesmanPath()</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00866">hamiltonian_path.h:866</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_a191fa6bb5261ddd97d311ccc1d90fe7c"><div class="ttname"><a href="classoperations__research_1_1_set.html#a191fa6bb5261ddd97d311ccc1d90fe7c">operations_research::Set::begin</a></div><div class="ttdeci">ElementIterator&lt; Set &gt; begin() const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00199">hamiltonian_path.h:199</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_range_with_cardinality_html_ac04647d141301b9671da400a7add8e37"><div class="ttname"><a href="classoperations__research_1_1_set_range_with_cardinality.html#ac04647d141301b9671da400a7add8e37">operations_research::SetRangeWithCardinality::SetType</a></div><div class="ttdeci">Set SetType</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00260">hamiltonian_path.h:260</a></div></div>
<div class="ttc" id="classoperations__research_1_1_pruning_hamiltonian_solver_html"><div class="ttname"><a href="classoperations__research_1_1_pruning_hamiltonian_solver.html">operations_research::PruningHamiltonianSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00878">hamiltonian_path.h:878</a></div></div>
<div class="ttc" id="classoperations__research_1_1_lattice_memory_manager_html_a9614dfea1a66f5d18799a058adc57a95"><div class="ttname"><a href="classoperations__research_1_1_lattice_memory_manager.html#a9614dfea1a66f5d18799a058adc57a95">operations_research::LatticeMemoryManager::Init</a></div><div class="ttdeci">void Init(int max_card)</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00358">hamiltonian_path.h:358</a></div></div>
<div class="ttc" id="classoperations__research_1_1_hamiltonian_path_solver_html_a03106785fd757b213975f94d4b780709"><div class="ttname"><a href="classoperations__research_1_1_hamiltonian_path_solver.html#a03106785fd757b213975f94d4b780709">operations_research::HamiltonianPathSolver::NodeSet</a></div><div class="ttdeci">Set&lt; Integer &gt; NodeSet</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00477">hamiltonian_path.h:477</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_range_iterator_html_a8f6ae547a7aba92b9e4fe92a8713085a"><div class="ttname"><a href="classoperations__research_1_1_set_range_iterator.html#a8f6ae547a7aba92b9e4fe92a8713085a">operations_research::SetRangeIterator::operator *</a></div><div class="ttdeci">SetType operator *() const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00233">hamiltonian_path.h:233</a></div></div>
<div class="ttc" id="classoperations__research_1_1_hamiltonian_path_solver_html_a5daed8b7f3c98c693f32dff60adeb4cc"><div class="ttname"><a href="classoperations__research_1_1_hamiltonian_path_solver.html#a5daed8b7f3c98c693f32dff60adeb4cc">operations_research::HamiltonianPathSolver::IsRobust</a></div><div class="ttdeci">bool IsRobust()</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00786">hamiltonian_path.h:786</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_range_iterator_html_a4ee741618ffbec86b3a2a280c61ca3f0"><div class="ttname"><a href="classoperations__research_1_1_set_range_iterator.html#a4ee741618ffbec86b3a2a280c61ca3f0">operations_research::SetRangeIterator::IntegerType</a></div><div class="ttdeci">SetType::IntegerType IntegerType</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00228">hamiltonian_path.h:228</a></div></div>
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00043">christofides.h:43</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_a3382ddf3a1f05b9ded21ddb7b0013f78"><div class="ttname"><a href="classoperations__research_1_1_set.html#a3382ddf3a1f05b9ded21ddb7b0013f78">operations_research::Set::operator!=</a></div><div class="ttdeci">bool operator!=(const Set &amp;other) const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00203">hamiltonian_path.h:203</a></div></div>
<div class="ttc" id="classoperations__research_1_1_hamiltonian_path_solver_html_a44af6c2df0188e77ceeec78a190ecf3f"><div class="ttname"><a href="classoperations__research_1_1_hamiltonian_path_solver.html#a44af6c2df0188e77ceeec78a190ecf3f">operations_research::HamiltonianPathSolver::VerifiesTriangleInequality</a></div><div class="ttdeci">bool VerifiesTriangleInequality()</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00811">hamiltonian_path.h:811</a></div></div>
<div class="ttc" id="classoperations__research_1_1_element_iterator_html_aefcf46820145a241c215f2e82b69d5f5"><div class="ttname"><a href="classoperations__research_1_1_element_iterator.html#aefcf46820145a241c215f2e82b69d5f5">operations_research::ElementIterator::operator!=</a></div><div class="ttdeci">bool operator!=(const ElementIterator &amp;other) const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00108">hamiltonian_path.h:108</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_range_with_cardinality_html"><div class="ttname"><a href="classoperations__research_1_1_set_range_with_cardinality.html">operations_research::SetRangeWithCardinality</a></div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00258">hamiltonian_path.h:258</a></div></div>
<div class="ttc" id="classoperations__research_1_1_lattice_memory_manager_html_a03b88bdfd0b2fcc7e14106cbd425629a"><div class="ttname"><a href="classoperations__research_1_1_lattice_memory_manager.html#a03b88bdfd0b2fcc7e14106cbd425629a">operations_research::LatticeMemoryManager::LatticeMemoryManager</a></div><div class="ttdeci">LatticeMemoryManager()</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00294">hamiltonian_path.h:294</a></div></div>
<div class="ttc" id="classoperations__research_1_1_lattice_memory_manager_html_a4c59c8afdecf1f9d139609ffe9f172ca"><div class="ttname"><a href="classoperations__research_1_1_lattice_memory_manager.html#a4c59c8afdecf1f9d139609ffe9f172ca">operations_research::LatticeMemoryManager::SetValue</a></div><div class="ttdeci">void SetValue(Set s, int node, CostType value)</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00444">hamiltonian_path.h:444</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_a64f741970505f1dea6a662c3b1776c74"><div class="ttname"><a href="classoperations__research_1_1_set.html#a64f741970505f1dea6a662c3b1776c74">operations_research::Set::SmallestSingleton</a></div><div class="ttdeci">Set SmallestSingleton() const</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00190">hamiltonian_path.h:190</a></div></div>
<div class="ttc" id="classoperations__research_1_1_pruning_hamiltonian_solver_html_a346635bd62f6d557d98e490ff2f3f306"><div class="ttname"><a href="classoperations__research_1_1_pruning_hamiltonian_solver.html#a346635bd62f6d557d98e490ff2f3f306">operations_research::PruningHamiltonianSolver::Integer</a></div><div class="ttdeci">uint32_t Integer</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00894">hamiltonian_path.h:894</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_range_with_cardinality_html_ac227945449c4f8144b6c92afd6ae2156"><div class="ttname"><a href="classoperations__research_1_1_set_range_with_cardinality.html#ac227945449c4f8144b6c92afd6ae2156">operations_research::SetRangeWithCardinality::SetRangeWithCardinality</a></div><div class="ttdeci">SetRangeWithCardinality(int card, int max_card)</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00264">hamiltonian_path.h:264</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_a062c0acf17a051b885ad211acad31079"><div class="ttname"><a href="classoperations__research_1_1_set.html#a062c0acf17a051b885ad211acad31079">operations_research::Set::MaxCardinality</a></div><div class="ttdeci">static const int MaxCardinality</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00136">hamiltonian_path.h:136</a></div></div>
<div class="ttc" id="classoperations__research_1_1_pruning_hamiltonian_solver_html_a03106785fd757b213975f94d4b780709"><div class="ttname"><a href="classoperations__research_1_1_pruning_hamiltonian_solver.html#a03106785fd757b213975f94d4b780709">operations_research::PruningHamiltonianSolver::NodeSet</a></div><div class="ttdeci">Set&lt; Integer &gt; NodeSet</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00895">hamiltonian_path.h:895</a></div></div>
<div class="ttc" id="classoperations__research_1_1_set_html_a7f72b10501772e497164805b53e2ec80"><div class="ttname"><a href="classoperations__research_1_1_set.html#a7f72b10501772e497164805b53e2ec80">operations_research::Set::One</a></div><div class="ttdeci">static constexpr Integer One</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00134">hamiltonian_path.h:134</a></div></div>
<div class="ttc" id="namespaceoperations__research_html_ae8625c5e71962a0f99954d34dab9f92d"><div class="ttname"><a href="namespaceoperations__research.html#ae8625c5e71962a0f99954d34dab9f92d">operations_research::PathNodeIndex</a></div><div class="ttdeci">int PathNodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00451">hamiltonian_path.h:451</a></div></div>
<div class="ttc" id="classoperations__research_1_1_hamiltonian_path_solver_html_a8acc60c87190fac89379315aa08ce7a5"><div class="ttname"><a href="classoperations__research_1_1_hamiltonian_path_solver.html#a8acc60c87190fac89379315aa08ce7a5">operations_research::HamiltonianPathSolver::HamiltonianPath</a></div><div class="ttdeci">std::vector&lt; int &gt; HamiltonianPath(int end_node)</div><div class="ttdef"><b>Definition:</b> <a href="hamiltonian__path_8h_source.html#l00845">hamiltonian_path.h:845</a></div></div>
2021-01-26 11:28:50 +01:00
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
2019-08-07 18:01:08 -07:00
</div>
2019-06-13 15:36:14 +02:00
</div>
<div id="footer-container">
<div id="footer">
</div>
</div>
</body>
</html>