242 lines
15 KiB
HTML
242 lines
15 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">Google OR-Tools 7.5</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: Routing</h1>
|
|
</div>
|
|
<!-- Generated by Doxygen 1.8.18 -->
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<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="nav-path" class="navpath">
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="namespaceoperations__research.html">operations_research</a></li><li class="navelem"><a class="el" href="classoperations__research_1_1DisjunctivePropagator.html">DisjunctivePropagator</a></li> </ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="summary">
|
|
<a href="#nested-classes">Classes</a> |
|
|
<a href="#pub-methods">Public Member Functions</a> |
|
|
<a href="classoperations__research_1_1DisjunctivePropagator-members.html">List of all members</a> </div>
|
|
<div class="headertitle">
|
|
<div class="title">DisjunctivePropagator</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
|
<div class="textblock"><p>This class acts like a CP propagator: it takes a set of tasks given by their start/duration/end features, and reduces the range of possible values. </p>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="routing_8h_source.html#l01735">1735</a> of file <a class="el" href="routing_8h_source.html">routing.h</a>.</p>
|
|
</div><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
|
|
Classes</h2></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_1DisjunctivePropagator_1_1Tasks.html">Tasks</a></td></tr>
|
|
<tr class="memdesc:"><td class="mdescLeft"> </td><td class="mdescRight">A structure to hold tasks described by their features. <a href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html#details">More...</a><br /></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 name="pub-methods"></a>
|
|
Public Member Functions</h2></td></tr>
|
|
<tr class="memitem:a8a31c563d28e1ebe7c9e140f15fea586"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1DisjunctivePropagator.html#a8a31c563d28e1ebe7c9e140f15fea586">Propagate</a> (<a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> *tasks)</td></tr>
|
|
<tr class="memdesc:a8a31c563d28e1ebe7c9e140f15fea586"><td class="mdescLeft"> </td><td class="mdescRight">Computes new bounds for all tasks, returns false if infeasible. <a href="classoperations__research_1_1DisjunctivePropagator.html#a8a31c563d28e1ebe7c9e140f15fea586">More...</a><br /></td></tr>
|
|
<tr class="separator:a8a31c563d28e1ebe7c9e140f15fea586"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a0d1ed47f6804807e925b489b24fb8d04"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1DisjunctivePropagator.html#a0d1ed47f6804807e925b489b24fb8d04">Precedences</a> (<a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> *tasks)</td></tr>
|
|
<tr class="memdesc:a0d1ed47f6804807e925b489b24fb8d04"><td class="mdescLeft"> </td><td class="mdescRight">Propagates the deductions from the chain of precedences, if there is one. <a href="classoperations__research_1_1DisjunctivePropagator.html#a0d1ed47f6804807e925b489b24fb8d04">More...</a><br /></td></tr>
|
|
<tr class="separator:a0d1ed47f6804807e925b489b24fb8d04"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a29620476a22fde70929c77dc6342be0e"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1DisjunctivePropagator.html#a29620476a22fde70929c77dc6342be0e">MirrorTasks</a> (<a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> *tasks)</td></tr>
|
|
<tr class="memdesc:a29620476a22fde70929c77dc6342be0e"><td class="mdescLeft"> </td><td class="mdescRight">Transforms the problem with a time symmetry centered in 0. <a href="classoperations__research_1_1DisjunctivePropagator.html#a29620476a22fde70929c77dc6342be0e">More...</a><br /></td></tr>
|
|
<tr class="separator:a29620476a22fde70929c77dc6342be0e"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a08f43a826695abdbdad1c608cb90b25a"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1DisjunctivePropagator.html#a08f43a826695abdbdad1c608cb90b25a">EdgeFinding</a> (<a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> *tasks)</td></tr>
|
|
<tr class="memdesc:a08f43a826695abdbdad1c608cb90b25a"><td class="mdescLeft"> </td><td class="mdescRight">Does edge-finding deductions on all tasks. <a href="classoperations__research_1_1DisjunctivePropagator.html#a08f43a826695abdbdad1c608cb90b25a">More...</a><br /></td></tr>
|
|
<tr class="separator:a08f43a826695abdbdad1c608cb90b25a"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:aa9b624e65cb55b3d74ad35a3a675f9ea"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1DisjunctivePropagator.html#aa9b624e65cb55b3d74ad35a3a675f9ea">DetectablePrecedencesWithChain</a> (<a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> *tasks)</td></tr>
|
|
<tr class="memdesc:aa9b624e65cb55b3d74ad35a3a675f9ea"><td class="mdescLeft"> </td><td class="mdescRight">Does detectable precedences deductions on tasks in the chain precedence, taking the time windows of nonchain tasks into account. <a href="classoperations__research_1_1DisjunctivePropagator.html#aa9b624e65cb55b3d74ad35a3a675f9ea">More...</a><br /></td></tr>
|
|
<tr class="separator:aa9b624e65cb55b3d74ad35a3a675f9ea"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a7b0f3a8550bd73014e2b61899524a2ad"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1DisjunctivePropagator.html#a7b0f3a8550bd73014e2b61899524a2ad">ForbiddenIntervals</a> (<a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> *tasks)</td></tr>
|
|
<tr class="memdesc:a7b0f3a8550bd73014e2b61899524a2ad"><td class="mdescLeft"> </td><td class="mdescRight"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html" title="A structure to hold tasks described by their features.">Tasks</a> might have holes in their domain, this enforces such holes. <a href="classoperations__research_1_1DisjunctivePropagator.html#a7b0f3a8550bd73014e2b61899524a2ad">More...</a><br /></td></tr>
|
|
<tr class="separator:a7b0f3a8550bd73014e2b61899524a2ad"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a13e93a8cd8587377e1b8f88096e0efd0"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1DisjunctivePropagator.html#a13e93a8cd8587377e1b8f88096e0efd0">DistanceDuration</a> (<a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> *tasks)</td></tr>
|
|
<tr class="separator:a13e93a8cd8587377e1b8f88096e0efd0"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table>
|
|
<h2 class="groupheader">Member Function Documentation</h2>
|
|
<a id="aa9b624e65cb55b3d74ad35a3a675f9ea"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aa9b624e65cb55b3d74ad35a3a675f9ea">◆ </a></span>DetectablePrecedencesWithChain()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool DetectablePrecedencesWithChain </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> * </td>
|
|
<td class="paramname"><em>tasks</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Does detectable precedences deductions on tasks in the chain precedence, taking the time windows of nonchain tasks into account. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a13e93a8cd8587377e1b8f88096e0efd0"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a13e93a8cd8587377e1b8f88096e0efd0">◆ </a></span>DistanceDuration()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool DistanceDuration </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> * </td>
|
|
<td class="paramname"><em>tasks</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a08f43a826695abdbdad1c608cb90b25a"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a08f43a826695abdbdad1c608cb90b25a">◆ </a></span>EdgeFinding()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool EdgeFinding </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> * </td>
|
|
<td class="paramname"><em>tasks</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Does edge-finding deductions on all tasks. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a7b0f3a8550bd73014e2b61899524a2ad"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a7b0f3a8550bd73014e2b61899524a2ad">◆ </a></span>ForbiddenIntervals()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool ForbiddenIntervals </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> * </td>
|
|
<td class="paramname"><em>tasks</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html" title="A structure to hold tasks described by their features.">Tasks</a> might have holes in their domain, this enforces such holes. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a29620476a22fde70929c77dc6342be0e"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a29620476a22fde70929c77dc6342be0e">◆ </a></span>MirrorTasks()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool MirrorTasks </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> * </td>
|
|
<td class="paramname"><em>tasks</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Transforms the problem with a time symmetry centered in 0. </p>
|
|
<p>Returns true for convenience. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a0d1ed47f6804807e925b489b24fb8d04"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a0d1ed47f6804807e925b489b24fb8d04">◆ </a></span>Precedences()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool Precedences </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> * </td>
|
|
<td class="paramname"><em>tasks</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Propagates the deductions from the chain of precedences, if there is one. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="a8a31c563d28e1ebe7c9e140f15fea586"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a8a31c563d28e1ebe7c9e140f15fea586">◆ </a></span>Propagate()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">bool Propagate </td>
|
|
<td>(</td>
|
|
<td class="paramtype"><a class="el" href="structoperations__research_1_1DisjunctivePropagator_1_1Tasks.html">Tasks</a> * </td>
|
|
<td class="paramname"><em>tasks</em></td><td>)</td>
|
|
<td></td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p>Computes new bounds for all tasks, returns false if infeasible. </p>
|
|
<p>This does not compute a fixed point, so recalling it may filter more. </p>
|
|
|
|
</div>
|
|
</div>
|
|
<hr/>The documentation for this class was generated from the following file:<ul>
|
|
<li><a class="el" href="routing_8h_source.html">routing.h</a></li>
|
|
</ul>
|
|
</div><!-- contents -->
|
|
</div>
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|