72 lines
61 KiB
HTML
72 lines
61 KiB
HTML
|
<!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"/>-->
|
||
|
|
<link rel="stylesheet" type="text/css" href="doxygen.css" title="default" media="screen,print" />
|
||
|
|
<script type="text/javascript" src="jquery.js"></script>
|
||
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
||
|
|
</head>
|
||
|
|
<body>
|
||
|
|
<div id="banner-container">
|
||
|
|
<div id="banner">
|
||
|
|
<span id="sfml">OR-Tools 7.1@</span>
|
||
|
|
</div>
|
||
|
|
</div>
|
||
|
|
<div id="content">
|
||
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
||
|
|
<div id="navrow1" class="tabs">
|
||
|
|
<ul class="tablist">
|
||
|
|
<li><a href="index.html"><span>Main Page</span></a></li>
|
||
|
|
<li><a href="pages.html"><span>Related Pages</span></a></li>
|
||
|
|
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
|
||
|
|
<li><a href="annotated.html"><span>Classes</span></a></li>
|
||
|
|
<li class="current"><a href="files.html"><span>Files</span></a></li>
|
||
|
|
</ul>
|
||
|
|
</div>
|
||
|
|
<div id="navrow2" class="tabs2">
|
||
|
|
<ul class="tablist">
|
||
|
|
<li><a href="files.html"><span>File List</span></a></li>
|
||
|
|
<li><a href="globals.html"><span>File Members</span></a></li>
|
||
|
|
</ul>
|
||
|
|
</div>
|
||
|
|
<div id="nav-path" class="navpath">
|
||
|
|
<ul>
|
||
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_725f3a5915051842f84e3ea508be2a62.html">graph</a></li> </ul>
|
||
|
|
</div>
|
||
|
|
</div><!-- top -->
|
||
|
|
<div class="header">
|
||
|
|
<div class="headertitle">
|
||
|
|
<div class="title">christofides.h</div> </div>
|
||
|
|
</div><!--header-->
|
||
|
|
<div class="contents">
|
||
|
|
<a href="christofides_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-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">// ChristofidesPathSolver computes an approximate solution to the Traveling</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// Salesman Problen using the Christofides algorithm (c.f.</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// https://en.wikipedia.org/wiki/Christofides_algorithm).</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// Note that the algorithm guarantees finding a solution within 3/2 of the</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// optimum. Its complexity is O(n^2 * log(n)) where n is the number of nodes.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#ifndef OR_TOOLS_GRAPH_CHRISTOFIDES_H_</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#define OR_TOOLS_GRAPH_CHRISTOFIDES_H_</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/container/flat_hash_map.h"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "ortools/base/integral_types.h"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "ortools/base/logging.h"</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <s
|
||
|
|
<div class="ttc" id="one__tree__lower__bound_8h_html_af86d4c4e6a18908cda194651a9ab7beb"><div class="ttname"><a href="one__tree__lower__bound_8h.html#af86d4c4e6a18908cda194651a9ab7beb">degrees</a></div><div class="ttdeci">trees with all degrees equal w the current value of degrees</div><div class="ttdef"><b>Definition:</b> <a href="one__tree__lower__bound_8h_source.html#l00034">one_tree_lower_bound.h:34</a></div></div>
|
||
|
|
<div class="ttc" id="classoperations__research_1_1ChristofidesPathSolver_html_a4c46f50f1d26cb5d1945fee66db56029"><div class="ttname"><a href="classoperations__research_1_1ChristofidesPathSolver.html#a4c46f50f1d26cb5d1945fee66db56029">operations_research::ChristofidesPathSolver::ChristofidesPathSolver</a></div><div class="ttdeci">ChristofidesPathSolver(NodeIndex num_nodes, CostFunction costs)</div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00177">christofides.h:177</a></div></div>
|
||
|
|
<div class="ttc" id="namespaceoperations__research_html_aa63055860fc53f8eed56d23d2571c180"><div class="ttname"><a href="namespaceoperations__research.html#aa63055860fc53f8eed56d23d2571c180">operations_research::BuildEulerianTourFromNode</a></div><div class="ttdeci">std::vector< NodeIndex > BuildEulerianTourFromNode(const Graph &graph, NodeIndex root)</div><div class="ttdoc">Builds an Eulerian tour/circuit/cycle starting and ending at node root on an undirected graph.</div><div class="ttdef"><b>Definition:</b> <a href="eulerian__path_8h_source.html#l00116">eulerian_path.h:116</a></div></div>
|
||
|
|
<div class="ttc" id="classoperations__research_1_1ChristofidesPathSolver_html_a76c636e1d48da64087686dd06bc45519"><div class="ttname"><a href="classoperations__research_1_1ChristofidesPathSolver.html#a76c636e1d48da64087686dd06bc45519">operations_research::ChristofidesPathSolver::SetMatchingAlgorithm</a></div><div class="ttdeci">void SetMatchingAlgorithm(MatchingAlgorithm matching)</div><div class="ttdoc">Sets the matching algorith to use.</div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00058">christofides.h:58</a></div></div>
|
||
|
|
<div class="ttc" id="minimum__spanning__tree_8h_html"><div class="ttname"><a href="minimum__spanning__tree_8h.html">minimum_spanning_tree.h</a></div></div>
|
||
|
|
<div class="ttc" id="namespaceutil_html_aadd7603ae6e78cc2490ca9710fbaf180"><div class="ttname"><a href="namespaceutil.html#aadd7603ae6e78cc2490ca9710fbaf180">util::false</a></div><div class="ttdeci">false</div><div class="ttdoc">This is useful for wrapping iterators of a class that support many different iterations.</div><div class="ttdef"><b>Definition:</b> <a href="iterators_8h_source.html#l00030">iterators.h:30</a></div></div>
|
||
|
|
<div class="ttc" id="classoperations__research_1_1ChristofidesPathSolver_html_a8db7cbf56d8882ecefcb1f88ff20c755"><div class="ttname"><a href="classoperations__research_1_1ChristofidesPathSolver.html#a8db7cbf56d8882ecefcb1f88ff20c755">operations_research::ChristofidesPathSolver::TravelingSalesmanPath</a></div><div class="ttdeci">std::vector< NodeIndex > TravelingSalesmanPath()</div><div class="ttdoc">Returns the approximate TSP tour.</div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00197">christofides.h:197</a></div></div>
|
||
|
|
<div class="ttc" id="classoperations__research_1_1ChristofidesPathSolver_html_ada30f267a0dea4a4f25fcce1a6158438"><div class="ttname"><a href="classoperations__research_1_1ChristofidesPathSolver.html#ada30f267a0dea4a4f25fcce1a6158438">operations_research::ChristofidesPathSolver::TravelingSalesmanCost</a></div><div class="ttdeci">CostType TravelingSalesmanCost()</div><div class="ttdoc">Returns the cost of the approximate TSP tour.</div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00187">christofides.h:187</a></div></div>
|
||
|
|
<div class="ttc" id="graph_8h_html"><div class="ttname"><a href="graph_8h.html">graph.h</a></div></div>
|
||
|
|
<div class="ttc" id="namespaceoperations__research_html_a31d858394c5eed1fa21edc3da47047c1"><div class="ttname"><a href="namespaceoperations__research.html#a31d858394c5eed1fa21edc3da47047c1">operations_research::ArcIndex</a></div><div class="ttdeci">int32 ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00201">ebert_graph.h:201</a></div></div>
|
||
|
|
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in c...</div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00033">christofides.h:33</a></div></div>
|
||
|
|
<div class="ttc" id="classoperations__research_1_1ChristofidesPathSolver_html_ad44822002f75a6f478a62e107d880018"><div class="ttname"><a href="classoperations__research_1_1ChristofidesPathSolver.html#ad44822002f75a6f478a62e107d880018">operations_research::ChristofidesPathSolver::MatchingAlgorithm</a></div><div class="ttdeci">MatchingAlgorithm</div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00042">christofides.h:42</a></div></div>
|
||
|
|
<div class="ttc" id="namespaceoperations__research_html_ab1cf773de0cae72d0c44efe5b8f4bb89"><div class="ttname"><a href="namespaceoperations__research.html#ab1cf773de0cae72d0c44efe5b8f4bb89">operations_research::IsEulerianGraph</a></div><div class="ttdeci">bool IsEulerianGraph(const Graph &graph)</div><div class="ttdoc">Returns true if a graph is Eulerian, aka all its nodes are of even degree.</div><div class="ttdef"><b>Definition:</b> <a href="eulerian__path_8h_source.html#l00040">eulerian_path.h:40</a></div></div>
|
||
|
|
<div class="ttc" id="namespaceoperations__research_html_a33a2f4c26fd60cd0fa98257b571c974f"><div class="ttname"><a href="namespaceoperations__research.html#a33a2f4c26fd60cd0fa98257b571c974f">operations_research::BuildPrimMinimumSpanningTree</a></div><div class="ttdeci">std::vector< typename Graph::ArcIndex > BuildPrimMinimumSpanningTree(const Graph &graph, const ArcValue &arc_value)</div><div class="ttdoc">Implementation of Prim's mininumum spanning tree algorithm (c.f.</div><div class="ttdef"><b>Definition:</b> <a href="minimum__spanning__tree_8h_source.html#l00117">minimum_spanning_tree.h:117</a></div></div>
|
||
|
|
<div class="ttc" id="classoperations__research_1_1ChristofidesPathSolver_html"><div class="ttname"><a href="classoperations__research_1_1ChristofidesPathSolver.html">operations_research::ChristofidesPathSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00040">christofides.h:40</a></div></div>
|
||
|
|
<div class="ttc" id="namespaceoperations__research_html_a0e629e35bfa311b31dd7f5065eb834bb"><div class="ttname"><a href="namespaceoperations__research.html#a0e629e35bfa311b31dd7f5065eb834bb">operations_research::NodeIndex</a></div><div class="ttdeci">int32 NodeIndex</div><div class="ttdoc">Standard instantiation of ForwardEbertGraph (named 'ForwardStarGraph') of EbertGraph (named 'StarGrap...</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00192">ebert_graph.h:192</a></div></div>
|
||
|
|
<div class="ttc" id="eulerian__path_8h_html"><div class="ttname"><a href="eulerian__path_8h.html">eulerian_path.h</a></div></div>
|
||
|
|
<div class="ttc" id="classoperations__research_1_1ChristofidesPathSolver_html_ad44822002f75a6f478a62e107d880018a99c5fe202c37dcd8ed9cc60926a4f525"><div class="ttname"><a href="classoperations__research_1_1ChristofidesPathSolver.html#ad44822002f75a6f478a62e107d880018a99c5fe202c37dcd8ed9cc60926a4f525">operations_research::ChristofidesPathSolver::MatchingAlgorithm::MINIMAL_WEIGHT_MATCHING</a></div></div>
|
||
|
|
</div><!-- fragment --></div><!-- contents -->
|
||
|
|
</div>
|
||
|
|
<div id="footer-container">
|
||
|
|
<div id="footer">
|
||
|
|
</div>
|
||
|
|
</div>
|
||
|
|
</body>
|
||
|
|
</html>
|