41 lines
7.6 KiB
Plaintext
41 lines
7.6 KiB
Plaintext
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
|
<area shape="rect" id="node1" title=" " alt="" coords="5,925,129,952"/>
|
|
<area shape="rect" id="node2" href="$classGoogle_1_1OrTools_1_1ConstraintSolver_1_1ConstraintSolverParameters.html" title="Solver parameters." alt="" coords="191,309,396,336"/>
|
|
<area shape="rect" id="node3" href="$classGoogle_1_1OrTools_1_1ConstraintSolver_1_1FirstSolutionStrategy.html" title="First solution strategies, used as starting point of local search." alt="" coords="215,360,372,387"/>
|
|
<area shape="rect" id="node4" href="$classGoogle_1_1OrTools_1_1ConstraintSolver_1_1LocalSearchMetaheuristic.html" title="Local search metaheuristics used to guide the search." alt="" coords="199,411,388,437"/>
|
|
<area shape="rect" id="node5" href="$classGoogle_1_1OrTools_1_1ConstraintSolver_1_1RegularLimitParameters.html" title="A search limit The default values for int64 fields is the maxima value, i.e., 2^63-1" alt="" coords="203,461,383,488"/>
|
|
<area shape="rect" id="node6" href="$classGoogle_1_1OrTools_1_1ConstraintSolver_1_1RoutingModelParameters.html" title="Parameters which have to be set when creating a RoutingModel." alt="" coords="200,512,387,539"/>
|
|
<area shape="rect" id="node7" href="$classGoogle_1_1OrTools_1_1ConstraintSolver_1_1RoutingSearchParameters.html" title="Parameters defining the search used to solve vehicle routing problems." alt="" coords="198,563,389,589"/>
|
|
<area shape="rect" id="node8" href="$classGoogle_1_1OrTools_1_1ConstraintSolver_1_1RoutingSearchParameters_1_1Types_1_1ImprovementSearchLimitParameters.html" title="Parameters required for the improvement search limit." alt="" coords="179,613,407,669"/>
|
|
<area shape="rect" id="node9" href="$classGoogle_1_1OrTools_1_1ConstraintSolver_1_1RoutingSearchParameters_1_1Types_1_1LocalSearchNeighborhoodOperators.html" title="Local search neighborhood operators used to build a solutions neighborhood." alt="" coords="177,693,409,749"/>
|
|
<area shape="rect" id="node10" href="$classGoogle_1_1OrTools_1_1Sat_1_1AllDifferentConstraintProto.html" title="All variables must take different values." alt="" coords="194,773,393,800"/>
|
|
<area shape="rect" id="node11" href="$classGoogle_1_1OrTools_1_1Sat_1_1AutomatonConstraintProto.html" title="This constraint forces a sequence of variables to be accepted by an automaton." alt="" coords="196,824,391,851"/>
|
|
<area shape="rect" id="node12" href="$classGoogle_1_1OrTools_1_1Sat_1_1BoolArgumentProto.html" title="Argument of the constraints of the form OP(literals)." alt="" coords="219,875,368,901"/>
|
|
<area shape="rect" id="node13" href="$classGoogle_1_1OrTools_1_1Sat_1_1CircuitConstraintProto.html" title="The circuit constraint is defined on a graph where the arc presence are controlled by literals." alt="" coords="211,925,376,952"/>
|
|
<area shape="rect" id="node14" href="$classGoogle_1_1OrTools_1_1Sat_1_1ConstraintProto.html" title="Next id: 30" alt="" coords="232,976,355,1003"/>
|
|
<area shape="rect" id="node15" href="$classGoogle_1_1OrTools_1_1Sat_1_1CpModelProto.html" title="A constraint programming problem." alt="" coords="237,1027,350,1053"/>
|
|
<area shape="rect" id="node16" href="$classGoogle_1_1OrTools_1_1Sat_1_1CpObjectiveProto.html" title="Optimization objective." alt="" coords="226,1077,361,1104"/>
|
|
<area shape="rect" id="node17" href="$classGoogle_1_1OrTools_1_1Sat_1_1CpSolverResponse.html" title="The response returned by a solver trying to solve a CpModelProto." alt="" coords="222,1128,365,1155"/>
|
|
<area shape="rect" id="node18" href="$classGoogle_1_1OrTools_1_1Sat_1_1CumulativeConstraintProto.html" title="The sum of the demands of the intervals at each interval point cannot exceed a capacity." alt="" coords="194,1179,393,1205"/>
|
|
<area shape="rect" id="node19" href="$classGoogle_1_1OrTools_1_1Sat_1_1DecisionStrategyProto.html" title="Define the strategy to follow when the solver needs to take a new decision." alt="" coords="210,1229,377,1256"/>
|
|
<area shape="rect" id="node20" href="$classGoogle_1_1OrTools_1_1Sat_1_1DecisionStrategyProto_1_1Types_1_1AffineTransformation.html" title="Advanced usage." alt="" coords="187,1281,399,1322"/>
|
|
<area shape="rect" id="node21" href="$classGoogle_1_1OrTools_1_1Sat_1_1DenseMatrixProto.html" title="A dense matrix of numbers encoded in a flat way, row by row." alt="" coords="224,1347,363,1373"/>
|
|
<area shape="rect" id="node22" href="$classGoogle_1_1OrTools_1_1Sat_1_1ElementConstraintProto.html" title="The constraint target = vars[index]." alt="" coords="205,1397,382,1424"/>
|
|
<area shape="rect" id="node23" href="$classGoogle_1_1OrTools_1_1Sat_1_1IntegerArgumentProto.html" title="Argument of the constraints of the form target_var = OP(vars)." alt="" coords="210,1448,377,1475"/>
|
|
<area shape="rect" id="node24" href="$classGoogle_1_1OrTools_1_1Sat_1_1IntegerVariableProto.html" title="An integer variable." alt="" coords="215,1499,371,1525"/>
|
|
<area shape="rect" id="node25" href="$classGoogle_1_1OrTools_1_1Sat_1_1IntervalConstraintProto.html" title="This "special" constraint not only enforces (start + size == end) and (size >= 0) but can also be ref..." alt="" coords="207,1549,380,1576"/>
|
|
<area shape="rect" id="node26" href="$classGoogle_1_1OrTools_1_1Sat_1_1InverseConstraintProto.html" title="The two arrays of variable each represent a function, the second is the inverse of the first: f_direc..." alt="" coords="208,1600,379,1627"/>
|
|
<area shape="rect" id="node27" href="$classGoogle_1_1OrTools_1_1Sat_1_1LinearArgumentProto.html" title=" " alt="" coords="213,1651,373,1677"/>
|
|
<area shape="rect" id="node28" href="$classGoogle_1_1OrTools_1_1Sat_1_1LinearConstraintProto.html" title="The linear sum vars[i] * coeffs[i] must fall in the given domain." alt="" coords="212,1701,375,1728"/>
|
|
<area shape="rect" id="node29" href="$classGoogle_1_1OrTools_1_1Sat_1_1LinearExpressionProto.html" title="Some constraints supports linear expression instead of just using a reference to a variable." alt="" coords="210,1752,377,1779"/>
|
|
<area shape="rect" id="node30" href="$classGoogle_1_1OrTools_1_1Sat_1_1NoOverlap2DConstraintProto.html" title="The boxes defined by [start_x, end_x) * [start_y, end_y) cannot overlap." alt="" coords="188,1803,399,1829"/>
|
|
<area shape="rect" id="node31" href="$classGoogle_1_1OrTools_1_1Sat_1_1NoOverlapConstraintProto.html" title="All the intervals (index of IntervalConstraintProto) must be disjoint." alt="" coords="197,1853,389,1880"/>
|
|
<area shape="rect" id="node32" href="$classGoogle_1_1OrTools_1_1Sat_1_1PartialVariableAssignment.html" title="This message encodes a partial (or full) assignment of the variables of a CpModelProto." alt="" coords="196,5,391,32"/>
|
|
<area shape="rect" id="node33" href="$classGoogle_1_1OrTools_1_1Sat_1_1ReservoirConstraintProto.html" title="Maintain a reservoir level within bounds." alt="" coords="201,56,386,83"/>
|
|
<area shape="rect" id="node34" href="$classGoogle_1_1OrTools_1_1Sat_1_1RoutesConstraintProto.html" title="The "VRP" (Vehicle Routing Problem) constraint." alt="" coords="209,107,377,133"/>
|
|
<area shape="rect" id="node35" href="$classGoogle_1_1OrTools_1_1Sat_1_1SparsePermutationProto.html" title="A permutation of integers encoded as a list of cycles, hence the "sparse" format." alt="" coords="203,157,383,184"/>
|
|
<area shape="rect" id="node36" href="$classGoogle_1_1OrTools_1_1Sat_1_1SymmetryProto.html" title="Experimental." alt="" coords="231,208,355,235"/>
|
|
<area shape="rect" id="node37" href="$classGoogle_1_1OrTools_1_1Sat_1_1TableConstraintProto.html" title="The values of the n-tuple formed by the given variables can only be one of the listed n-tuples in val..." alt="" coords="215,259,372,285"/>
|
|
<area shape="rect" id="node38" title=" " alt="" coords="25,976,109,1003"/>
|
|
</map>
|