75 lines
13 KiB
HTML
75 lines
13 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="ortools.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.2</span>
|
|
</div>
|
|
</div>
|
|
<link rel="icon" href="https://developers.google.com/optimization/images/orLogo.png">
|
|
<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 class="current"><a href="annotated.html"><span>Classes</span></a></li>
|
|
<li><a href="files.html"><span>Files</span></a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="navrow2" class="tabs2">
|
|
<ul class="tablist">
|
|
<li class="current"><a href="annotated.html"><span>Class List</span></a></li>
|
|
<li><a href="classes.html"><span>Class Index</span></a></li>
|
|
<li><a href="inherits.html"><span>Class Hierarchy</span></a></li>
|
|
<li><a href="functions.html"><span>Class Members</span></a></li>
|
|
</ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">Class List</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<div class="textblock">Here are the classes, structs, unions and interfaces with brief descriptions:</div><div class="directory">
|
|
<div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span><span onclick="javascript:toggleLevel(3);">3</span>]</div><table class="directory">
|
|
<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespaceoperations__research.html" target="_self">operations_research</a></td><td class="desc">Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License </td></tr>
|
|
<tr id="row_0_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1BaseKnapsackSolver.html" target="_self">BaseKnapsackSolver</a></td><td class="desc">--— <a class="el" href="classoperations__research_1_1BaseKnapsackSolver.html" title="--— BaseKnapsackSolver --— This is the base class for knapsack solvers.">BaseKnapsackSolver</a> --— This is the base class for knapsack solvers </td></tr>
|
|
<tr id="row_0_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1DenseDoublyLinkedList.html" target="_self">DenseDoublyLinkedList</a></td><td class="desc">Specialized doubly-linked list that initially holds [0..n-1] in an arbitrary (user-specified) and fixed order </td></tr>
|
|
<tr id="row_0_2_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_0_2_" class="arrow" onclick="toggleFolder('0_2_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1DynamicPartition.html" target="_self">DynamicPartition</a></td><td class="desc">Partition class that supports incremental splitting, with backtracking </td></tr>
|
|
<tr id="row_0_2_0_" class="even"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1DynamicPartition_1_1IterablePart.html" target="_self">IterablePart</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_3_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1DynamicPermutation.html" target="_self">DynamicPermutation</a></td><td class="desc">Maintains a 'partial' permutation of [0..n-1] onto itself, with a dynamic API allowing it to be built incrementally, and allowing some backtracking </td></tr>
|
|
<tr id="row_0_4_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1GraphSymmetryFinder.html" target="_self">GraphSymmetryFinder</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_5_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1KnapsackAssignment.html" target="_self">KnapsackAssignment</a></td><td class="desc">--— KnapsackAssignement --— KnapsackAssignement is a small struct used to pair an item with its assignment </td></tr>
|
|
<tr id="row_0_6_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1KnapsackCapacityPropagator.html" target="_self">KnapsackCapacityPropagator</a></td><td class="desc">--— <a class="el" href="classoperations__research_1_1KnapsackCapacityPropagator.html" title="--— KnapsackCapacityPropagator --— KnapsackCapacityPropagator is a KnapsackPropagator used to enforce...">KnapsackCapacityPropagator</a> --— <a class="el" href="classoperations__research_1_1KnapsackCapacityPropagator.html" title="--— KnapsackCapacityPropagator --— KnapsackCapacityPropagator is a KnapsackPropagator used to enforce...">KnapsackCapacityPropagator</a> is a <a class="el" href="classoperations__research_1_1KnapsackPropagator.html" title="--— KnapsackPropagator --— KnapsackPropagator is the base class for modeling and propagating a constr...">KnapsackPropagator</a> used to enforce a capacity constraint </td></tr>
|
|
<tr id="row_0_7_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1KnapsackGenericSolver.html" target="_self">KnapsackGenericSolver</a></td><td class="desc">--— <a class="el" href="classoperations__research_1_1KnapsackGenericSolver.html" title="--— KnapsackGenericSolver --— KnapsackGenericSolver is the multi-dimensional knapsack solver class.">KnapsackGenericSolver</a> --— <a class="el" href="classoperations__research_1_1KnapsackGenericSolver.html" title="--— KnapsackGenericSolver --— KnapsackGenericSolver is the multi-dimensional knapsack solver class.">KnapsackGenericSolver</a> is the multi-dimensional knapsack solver class </td></tr>
|
|
<tr id="row_0_8_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1KnapsackItem.html" target="_self">KnapsackItem</a></td><td class="desc">--— <a class="el" href="structoperations__research_1_1KnapsackItem.html" title="--— KnapsackItem --— KnapsackItem is a small struct to pair an item weight with its corresponding pro...">KnapsackItem</a> --— <a class="el" href="structoperations__research_1_1KnapsackItem.html" title="--— KnapsackItem --— KnapsackItem is a small struct to pair an item weight with its corresponding pro...">KnapsackItem</a> is a small struct to pair an item weight with its corresponding profit </td></tr>
|
|
<tr id="row_0_9_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1KnapsackPropagator.html" target="_self">KnapsackPropagator</a></td><td class="desc">--— <a class="el" href="classoperations__research_1_1KnapsackPropagator.html" title="--— KnapsackPropagator --— KnapsackPropagator is the base class for modeling and propagating a constr...">KnapsackPropagator</a> --— <a class="el" href="classoperations__research_1_1KnapsackPropagator.html" title="--— KnapsackPropagator --— KnapsackPropagator is the base class for modeling and propagating a constr...">KnapsackPropagator</a> is the base class for modeling and propagating a constraint given an assignment </td></tr>
|
|
<tr id="row_0_10_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1KnapsackSearchNode.html" target="_self">KnapsackSearchNode</a></td><td class="desc">--— <a class="el" href="classoperations__research_1_1KnapsackSearchNode.html" title="--— KnapsackSearchNode --— KnapsackSearchNode is a class used to describe a decision in the decision ...">KnapsackSearchNode</a> --— <a class="el" href="classoperations__research_1_1KnapsackSearchNode.html" title="--— KnapsackSearchNode --— KnapsackSearchNode is a class used to describe a decision in the decision ...">KnapsackSearchNode</a> is a class used to describe a decision in the decision search tree </td></tr>
|
|
<tr id="row_0_11_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1KnapsackSearchPath.html" target="_self">KnapsackSearchPath</a></td><td class="desc">--— <a class="el" href="classoperations__research_1_1KnapsackSearchPath.html" title="--— KnapsackSearchPath --— KnapsackSearchPath is a small class used to represent the path between a n...">KnapsackSearchPath</a> --— <a class="el" href="classoperations__research_1_1KnapsackSearchPath.html" title="--— KnapsackSearchPath --— KnapsackSearchPath is a small class used to represent the path between a n...">KnapsackSearchPath</a> is a small class used to represent the path between a node to another node in the search tree </td></tr>
|
|
<tr id="row_0_12_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1KnapsackSolver.html" target="_self">KnapsackSolver</a></td><td class="desc"></td></tr>
|
|
<tr id="row_0_13_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1KnapsackState.html" target="_self">KnapsackState</a></td><td class="desc">--— <a class="el" href="classoperations__research_1_1KnapsackState.html" title="--— KnapsackState --— KnapsackState represents a partial solution to the knapsack problem.">KnapsackState</a> --— <a class="el" href="classoperations__research_1_1KnapsackState.html" title="--— KnapsackState --— KnapsackState represents a partial solution to the knapsack problem.">KnapsackState</a> represents a partial solution to the knapsack problem </td></tr>
|
|
<tr id="row_0_14_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1MergingPartition.html" target="_self">MergingPartition</a></td><td class="desc">Partition class that supports incremental merging, using the union-find algorithm (see <a href="http://en.wikipedia.org/wiki/Disjoint-set_data_structure">http://en.wikipedia.org/wiki/Disjoint-set_data_structure</a>) </td></tr>
|
|
<tr id="row_0_15_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_0_15_" class="arrow" onclick="toggleFolder('0_15_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classoperations__research_1_1SparsePermutation.html" target="_self">SparsePermutation</a></td><td class="desc">A compact representation for permutations of {0..N-1} that displaces few elements: it needs only O(K) memory for a permutation that displaces K elements </td></tr>
|
|
<tr id="row_0_15_0_" class="even"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structoperations__research_1_1SparsePermutation_1_1Iterator.html" target="_self">Iterator</a></td><td class="desc"></td></tr>
|
|
</table>
|
|
</div><!-- directory -->
|
|
</div><!-- contents -->
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|