2019-06-26 07:59:17 +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-26 07:59:17 +02:00
|
|
|
</head>
|
|
|
|
|
<body>
|
|
|
|
|
<div id="banner-container">
|
|
|
|
|
<div id="banner">
|
2021-12-14 13:41:01 +01:00
|
|
|
<span id="sfml">Google OR-Tools 9.2</span>
|
2019-06-26 07:59:17 +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-26 07:59:17 +02:00
|
|
|
<div id="content">
|
2019-08-07 18:01:08 -07:00
|
|
|
<div align="center">
|
|
|
|
|
<h1 style="color: #145A32;">C++ Reference: Algorithms</h1>
|
|
|
|
|
</div>
|
2022-01-17 21:42:14 +01:00
|
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
2020-09-01 16:00:33 +02:00
|
|
|
<script type="text/javascript">
|
2022-01-17 21:42:14 +01:00
|
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
|
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
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">
|
2022-01-17 21:42:14 +01:00
|
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
2020-09-01 16:00:33 +02:00
|
|
|
$(function() {
|
|
|
|
|
initMenu('',true,false,'search.php','Search');
|
|
|
|
|
$(document).ready(function() { init_search(); });
|
|
|
|
|
});
|
2022-01-17 21:42:14 +01:00
|
|
|
/* @license-end */
|
|
|
|
|
</script>
|
2020-09-01 16:00:33 +02:00
|
|
|
<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>
|
2019-06-26 07:59:17 +02:00
|
|
|
</div>
|
2020-09-01 16:00:33 +02:00
|
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
|
|
|
class="ui-resizable-handle">
|
2019-07-12 11:43:12 -07:00
|
|
|
</div>
|
2020-09-01 16:00:33 +02:00
|
|
|
</div>
|
|
|
|
|
<script type="text/javascript">
|
2022-01-17 21:42:14 +01:00
|
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
|
|
|
$(document).ready(function(){initNavTree('functions_func.html',''); initResizable(); });
|
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-26 07:59:17 +02:00
|
|
|
<div class="contents">
|
2019-08-07 18:01:08 -07:00
|
|
|
 
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_a" name="index_a"></a>- a -</h3><ul>
|
|
|
|
|
<li>AddMappings() : <a class="el" href="classoperations__research_1_1_dynamic_permutation.html#aeb46445d022e7bc495f212704791824a">DynamicPermutation</a></li>
|
|
|
|
|
<li>AddToCurrentCycle() : <a class="el" href="classoperations__research_1_1_sparse_permutation.html#a540c5f44963a3f25d264f41b643e0f57">SparsePermutation</a></li>
|
|
|
|
|
<li>AllMappingsSrc() : <a class="el" href="classoperations__research_1_1_dynamic_permutation.html#afc48707ddd63d0978b9cfcd17c704694">DynamicPermutation</a></li>
|
|
|
|
|
<li>assignment() : <a class="el" href="classoperations__research_1_1_knapsack_search_node.html#af94db7bbd58faf999d63953ef12784fe">KnapsackSearchNode</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_b" name="index_b"></a>- b -</h3><ul>
|
|
|
|
|
<li>BaseKnapsackSolver() : <a class="el" href="classoperations__research_1_1_base_knapsack_solver.html#ac6518fa5a6dd37173c7700bc2d9b6071">BaseKnapsackSolver</a></li>
|
|
|
|
|
<li>begin() : <a class="el" href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a895e8e66079521889215308182c5591b">DynamicPartition::IterablePart</a>, <a class="el" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a895e8e66079521889215308182c5591b">SparsePermutation::Iterator</a></li>
|
|
|
|
|
<li>best_solution() : <a class="el" href="classoperations__research_1_1_base_knapsack_solver.html#af75968e8e76e35de6e7cdfaa0488b131">BaseKnapsackSolver</a>, <a class="el" href="classoperations__research_1_1_knapsack_generic_solver.html#abfd4cb3faa2f1d6840b8123765fa2fc4">KnapsackGenericSolver</a></li>
|
|
|
|
|
<li>BestSolutionContains() : <a class="el" href="classoperations__research_1_1_knapsack_solver.html#a57d88f584d14b161580550918c8fbf3b">KnapsackSolver</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_c" name="index_c"></a>- c -</h3><ul>
|
|
|
|
|
<li>CloseCurrentCycle() : <a class="el" href="classoperations__research_1_1_sparse_permutation.html#a709f5ccee8651229a29a54b3c9e14681">SparsePermutation</a></li>
|
|
|
|
|
<li>ComputeProfitBounds() : <a class="el" href="classoperations__research_1_1_knapsack_capacity_propagator.html#a9921c39ed90a9cd32301ee0fee9491cb">KnapsackCapacityPropagator</a>, <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#a8ae457a5297bac5ad83517ba54b819d1">KnapsackPropagator</a></li>
|
|
|
|
|
<li>CopyCurrentStateToSolution() : <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#a1fa45af1bf0d6aa9d5f86e2ed9ae5323">KnapsackPropagator</a></li>
|
|
|
|
|
<li>CopyCurrentStateToSolutionPropagator() : <a class="el" href="classoperations__research_1_1_knapsack_capacity_propagator.html#a706a3a7c9568016131afd718f347ec8d">KnapsackCapacityPropagator</a>, <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#ab803770e8e21bb448a2f3d940ab125f8">KnapsackPropagator</a></li>
|
|
|
|
|
<li>CreateSparsePermutation() : <a class="el" href="classoperations__research_1_1_dynamic_permutation.html#a4829347e4722a1281369b9a251280fcc">DynamicPermutation</a></li>
|
|
|
|
|
<li>current_profit() : <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#a08beea2d857241d99287935a91be5217">KnapsackPropagator</a>, <a class="el" href="classoperations__research_1_1_knapsack_search_node.html#a08beea2d857241d99287935a91be5217">KnapsackSearchNode</a></li>
|
|
|
|
|
<li>Cycle() : <a class="el" href="classoperations__research_1_1_sparse_permutation.html#af567b4e287e268eb9ecee908f63e5b64">SparsePermutation</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_d" name="index_d"></a>- d -</h3><ul>
|
|
|
|
|
<li>DebugString() : <a class="el" href="classoperations__research_1_1_dynamic_partition.html#ad07c56b1579801daaf3a9a750d26e792">DynamicPartition</a>, <a class="el" href="classoperations__research_1_1_dynamic_permutation.html#a764be64f3029f8b8e23511061d8de355">DynamicPermutation</a>, <a class="el" href="classoperations__research_1_1_merging_partition.html#a6097c48821f010becb9a6910f4c39288">MergingPartition</a>, <a class="el" href="classoperations__research_1_1_sparse_permutation.html#a764be64f3029f8b8e23511061d8de355">SparsePermutation</a></li>
|
|
|
|
|
<li>DenseDoublyLinkedList() : <a class="el" href="classoperations__research_1_1_dense_doubly_linked_list.html#af3fbdc77fe875334a344eac65f7c556b">DenseDoublyLinkedList</a></li>
|
|
|
|
|
<li>depth() : <a class="el" href="classoperations__research_1_1_knapsack_search_node.html#a6fdd73f8011695b97659f2bea29325cb">KnapsackSearchNode</a></li>
|
|
|
|
|
<li>DistinguishNodeInPartition() : <a class="el" href="classoperations__research_1_1_graph_symmetry_finder.html#acb28211fa0581e72d3dcb6b43ebe857a">GraphSymmetryFinder</a></li>
|
|
|
|
|
<li>DynamicPartition() : <a class="el" href="classoperations__research_1_1_dynamic_partition.html#ac86affffe0db21281ab1db3b23bbebc8">DynamicPartition</a></li>
|
|
|
|
|
<li>DynamicPermutation() : <a class="el" href="classoperations__research_1_1_dynamic_permutation.html#a460f2957b84beed593ad470bf7c7cd0d">DynamicPermutation</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_e" name="index_e"></a>- e -</h3><ul>
|
|
|
|
|
<li>ElementsInHierarchicalOrder() : <a class="el" href="classoperations__research_1_1_dynamic_partition.html#ad8a3eb5fa76f501ec96f1664fc899c3b">DynamicPartition</a></li>
|
|
|
|
|
<li>ElementsInPart() : <a class="el" href="classoperations__research_1_1_dynamic_partition.html#a11ea4d0620bbdca30b7d9b8a23f8cdd8">DynamicPartition</a></li>
|
|
|
|
|
<li>ElementsInSamePartAs() : <a class="el" href="classoperations__research_1_1_dynamic_partition.html#a897ee69dceefdd60a6a4e90ab8b18a25">DynamicPartition</a></li>
|
|
|
|
|
<li>end() : <a class="el" href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#a4e37f070051346d7cd493425490c175e">DynamicPartition::IterablePart</a>, <a class="el" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a4e37f070051346d7cd493425490c175e">SparsePermutation::Iterator</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_f" name="index_f"></a>- f -</h3><ul>
|
|
|
|
|
<li>FillEquivalenceClasses() : <a class="el" href="classoperations__research_1_1_merging_partition.html#a62cb833403d7861c5badb4de3389e06e">MergingPartition</a></li>
|
|
|
|
|
<li>FindSymmetries() : <a class="el" href="classoperations__research_1_1_graph_symmetry_finder.html#ad1f88654797ab9271206d6a4c013a94e">GraphSymmetryFinder</a></li>
|
|
|
|
|
<li>FprintOfPart() : <a class="el" href="classoperations__research_1_1_dynamic_partition.html#a9b5c93a4cf6d2e548d76291fe7ba5b5d">DynamicPartition</a></li>
|
|
|
|
|
<li>from() : <a class="el" href="classoperations__research_1_1_knapsack_search_path.html#a97db8ba091791787900dd812fefc10e5">KnapsackSearchPath</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_g" name="index_g"></a>- g -</h3><ul>
|
|
|
|
|
<li>GetEfficiency() : <a class="el" href="structoperations__research_1_1_knapsack_item.html#a7eb6bbc72ec605de6f50d0c90f609a85">KnapsackItem</a></li>
|
|
|
|
|
<li>GetLowerAndUpperBoundWhenItem() : <a class="el" href="classoperations__research_1_1_base_knapsack_solver.html#a89ae568099e8a8937bb049a1626e6d3a">BaseKnapsackSolver</a>, <a class="el" href="classoperations__research_1_1_knapsack_generic_solver.html#ac9849a7043959c65033fa6f4a63bb10e">KnapsackGenericSolver</a></li>
|
|
|
|
|
<li>GetName() : <a class="el" href="classoperations__research_1_1_base_knapsack_solver.html#ae194e7bee4a383e5ee6c8ed341b49b7e">BaseKnapsackSolver</a>, <a class="el" href="classoperations__research_1_1_knapsack_solver.html#a9a98946a64f3893b085f650932c9dfee">KnapsackSolver</a></li>
|
|
|
|
|
<li>GetNextItemId() : <a class="el" href="classoperations__research_1_1_knapsack_capacity_propagator.html#afccfe4a5a27c2c805016d82886795da9">KnapsackCapacityPropagator</a>, <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#a9aea5e61ac71dca1139fda445cc2dfee">KnapsackPropagator</a></li>
|
|
|
|
|
<li>GetNumberOfItems() : <a class="el" href="classoperations__research_1_1_knapsack_generic_solver.html#a5c677592ee5e7312c64475ebae949eab">KnapsackGenericSolver</a>, <a class="el" href="classoperations__research_1_1_knapsack_state.html#a5c677592ee5e7312c64475ebae949eab">KnapsackState</a></li>
|
|
|
|
|
<li>GetRoot() : <a class="el" href="classoperations__research_1_1_merging_partition.html#ae3df79e84e453454062c2c3789b7828e">MergingPartition</a></li>
|
|
|
|
|
<li>GetRootAndCompressPath() : <a class="el" href="classoperations__research_1_1_merging_partition.html#ac64dbed5d9196b941f3f53862f77309d">MergingPartition</a></li>
|
|
|
|
|
<li>GraphSymmetryFinder() : <a class="el" href="classoperations__research_1_1_graph_symmetry_finder.html#af0ae1a4d86cfcf11128fe60ea0f8d20b">GraphSymmetryFinder</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_i" name="index_i"></a>- i -</h3><ul>
|
|
|
|
|
<li>ImageOf() : <a class="el" href="classoperations__research_1_1_dynamic_permutation.html#a1976819faa164a8d10a66200dc2c3a96">DynamicPermutation</a></li>
|
|
|
|
|
<li>Init() : <a class="el" href="classoperations__research_1_1_base_knapsack_solver.html#abb1c2efb23ee210447502a9baab0812a">BaseKnapsackSolver</a>, <a class="el" href="classoperations__research_1_1_knapsack_generic_solver.html#a734b6464309adbbdeb63ef759f690ff1">KnapsackGenericSolver</a>, <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#a04d8883567a6e02787f2362e6543a21b">KnapsackPropagator</a>, <a class="el" href="classoperations__research_1_1_knapsack_search_path.html#a1e3b6d38df0786ccf7f938d60e386aae">KnapsackSearchPath</a>, <a class="el" href="classoperations__research_1_1_knapsack_solver.html#ae5982edf1a2974495d20201775a765e2">KnapsackSolver</a>, <a class="el" href="classoperations__research_1_1_knapsack_state.html#a6308c7a97200f84f6ebf5b2c487b0362">KnapsackState</a></li>
|
|
|
|
|
<li>InitPropagator() : <a class="el" href="classoperations__research_1_1_knapsack_capacity_propagator.html#ae2545020be753ee6a66c277daac41784">KnapsackCapacityPropagator</a>, <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#a883cd053b1e7322727eb9e19940f69f6">KnapsackPropagator</a></li>
|
|
|
|
|
<li>is_bound() : <a class="el" href="classoperations__research_1_1_knapsack_state.html#a89aa280d2321c1316aa1305106f1bb49">KnapsackState</a></li>
|
|
|
|
|
<li>is_in() : <a class="el" href="classoperations__research_1_1_knapsack_state.html#a862bf4e908cd82ea44f72e98558016ad">KnapsackState</a></li>
|
|
|
|
|
<li>IsGraphAutomorphism() : <a class="el" href="classoperations__research_1_1_graph_symmetry_finder.html#a998043f7ad1e35dc5f6cb23e18f6e7dd">GraphSymmetryFinder</a></li>
|
|
|
|
|
<li>IsSolutionOptimal() : <a class="el" href="classoperations__research_1_1_knapsack_solver.html#a9647a5f765048e8662e5efa54c7d8687">KnapsackSolver</a></li>
|
|
|
|
|
<li>items() : <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#a701e8fc6dbf7ffeb4c48512ffa6d7501">KnapsackPropagator</a></li>
|
|
|
|
|
<li>IterablePart() : <a class="el" href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#ac32d6a4490f60f95983b0844091fcbac">DynamicPartition::IterablePart</a></li>
|
|
|
|
|
<li>Iterator() : <a class="el" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#a1f703720e1f5d97a0386c2dfe803c763">SparsePermutation::Iterator</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_k" name="index_k"></a>- k -</h3><ul>
|
|
|
|
|
<li>KeepOnlyOneNodePerPart() : <a class="el" href="classoperations__research_1_1_merging_partition.html#a80761f181b521aa284b7e687776b9fde">MergingPartition</a></li>
|
|
|
|
|
<li>KnapsackAssignment() : <a class="el" href="structoperations__research_1_1_knapsack_assignment.html#a8f85eb172a4c6bed0d042f7d269fc457">KnapsackAssignment</a></li>
|
|
|
|
|
<li>KnapsackCapacityPropagator() : <a class="el" href="classoperations__research_1_1_knapsack_capacity_propagator.html#a2ce43dc07784f3d9634df0a5c0dc39b0">KnapsackCapacityPropagator</a></li>
|
|
|
|
|
<li>KnapsackGenericSolver() : <a class="el" href="classoperations__research_1_1_knapsack_generic_solver.html#a2a7bff5cf8a51192eadec54eb0499064">KnapsackGenericSolver</a></li>
|
|
|
|
|
<li>KnapsackItem() : <a class="el" href="structoperations__research_1_1_knapsack_item.html#aefc8a61c2edd00c4daf37056b754e6a0">KnapsackItem</a></li>
|
|
|
|
|
<li>KnapsackPropagator() : <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#af28391017c090a638200c57b4c8a2ac1">KnapsackPropagator</a></li>
|
|
|
|
|
<li>KnapsackSearchNode() : <a class="el" href="classoperations__research_1_1_knapsack_search_node.html#ad17e46a2afcf393a4ec9159162c969f2">KnapsackSearchNode</a></li>
|
|
|
|
|
<li>KnapsackSearchPath() : <a class="el" href="classoperations__research_1_1_knapsack_search_path.html#a3dc3602e1a640bc986956e0ce5e88d04">KnapsackSearchPath</a></li>
|
|
|
|
|
<li>KnapsackSolver() : <a class="el" href="classoperations__research_1_1_knapsack_solver.html#a6b46c35c8977efde66ae7ad97423bdf2">KnapsackSolver</a></li>
|
|
|
|
|
<li>KnapsackState() : <a class="el" href="classoperations__research_1_1_knapsack_state.html#a41f9430cc0090383e7797a88c1dbacbc">KnapsackState</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_l" name="index_l"></a>- l -</h3><ul>
|
|
|
|
|
<li>LastElementInCycle() : <a class="el" href="classoperations__research_1_1_sparse_permutation.html#a68c2934475b5f68d6d6b9b2fdfb9955d">SparsePermutation</a></li>
|
|
|
|
|
<li>LooseEnds() : <a class="el" href="classoperations__research_1_1_dynamic_permutation.html#af782dbc8f8882512bc387cdf0ce0e190">DynamicPermutation</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_m" name="index_m"></a>- m -</h3><ul>
|
|
|
|
|
<li>MergePartsOf() : <a class="el" href="classoperations__research_1_1_merging_partition.html#a612bd8d97219124a8d6fbac721bcdbc6">MergingPartition</a></li>
|
|
|
|
|
<li>MergingPartition() : <a class="el" href="classoperations__research_1_1_merging_partition.html#a4aae0995dc07af7b81fb97104921328d">MergingPartition</a></li>
|
|
|
|
|
<li>MoveUpToDepth() : <a class="el" href="classoperations__research_1_1_knapsack_search_path.html#a09f219a2226f7c0de0f50b6f00c099e3">KnapsackSearchPath</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_n" name="index_n"></a>- n -</h3><ul>
|
|
|
|
|
<li>Next() : <a class="el" href="classoperations__research_1_1_dense_doubly_linked_list.html#a529953afc5e19c92a74234acf89aa8b5">DenseDoublyLinkedList</a></li>
|
|
|
|
|
<li>next_item_id() : <a class="el" href="classoperations__research_1_1_knapsack_search_node.html#a94dca4e57f87ba2a9e3b995c267c0821">KnapsackSearchNode</a></li>
|
|
|
|
|
<li>NumCycles() : <a class="el" href="classoperations__research_1_1_sparse_permutation.html#a8c5fc5af6e649a82d169f61e4dab5e33">SparsePermutation</a></li>
|
|
|
|
|
<li>NumElements() : <a class="el" href="classoperations__research_1_1_dynamic_partition.html#a84daba977c20d7a54c86ef77e8986267">DynamicPartition</a></li>
|
|
|
|
|
<li>NumNodes() : <a class="el" href="classoperations__research_1_1_merging_partition.html#af7b62ca470d8de1c1dde577b04671fa7">MergingPartition</a></li>
|
|
|
|
|
<li>NumNodesInSamePartAs() : <a class="el" href="classoperations__research_1_1_merging_partition.html#a3d5f7b1e62f42b574085e671ae6dfb73">MergingPartition</a></li>
|
|
|
|
|
<li>NumParts() : <a class="el" href="classoperations__research_1_1_dynamic_partition.html#ae91b7d9b6c4f0675b9ad3f38e5761853">DynamicPartition</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_p" name="index_p"></a>- p -</h3><ul>
|
|
|
|
|
<li>parent() : <a class="el" href="classoperations__research_1_1_knapsack_search_node.html#a94edd193a3f600c604a314803f723d93">KnapsackSearchNode</a></li>
|
|
|
|
|
<li>ParentOfPart() : <a class="el" href="classoperations__research_1_1_dynamic_partition.html#ab8257c32911b0b991bec1af210d993be">DynamicPartition</a></li>
|
|
|
|
|
<li>PartOf() : <a class="el" href="classoperations__research_1_1_dynamic_partition.html#ab22d95d31ef6edfd5a6770ff6d8c4f04">DynamicPartition</a></li>
|
|
|
|
|
<li>Prev() : <a class="el" href="classoperations__research_1_1_dense_doubly_linked_list.html#a8946608f3af2665ba4ac8cd789c253b2">DenseDoublyLinkedList</a></li>
|
|
|
|
|
<li>profit_lower_bound() : <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#ae04e419341e0b9772a057aff10ce63a0">KnapsackPropagator</a></li>
|
|
|
|
|
<li>profit_upper_bound() : <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#aa68069fd1180cb37fcdbc99d6230bc3e">KnapsackPropagator</a>, <a class="el" href="classoperations__research_1_1_knapsack_search_node.html#aa68069fd1180cb37fcdbc99d6230bc3e">KnapsackSearchNode</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_r" name="index_r"></a>- r -</h3><ul>
|
|
|
|
|
<li>RecursivelyRefinePartitionByAdjacency() : <a class="el" href="classoperations__research_1_1_graph_symmetry_finder.html#a651a63b1943d8b8fa2346df1d1a2f55c">GraphSymmetryFinder</a></li>
|
|
|
|
|
<li>Refine() : <a class="el" href="classoperations__research_1_1_dynamic_partition.html#a32f3aa9643111b05108d1120e48c1e13">DynamicPartition</a></li>
|
|
|
|
|
<li>Remove() : <a class="el" href="classoperations__research_1_1_dense_doubly_linked_list.html#a209f8799ca534e48c873a6613131d358">DenseDoublyLinkedList</a></li>
|
|
|
|
|
<li>RemoveCycles() : <a class="el" href="classoperations__research_1_1_sparse_permutation.html#a9add43490c45e4334099bb15b6e6eab0">SparsePermutation</a></li>
|
|
|
|
|
<li>Reset() : <a class="el" href="classoperations__research_1_1_dynamic_permutation.html#a372de693ad40b3f42839c8ec6ac845f4">DynamicPermutation</a>, <a class="el" href="classoperations__research_1_1_merging_partition.html#a50eca19efa71a0b70de25f9ad4a2a6f8">MergingPartition</a></li>
|
|
|
|
|
<li>ResetNode() : <a class="el" href="classoperations__research_1_1_merging_partition.html#a4368033ed0d5b2fc75727265e0c8f2d7">MergingPartition</a></li>
|
|
|
|
|
<li>RootOf() : <a class="el" href="classoperations__research_1_1_dynamic_permutation.html#a5696c0cdd05c22a3fceab054e260660b">DynamicPermutation</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_s" name="index_s"></a>- s -</h3><ul>
|
|
|
|
|
<li>set_current_profit() : <a class="el" href="classoperations__research_1_1_knapsack_search_node.html#a48521e7b1a381bd3f3f452fa6e697bde">KnapsackSearchNode</a></li>
|
|
|
|
|
<li>set_master_propagator_id() : <a class="el" href="classoperations__research_1_1_knapsack_generic_solver.html#a3df2fc3d96fbcac78a632d7dbf3b8550">KnapsackGenericSolver</a></li>
|
|
|
|
|
<li>set_next_item_id() : <a class="el" href="classoperations__research_1_1_knapsack_search_node.html#a9962698a737cd21789c77ff32bef0d98">KnapsackSearchNode</a></li>
|
|
|
|
|
<li>set_profit_lower_bound() : <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#ae29226a5be6204e26f1d563a6630ab9e">KnapsackPropagator</a></li>
|
|
|
|
|
<li>set_profit_upper_bound() : <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#af991b29f273c53c8b35cb09bcccf3a5d">KnapsackPropagator</a>, <a class="el" href="classoperations__research_1_1_knapsack_search_node.html#af991b29f273c53c8b35cb09bcccf3a5d">KnapsackSearchNode</a></li>
|
|
|
|
|
<li>set_time_limit() : <a class="el" href="classoperations__research_1_1_knapsack_solver.html#a6b4f6cbb00a64b0e9745938f9b99d0c8">KnapsackSolver</a></li>
|
|
|
|
|
<li>set_use_reduction() : <a class="el" href="classoperations__research_1_1_knapsack_solver.html#aa5b8e0a03c593bfc3cef0ba8d178844f">KnapsackSolver</a></li>
|
|
|
|
|
<li>Size() : <a class="el" href="classoperations__research_1_1_dense_doubly_linked_list.html#a24926108b770033792d015cb86aeffb3">DenseDoublyLinkedList</a></li>
|
|
|
|
|
<li>size() : <a class="el" href="structoperations__research_1_1_dynamic_partition_1_1_iterable_part.html#af9593d4a5ff4274efaf429cb4f9e57cc">DynamicPartition::IterablePart</a></li>
|
|
|
|
|
<li>Size() : <a class="el" href="classoperations__research_1_1_dynamic_permutation.html#a24926108b770033792d015cb86aeffb3">DynamicPermutation</a></li>
|
|
|
|
|
<li>size() : <a class="el" href="structoperations__research_1_1_sparse_permutation_1_1_iterator.html#af9593d4a5ff4274efaf429cb4f9e57cc">SparsePermutation::Iterator</a></li>
|
|
|
|
|
<li>Size() : <a class="el" href="classoperations__research_1_1_sparse_permutation.html#a24926108b770033792d015cb86aeffb3">SparsePermutation</a></li>
|
|
|
|
|
<li>SizeOfPart() : <a class="el" href="classoperations__research_1_1_dynamic_partition.html#a5634a596b0aa63843c28e8ed69e653ca">DynamicPartition</a></li>
|
|
|
|
|
<li>Solve() : <a class="el" href="classoperations__research_1_1_base_knapsack_solver.html#aae09d1be6e3ce3d746c833f7da003de9">BaseKnapsackSolver</a>, <a class="el" href="classoperations__research_1_1_knapsack_generic_solver.html#a788a597dac89a082d3ed4994d654dec1">KnapsackGenericSolver</a>, <a class="el" href="classoperations__research_1_1_knapsack_solver.html#a7f5467b49f2cba3d8804e44ed76e12a2">KnapsackSolver</a></li>
|
|
|
|
|
<li>SparsePermutation() : <a class="el" href="classoperations__research_1_1_sparse_permutation.html#a1d5b283f6fa63b162d0dd2b58333ca19">SparsePermutation</a></li>
|
|
|
|
|
<li>state() : <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#afebda22d5e2e068671aa4dbfbe9024df">KnapsackPropagator</a></li>
|
|
|
|
|
<li>Support() : <a class="el" href="classoperations__research_1_1_sparse_permutation.html#a82f200c590897fcfb10aca6cfc536109">SparsePermutation</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_t" name="index_t"></a>- t -</h3><ul>
|
|
|
|
|
<li>to() : <a class="el" href="classoperations__research_1_1_knapsack_search_path.html#ad0e1cf5e8520cb7a59cad8d6aecdf8a6">KnapsackSearchPath</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_u" name="index_u"></a>- u -</h3><ul>
|
|
|
|
|
<li>UndoLastMappings() : <a class="el" href="classoperations__research_1_1_dynamic_permutation.html#ae8f61c84a06024a7d6343902f44e7e59">DynamicPermutation</a></li>
|
|
|
|
|
<li>UndoRefineUntilNumPartsEqual() : <a class="el" href="classoperations__research_1_1_dynamic_partition.html#a59a35941a5a6eb3747faddb449a49e2a">DynamicPartition</a></li>
|
|
|
|
|
<li>Update() : <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#af4b38123d3654471f0868774c5ff877d">KnapsackPropagator</a></li>
|
|
|
|
|
<li>UpdatePropagator() : <a class="el" href="classoperations__research_1_1_knapsack_capacity_propagator.html#a3cde41b7fa0c9734783a562aadd9ef8c">KnapsackCapacityPropagator</a>, <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#a5a0d11be6f0d5b521477226fb7573db8">KnapsackPropagator</a></li>
|
|
|
|
|
<li>UpdateState() : <a class="el" href="classoperations__research_1_1_knapsack_state.html#ab771ac0e538f991b73b011ee3ba11f05">KnapsackState</a></li>
|
|
|
|
|
<li>use_reduction() : <a class="el" href="classoperations__research_1_1_knapsack_solver.html#ac7d0a3efa2aabe6a3e667b0724f63688">KnapsackSolver</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index_v" name="index_v"></a>- v -</h3><ul>
|
|
|
|
|
<li>via() : <a class="el" href="classoperations__research_1_1_knapsack_search_path.html#ab54cc176a72a1a03b18cb3f9649c773a">KnapsackSearchPath</a></li>
|
2019-08-07 18:01:08 -07:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
|
|
|
2022-01-17 21:42:14 +01:00
|
|
|
<h3><a id="index__7E" name="index__7E"></a>- ~ -</h3><ul>
|
|
|
|
|
<li>~BaseKnapsackSolver() : <a class="el" href="classoperations__research_1_1_base_knapsack_solver.html#ab5b44517ac32ba76590129831a826096">BaseKnapsackSolver</a></li>
|
|
|
|
|
<li>~KnapsackCapacityPropagator() : <a class="el" href="classoperations__research_1_1_knapsack_capacity_propagator.html#aa14e63156675c18c06073ac1cb8aa170">KnapsackCapacityPropagator</a></li>
|
|
|
|
|
<li>~KnapsackGenericSolver() : <a class="el" href="classoperations__research_1_1_knapsack_generic_solver.html#a2a25594d97a0a532f9d814bdc6dea380">KnapsackGenericSolver</a></li>
|
|
|
|
|
<li>~KnapsackPropagator() : <a class="el" href="classoperations__research_1_1_knapsack_propagator.html#accafea74a5951ec85cd803541f3ab3fe">KnapsackPropagator</a></li>
|
|
|
|
|
<li>~KnapsackSolver() : <a class="el" href="classoperations__research_1_1_knapsack_solver.html#adecc1cf1fe064b843459dd1f8aec12ff">KnapsackSolver</a></li>
|
2019-06-26 07:59:17 +02:00
|
|
|
</ul>
|
|
|
|
|
</div><!-- contents -->
|
2020-09-01 16:00:33 +02:00
|
|
|
</div><!-- doc-content -->
|
2019-08-07 18:01:08 -07:00
|
|
|
</div>
|
2019-06-26 07:59:17 +02:00
|
|
|
</div>
|
|
|
|
|
<div id="footer-container">
|
|
|
|
|
<div id="footer">
|
|
|
|
|
</div>
|
|
|
|
|
</div>
|
|
|
|
|
</body>
|
|
|
|
|
</html>
|
