141 lines
10 KiB
HTML
141 lines
10 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"/>-->
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.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="banner-container">
|
|
<div id="banner">
|
|
<span id="sfml">Google OR-Tools 9.2</span>
|
|
</div>
|
|
</div>
|
|
<div id="content" style="width: 100%; overflow: hidden;">
|
|
<div style="margin-left: 15px; margin-top: 5px; float: left; color: #145A32;">
|
|
<h2>C++ Reference</h2>
|
|
<ul>
|
|
<li><a href="../cpp_algorithms/annotated.html">Algorithms</a></li>
|
|
<li><a href="../cpp_sat/annotated.html">CP-SAT</a></li>
|
|
<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>
|
|
<div id="content">
|
|
<div align="center">
|
|
<h1 style="color: #145A32;">C++ Reference: Graph</h1>
|
|
</div>
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('one__tree__lower__bound_8h.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="summary">
|
|
<a href="#nested-classes">Classes</a> |
|
|
<a href="#namespaces">Namespaces</a> |
|
|
<a href="#func-members">Functions</a> </div>
|
|
<div class="headertitle"><div class="title">one_tree_lower_bound.h File Reference</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p><a href="one__tree__lower__bound_8h_source.html">Go to the source code of this file.</a></p>
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
|
|
Classes</h2></td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1_volgenant_jonker_evaluator.html">VolgenantJonkerEvaluator< CostType ></a></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1_held_wolfe_crowder_evaluator.html">HeldWolfeCrowderEvaluator< CostType, CostFunction ></a></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="structoperations__research_1_1_traveling_salesman_lower_bound_parameters.html">TravelingSalesmanLowerBoundParameters</a></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
|
Namespaces</h2></td></tr>
|
|
<tr class="memitem:namespaceoperations__research"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="namespaceoperations__research.html">operations_research</a></td></tr>
|
|
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:ac5b08aa63fdd1b499b4653688c13af81"><td class="memTemplParams" colspan="2">template<typename CostFunction > </td></tr>
|
|
<tr class="memitem:ac5b08aa63fdd1b499b4653688c13af81"><td class="memTemplItemLeft" align="right" valign="top">std::set< std::pair< int, int > > </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceoperations__research.html#ac5b08aa63fdd1b499b4653688c13af81">NearestNeighbors</a> (int number_of_nodes, int number_of_neighbors, const CostFunction &cost)</td></tr>
|
|
<tr class="separator:ac5b08aa63fdd1b499b4653688c13af81"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:af916b84aff43c128a27c2f02a55ab000"><td class="memTemplParams" colspan="2">template<typename CostFunction > </td></tr>
|
|
<tr class="memitem:af916b84aff43c128a27c2f02a55ab000"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceoperations__research.html#af916b84aff43c128a27c2f02a55ab000">AddArcsFromMinimumSpanningTree</a> (int number_of_nodes, const CostFunction &cost, std::set< std::pair< int, int > > *arcs)</td></tr>
|
|
<tr class="separator:af916b84aff43c128a27c2f02a55ab000"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:aeae6cf89ac4d73d2e95cffaa0edbd687"><td class="memTemplParams" colspan="2">template<typename CostFunction , typename GraphType , typename AcceptFunction > </td></tr>
|
|
<tr class="memitem:aeae6cf89ac4d73d2e95cffaa0edbd687"><td class="memTemplItemLeft" align="right" valign="top">int </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceoperations__research.html#aeae6cf89ac4d73d2e95cffaa0edbd687">GetNodeMinimizingEdgeCostToSource</a> (const GraphType &graph, int source, const CostFunction &cost, AcceptFunction accept)</td></tr>
|
|
<tr class="separator:aeae6cf89ac4d73d2e95cffaa0edbd687"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a9ef4076dcc63501e6d1ecf4a3c6da31b"><td class="memTemplParams" colspan="2">template<typename CostFunction , typename GraphType , typename CostType > </td></tr>
|
|
<tr class="memitem:a9ef4076dcc63501e6d1ecf4a3c6da31b"><td class="memTemplItemLeft" align="right" valign="top">std::vector< int > </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceoperations__research.html#a9ef4076dcc63501e6d1ecf4a3c6da31b">ComputeOneTree</a> (const GraphType &graph, const CostFunction &cost, const std::vector< double > &weights, const std::vector< int > &sorted_arcs, CostType *one_tree_cost)</td></tr>
|
|
<tr class="separator:a9ef4076dcc63501e6d1ecf4a3c6da31b"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a3ed3d609fa06ad508b3d21119f94a560"><td class="memTemplParams" colspan="2">template<typename CostFunction , typename Algorithm > </td></tr>
|
|
<tr class="memitem:a3ed3d609fa06ad508b3d21119f94a560"><td class="memTemplItemLeft" align="right" valign="top">double </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceoperations__research.html#a3ed3d609fa06ad508b3d21119f94a560">ComputeOneTreeLowerBoundWithAlgorithm</a> (int number_of_nodes, int nearest_neighbors, const CostFunction &cost, Algorithm *algorithm)</td></tr>
|
|
<tr class="separator:a3ed3d609fa06ad508b3d21119f94a560"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a516a7ec8626d689aa84729fb6f358f89"><td class="memTemplParams" colspan="2">template<typename CostFunction > </td></tr>
|
|
<tr class="memitem:a516a7ec8626d689aa84729fb6f358f89"><td class="memTemplItemLeft" align="right" valign="top">double </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceoperations__research.html#a516a7ec8626d689aa84729fb6f358f89">ComputeOneTreeLowerBoundWithParameters</a> (int number_of_nodes, const CostFunction &cost, const TravelingSalesmanLowerBoundParameters &parameters)</td></tr>
|
|
<tr class="separator:a516a7ec8626d689aa84729fb6f358f89"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ae9af26e7687cb65967941eb175148fe5"><td class="memTemplParams" colspan="2">template<typename CostFunction > </td></tr>
|
|
<tr class="memitem:ae9af26e7687cb65967941eb175148fe5"><td class="memTemplItemLeft" align="right" valign="top">double </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespaceoperations__research.html#ae9af26e7687cb65967941eb175148fe5">ComputeOneTreeLowerBound</a> (int number_of_nodes, const CostFunction &cost)</td></tr>
|
|
<tr class="separator:ae9af26e7687cb65967941eb175148fe5"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div>
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|