more work on doc: add cpp/algorithms; remove samples from java doc; add more documentation on the domain class
This commit is contained in:
@@ -309,46 +309,6 @@
|
||||
<tr id="row_0_0_0_5_2_" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="enumcom_1_1google_1_1ortools_1_1util_1_1OptionalBoolean.html" target="_self">OptionalBoolean</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_0_0_0_5_3_" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classcom_1_1google_1_1ortools_1_1util_1_1OptionalBooleanOuterClass.html" target="_self">OptionalBooleanOuterClass</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_0_0_0_5_4_" style="display:none;"><td class="entry"><span style="width:80px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classcom_1_1google_1_1ortools_1_1util_1_1SortedDisjointIntervalList.html" target="_self">SortedDisjointIntervalList</a></td><td class="desc">This class represents a sorted list of disjoint, closed intervals </td></tr>
|
||||
<tr id="row_1_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classBinPackingProblemSat.html" target="_self">BinPackingProblemSat</a></td><td class="desc">Solves a bin packing problem with the CP-SAT solver </td></tr>
|
||||
<tr id="row_2_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classBoolOrSampleSat.html" target="_self">BoolOrSampleSat</a></td><td class="desc">Code sample to demonstrates a simple Boolean constraint </td></tr>
|
||||
<tr id="row_3_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classChannelingSampleSat.html" target="_self">ChannelingSampleSat</a></td><td class="desc">Link integer constraints together </td></tr>
|
||||
<tr id="row_4_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classCpIsFunSat.html" target="_self">CpIsFunSat</a></td><td class="desc">Cryptarithmetic puzzle </td></tr>
|
||||
<tr id="row_5_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classEarlinessTardinessCostSampleSat.html" target="_self">EarlinessTardinessCostSampleSat</a></td><td class="desc">Encode the piecewise linear expression </td></tr>
|
||||
<tr id="row_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classIntervalSampleSat.html" target="_self">IntervalSampleSat</a></td><td class="desc">Code sample to demonstrates how to build an interval </td></tr>
|
||||
<tr id="row_7_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classKnapsack.html" target="_self">Knapsack</a></td><td class="desc">Sample showing how to model using the knapsack solver </td></tr>
|
||||
<tr id="row_8_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classLinearProgrammingExample.html" target="_self">LinearProgrammingExample</a></td><td class="desc">Simple linear programming example </td></tr>
|
||||
<tr id="row_9_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classLiteralSampleSat.html" target="_self">LiteralSampleSat</a></td><td class="desc">Code sample to demonstrate Boolean variable and literals </td></tr>
|
||||
<tr id="row_10_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classNoOverlapSampleSat.html" target="_self">NoOverlapSampleSat</a></td><td class="desc">We want to schedule 3 tasks on 3 weeks excluding weekends, making the final day as early as possible </td></tr>
|
||||
<tr id="row_11_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classOptionalIntervalSampleSat.html" target="_self">OptionalIntervalSampleSat</a></td><td class="desc">Code sample to demonstrates how to build an optional interval </td></tr>
|
||||
<tr id="row_12_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classRabbitsAndPheasantsSat.html" target="_self">RabbitsAndPheasantsSat</a></td><td class="desc">In a field of rabbits and pheasants, there are 20 heads and 56 legs </td></tr>
|
||||
<tr id="row_13_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classRankingSampleSat.html" target="_self">RankingSampleSat</a></td><td class="desc">Code sample to demonstrates how to rank intervals </td></tr>
|
||||
<tr id="row_14_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classReifiedSampleSat.html" target="_self">ReifiedSampleSat</a></td><td class="desc">Reification is the action of associating a Boolean variable to a constraint </td></tr>
|
||||
<tr id="row_15_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classSearchForAllSolutionsSampleSat.html" target="_self">SearchForAllSolutionsSampleSat</a></td><td class="desc">Code sample that solves a model and displays all solutions </td></tr>
|
||||
<tr id="row_16_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classSimpleCpProgram.html" target="_self">SimpleCpProgram</a></td><td class="desc">Simple CP Program </td></tr>
|
||||
<tr id="row_17_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classSimpleLpProgram.html" target="_self">SimpleLpProgram</a></td><td class="desc">Minimal Linear Programming example to showcase calling the solver </td></tr>
|
||||
<tr id="row_18_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classSimpleMipProgram.html" target="_self">SimpleMipProgram</a></td><td class="desc">Minimal Mixed Integer Programming example to showcase calling the solver </td></tr>
|
||||
<tr id="row_19_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classSimpleRoutingProgram.html" target="_self">SimpleRoutingProgram</a></td><td class="desc">Minimal Routing example to showcase calling the solver </td></tr>
|
||||
<tr id="row_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classSimpleSatProgram.html" target="_self">SimpleSatProgram</a></td><td class="desc">Minimal CP-SAT example to showcase calling the solver </td></tr>
|
||||
<tr id="row_21_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classSolveAndPrintIntermediateSolutionsSampleSat.html" target="_self">SolveAndPrintIntermediateSolutionsSampleSat</a></td><td class="desc">Solves an optimization problem and displays all intermediate solutions </td></tr>
|
||||
<tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classSolveWithTimeLimitSampleSat.html" target="_self">SolveWithTimeLimitSampleSat</a></td><td class="desc">Solves a problem with a time limit </td></tr>
|
||||
<tr id="row_23_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classStepFunctionSampleSat.html" target="_self">StepFunctionSampleSat</a></td><td class="desc">Link integer constraints together </td></tr>
|
||||
<tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classStopAfterNSolutionsSampleSat.html" target="_self">StopAfterNSolutionsSampleSat</a></td><td class="desc">Code sample that solves a model and displays a small number of solutions </td></tr>
|
||||
<tr id="row_25_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classTsp.html" target="_self">Tsp</a></td><td class="desc">Minimal TSP </td></tr>
|
||||
<tr id="row_26_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classTspCircuitBoard.html" target="_self">TspCircuitBoard</a></td><td class="desc">Minimal TSP </td></tr>
|
||||
<tr id="row_27_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classTspCities.html" target="_self">TspCities</a></td><td class="desc">Minimal TSP using distance matrix </td></tr>
|
||||
<tr id="row_28_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classTspDistanceMatrix.html" target="_self">TspDistanceMatrix</a></td><td class="desc">Minimal TSP using distance matrix </td></tr>
|
||||
<tr id="row_29_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classVrp.html" target="_self">Vrp</a></td><td class="desc">Minimal VRP </td></tr>
|
||||
<tr id="row_30_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classVrpCapacity.html" target="_self">VrpCapacity</a></td><td class="desc">Minimal VRP </td></tr>
|
||||
<tr id="row_31_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classVrpDropNodes.html" target="_self">VrpDropNodes</a></td><td class="desc">Minimal VRP </td></tr>
|
||||
<tr id="row_32_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classVrpGlobalSpan.html" target="_self">VrpGlobalSpan</a></td><td class="desc">Minimal VRP </td></tr>
|
||||
<tr id="row_33_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classVrpInitialRoutes.html" target="_self">VrpInitialRoutes</a></td><td class="desc">Minimal VRP </td></tr>
|
||||
<tr id="row_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classVrpPickupDelivery.html" target="_self">VrpPickupDelivery</a></td><td class="desc">Minimal Pickup & Delivery Problem (PDP) </td></tr>
|
||||
<tr id="row_35_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classVrpPickupDeliveryFifo.html" target="_self">VrpPickupDeliveryFifo</a></td><td class="desc">Minimal Pickup & Delivery Problem (PDP) </td></tr>
|
||||
<tr id="row_36_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classVrpPickupDeliveryLifo.html" target="_self">VrpPickupDeliveryLifo</a></td><td class="desc">Minimal Pickup & Delivery Problem (PDP) </td></tr>
|
||||
<tr id="row_37_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classVrpResources.html" target="_self">VrpResources</a></td><td class="desc">Minimal VRP with Resource Constraints </td></tr>
|
||||
<tr id="row_38_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classVrpStartsEnds.html" target="_self">VrpStartsEnds</a></td><td class="desc">Minimal VRP </td></tr>
|
||||
<tr id="row_39_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classVrpTimeWindows.html" target="_self">VrpTimeWindows</a></td><td class="desc">Minimal VRP </td></tr>
|
||||
<tr id="row_40_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classVrpWithTimeLimit.html" target="_self">VrpWithTimeLimit</a></td><td class="desc">Minimal VRP </td></tr>
|
||||
</table>
|
||||
</div><!-- directory -->
|
||||
</div><!-- contents -->
|
||||
|
||||
Reference in New Issue
Block a user