Skip to content

Commit 8f458b0

Browse files
svigerskesvigerske
committed
Merge branch 'fix-docstrings-1000' into 'master'
Some more docstring fixes See merge request integer/scip!3821
2 parents fabfdec + 53ba40a commit 8f458b0

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

62 files changed

+364
-345
lines changed

‎applications/Coloring/src/heur_init.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -32,7 +32,7 @@
3232
*
3333
* The heuristic is called only one time: before solving the root node.
3434
*
35-
* It checks, whether a solution-file was read in and a starting solution already exists. If this
35+
* It checks whether a solution-file was read in and a starting solution already exists. If this
3636
* is not the case, an initial possible coloring is computed by a greedy method. After that, a
3737
* tabu-search is called, which tries to reduce the number of colors needed. The tabu-search algorithm
3838
* follows the description in

‎applications/Coloring/src/heur_init.h

+1-1
Original file line numberDiff line numberDiff line change
@@ -32,7 +32,7 @@
3232
*
3333
* The heuristic is called only one time: before solving the root node.
3434
*
35-
* It checks, whether a solution-file was read in and there already is a starting solution. If this
35+
* It checks whether a solution-file was read in and there already is a starting solution. If this
3636
* is not the case, an initial possible coloring is computed by a greedy method. After that, a
3737
* tabu-search is called, which tries to reduce the number of colors needed. The tabu-search algorithm
3838
* follows the description in

‎doc/xternal.c

+2-2
Original file line numberDiff line numberDiff line change
@@ -3451,7 +3451,7 @@
34513451
* \n
34523452
* Note that this property only defines the default value of the priority. The user may change this value arbitrarily by
34533453
* adjusting the corresponding parameter setting. Whenever, even during solving, the priority of a cut selector is
3454-
* changed, the cut selectors are resorted by the new priorities.
3454+
* changed, the cut selectors are re-sorted by the new priorities.
34553455
*
34563456
*
34573457
* @section CUTSEL_DATA Cut Selector Data
@@ -3507,7 +3507,7 @@
35073507
* @subsection CUTSELSELECT
35083508
*
35093509
* The CUTSELSELECT callback should decide which cuts should be added to the relaxation.
3510-
* The callback receives the arrays of cuts to select from. This array must be resorted and the first nselectedcuts from
3510+
* The callback receives the arrays of cuts to select from. This array must be re-sorted and the first nselectedcuts from
35113511
* the sorted array are going to be selected.
35123512
* In addition to the aforementioned cuts, the list of forced cuts is also given as an argument. This array can be used
35133513
* to help with the selection algorithm. Note, however, that this array should not be tampered with.

‎src/blockmemshell/memory.c

+3-3
Original file line numberDiff line numberDiff line change
@@ -158,7 +158,7 @@ static MEMLIST* memlist = NULL; /**< global memory list for debuggi
158158
static size_t memused = 0; /**< number of allocated bytes */
159159

160160
#ifdef CHECKMEM
161-
/** checks, whether the number of allocated bytes match the entries in the memory list */
161+
/** checks whether the number of allocated bytes match the entries in the memory list */
162162
static
163163
void checkMemlist(
164164
void
@@ -783,7 +783,7 @@ int BMSisAligned(
783783
}
784784

785785
#ifndef NDEBUG
786-
/** checks, if the given pointer belongs to the given chunk */
786+
/** checks if the given pointer belongs to the given chunk */
787787
static
788788
int isPtrInChunk(
789789
const CHUNK* chunk, /**< memory chunk */
@@ -819,7 +819,7 @@ CHUNK* findChunk(
819819
return NULL;
820820
}
821821

822-
/** checks, if a pointer belongs to a chunk of the given chunk block */
822+
/** checks if a pointer belongs to a chunk of the given chunk block */
823823
static
824824
int isPtrInChkmem(
825825
const BMS_CHKMEM* chkmem, /**< chunk block */

‎src/lpi/lpi.h

+1-1
Original file line numberDiff line numberDiff line change
@@ -946,7 +946,7 @@ SCIP_RETCODE SCIPlpiFreeState(
946946
SCIP_LPISTATE** lpistate /**< pointer to LPi state information (like basis information) */
947947
);
948948

949-
/** checks, whether the given LPi state contains simplex basis information */
949+
/** checks whether the given LPi state contains simplex basis information */
950950
SCIP_EXPORT
951951
SCIP_Bool SCIPlpiHasStateBasis(
952952
SCIP_LPI* lpi, /**< LP interface structure */

‎src/lpi/lpi_clp.cpp

+2-2
Original file line numberDiff line numberDiff line change
@@ -3518,7 +3518,7 @@ SCIP_RETCODE SCIPlpiFreeState(
35183518
return SCIP_OKAY;
35193519
}
35203520

3521-
/** checks, whether the given LP state contains simplex basis information */
3521+
/** checks whether the given LP state contains simplex basis information */
35223522
SCIP_Bool SCIPlpiHasStateBasis(
35233523
SCIP_LPI* lpi, /**< LP interface structure */
35243524
SCIP_LPISTATE* lpistate /**< LP state information (like basis information), or NULL*/
@@ -3951,7 +3951,7 @@ SCIP_Bool SCIPlpiIsInfinity(
39513951
/**@name File Interface Methods */
39523952
/**@{ */
39533953

3954-
/** returns, whether the given file exists */
3954+
/** returns whether the given file exists */
39553955
static
39563956
SCIP_Bool fileExists(
39573957
const char* filename /**< file name */

‎src/lpi/lpi_cpx.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -4125,7 +4125,7 @@ SCIP_RETCODE SCIPlpiFreeState(
41254125
return SCIP_OKAY;
41264126
}
41274127

4128-
/** checks, whether the given LP state contains simplex basis information */
4128+
/** checks whether the given LP state contains simplex basis information */
41294129
SCIP_Bool SCIPlpiHasStateBasis(
41304130
SCIP_LPI* lpi, /**< LP interface structure */
41314131
SCIP_LPISTATE* lpistate /**< LP state information (like basis information), or NULL */

‎src/lpi/lpi_glop.cpp

+1-1
Original file line numberDiff line numberDiff line change
@@ -2746,7 +2746,7 @@ SCIP_RETCODE SCIPlpiFreeState(
27462746
return SCIP_OKAY;
27472747
}
27482748

2749-
/** checks, whether the given LP state contains simplex basis information */
2749+
/** checks whether the given LP state contains simplex basis information */
27502750
SCIP_Bool SCIPlpiHasStateBasis(
27512751
SCIP_LPI* lpi, /**< LP interface structure */
27522752
SCIP_LPISTATE* lpistate /**< LP state information (like basis information), or NULL */

‎src/lpi/lpi_grb.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -5362,7 +5362,7 @@ SCIP_RETCODE SCIPlpiFreeState(
53625362
return SCIP_OKAY;
53635363
}
53645364

5365-
/** checks, whether the given LP state contains simplex basis information */
5365+
/** checks whether the given LP state contains simplex basis information */
53665366
SCIP_Bool SCIPlpiHasStateBasis(
53675367
SCIP_LPI* lpi, /**< LP interface structure */
53685368
SCIP_LPISTATE* lpistate /**< LP state information (like basis information), or NULL */

‎src/lpi/lpi_highs.cpp

+1-1
Original file line numberDiff line numberDiff line change
@@ -2602,7 +2602,7 @@ SCIP_RETCODE SCIPlpiFreeState(
26022602
return SCIP_OKAY;
26032603
}
26042604

2605-
/** checks, whether the given LP state contains simplex basis information */
2605+
/** checks whether the given LP state contains simplex basis information */
26062606
SCIP_Bool SCIPlpiHasStateBasis(
26072607
SCIP_LPI* lpi, /**< LP interface structure */
26082608
SCIP_LPISTATE* lpistate /**< LP state information (like basis information), or NULL */

‎src/lpi/lpi_msk.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -4922,7 +4922,7 @@ SCIP_RETCODE SCIPlpiFreeState(
49224922
return SCIP_OKAY;
49234923
}
49244924

4925-
/** checks, whether the given LP state contains simplex basis information */
4925+
/** checks whether the given LP state contains simplex basis information */
49264926
SCIP_Bool SCIPlpiHasStateBasis(
49274927
SCIP_LPI* lpi, /**< LP interface structure */
49284928
SCIP_LPISTATE* lpistate /**< LP state information (like basis information), or NULL */

‎src/lpi/lpi_none.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -1437,7 +1437,7 @@ SCIP_RETCODE SCIPlpiFreeState(
14371437
return SCIP_OKAY;
14381438
}
14391439

1440-
/** checks, whether the given LP state contains simplex basis information */
1440+
/** checks whether the given LP state contains simplex basis information */
14411441
SCIP_Bool SCIPlpiHasStateBasis(
14421442
SCIP_LPI* lpi, /**< LP interface structure */
14431443
SCIP_LPISTATE* lpistate /**< LP state information (like basis information), or NULL */

‎src/lpi/lpi_qso.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -3306,7 +3306,7 @@ SCIP_RETCODE SCIPlpiFreeState(
33063306
return SCIP_OKAY;
33073307
}
33083308

3309-
/** checks, whether the given LP state contains simplex basis information */
3309+
/** checks whether the given LP state contains simplex basis information */
33103310
SCIP_Bool SCIPlpiHasStateBasis(
33113311
SCIP_LPI* lpi, /**< LP interface structure */
33123312
SCIP_LPISTATE* lpistate /**< LP state information (like basis information), or NULL */

‎src/lpi/lpi_spx1.cpp

+2-2
Original file line numberDiff line numberDiff line change
@@ -4961,7 +4961,7 @@ SCIP_RETCODE SCIPlpiFreeState(
49614961
return SCIP_OKAY;
49624962
}
49634963

4964-
/** checks, whether the given LP state contains simplex basis information */
4964+
/** checks whether the given LP state contains simplex basis information */
49654965
SCIP_Bool SCIPlpiHasStateBasis(
49664966
SCIP_LPI* lpi, /**< LP interface structure */
49674967
SCIP_LPISTATE* lpistate /**< LP state information (like basis information), or NULL */
@@ -5444,7 +5444,7 @@ SCIP_Bool SCIPlpiIsInfinity(
54445444
/**@name File Interface Methods */
54455445
/**@{ */
54465446

5447-
/** returns, whether the given file exists */
5447+
/** returns whether the given file exists */
54485448
static
54495449
SCIP_Bool fileExists(
54505450
const char* filename /**< file name */

‎src/lpi/lpi_spx2.cpp

+2-2
Original file line numberDiff line numberDiff line change
@@ -4055,7 +4055,7 @@ SCIP_RETCODE SCIPlpiFreeState(
40554055
return SCIP_OKAY;
40564056
}
40574057

4058-
/** checks, whether the given LP state contains simplex basis information */
4058+
/** checks whether the given LP state contains simplex basis information */
40594059
SCIP_Bool SCIPlpiHasStateBasis(
40604060
SCIP_LPI* lpi, /**< LP interface structure */
40614061
SCIP_LPISTATE* lpistate /**< LP state information (like basis information), or NULL */
@@ -4603,7 +4603,7 @@ SCIP_Bool SCIPlpiIsInfinity(
46034603
/**@name File Interface Methods */
46044604
/**@{ */
46054605

4606-
/** returns, whether the given file exists */
4606+
/** returns whether the given file exists */
46074607
static
46084608
SCIP_Bool fileExists(
46094609
const char* filename /**< file name */

‎src/lpi/lpi_xprs.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -3370,7 +3370,7 @@ SCIP_RETCODE SCIPlpiFreeState(
33703370
return SCIP_OKAY;
33713371
}
33723372

3373-
/** checks, whether the given LP state contains simplex basis information */
3373+
/** checks whether the given LP state contains simplex basis information */
33743374
SCIP_Bool SCIPlpiHasStateBasis(
33753375
SCIP_LPI* lpi, /**< LP interface structure */
33763376
SCIP_LPISTATE* lpistate /**< LP state information (like basis information), or NULL */

‎src/scip/cons_cardinality.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -3799,7 +3799,7 @@ SCIP_RETCODE SCIPcreateConsCardinality(
37993799
/** creates and captures a cardinality constraint with all constraint flags set to their default values.
38003800
*
38013801
* @warning Do NOT set the constraint to be modifiable manually, because this might lead
3802-
* to wrong results as the variable array will not be resorted
3802+
* to wrong results as the variable array will not be re-sorted
38033803
*
38043804
* @note the constraint gets captured, hence at one point you have to release it using the method \ref SCIPreleaseCons()
38053805
*/

‎src/scip/cons_cardinality.h

+1-1
Original file line numberDiff line numberDiff line change
@@ -122,7 +122,7 @@ SCIP_RETCODE SCIPcreateConsCardinality(
122122
* @see SCIPcreateConsCardinality() for the default constraint flag configuration
123123
*
124124
* @warning Do NOT set the constraint to be modifiable manually, because this might lead
125-
* to wrong results as the variable array will not be resorted
125+
* to wrong results as the variable array will not be re-sorted
126126
*
127127
* @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()
128128
*/

‎src/scip/cons_countsols.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -28,7 +28,7 @@
2828
* @author Stefan Heinz
2929
* @author Michael Winkler
3030
*
31-
* If this constraint handler is activated than it counts or collects all feasible solutions. We refer to \ref COUNTER for
31+
* If this constraint handler is activated then it counts or collects all feasible solutions. We refer to \ref COUNTER for
3232
* more details about using SCIP for counting feasible solutions.
3333
*
3434
* @todo In the last round of presolving we should check if variables exist, which have up and down lock one. In this

‎src/scip/cons_countsols.h

+1-1
Original file line numberDiff line numberDiff line change
@@ -63,7 +63,7 @@ SCIP_RETCODE SCIPincludeConshdlrCountsols(
6363
*
6464
* @{
6565
*
66-
* If this constraint handler is activated than it counts or collects all feasible solutions. We refer to \ref COUNTER for
66+
* If this constraint handler is activated then it counts or collects all feasible solutions. We refer to \ref COUNTER for
6767
* more details about using SCIP for counting feasible solutions.
6868
*/
6969

‎src/scip/cons_cumulative.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -11097,7 +11097,7 @@ TCLIQUE_GETWEIGHTS(tcliqueGetweightsClique)
1109711097
return tcliquegraph->weights;
1109811098
}
1109911099

11100-
/** returns, whether the edge (node1, node2) is in the graph */
11100+
/** returns whether the edge (node1, node2) is in the graph */
1110111101
static
1110211102
TCLIQUE_ISEDGE(tcliqueIsedgeClique)
1110311103
{

‎src/scip/cons_knapsack.c

+7-7
Original file line numberDiff line numberDiff line change
@@ -4946,7 +4946,7 @@ SCIP_RETCODE separateSequLiftedMinimalCoverInequality(
49464946
SCIPfreeBufferArray(scip, &gubconsGC1);
49474947
}
49484948

4949-
/* checks, if lifting yielded a violated cut */
4949+
/* checks if lifting yielded a violated cut */
49504950
if( SCIPisEfficacious(scip, (cutact - liftrhs)/sqrt((SCIP_Real)MAX(liftrhs, 1))) )
49514951
{
49524952
SCIP_ROW* row;
@@ -5003,7 +5003,7 @@ SCIP_RETCODE separateSequLiftedMinimalCoverInequality(
50035003
}
50045004
SCIP_CALL( SCIPflushRowExtensions(scip, row) );
50055005

5006-
/* checks, if cut is violated enough */
5006+
/* checks if cut is violated enough */
50075007
if( SCIPisCutEfficacious(scip, sol, row) )
50085008
{
50095009
if( cons != NULL )
@@ -5114,7 +5114,7 @@ SCIP_RETCODE separateSequLiftedExtendedWeightInequality(
51145114
SCIP_CALL( sequentialUpAndDownLifting(scip, vars, nvars, ntightened, weights, capacity, solvals, varsT1, varsT2, varsF, varsR,
51155115
nvarsT1, nvarsT2, nvarsF, nvarsR, nvarsT1, liftcoefs, &cutact, &liftrhs) );
51165116

5117-
/* checks, if lifting yielded a violated cut */
5117+
/* checks if lifting yielded a violated cut */
51185118
if( SCIPisEfficacious(scip, (cutact - liftrhs)/sqrt((SCIP_Real)MAX(liftrhs, 1))) )
51195119
{
51205120
SCIP_ROW* row;
@@ -5170,7 +5170,7 @@ SCIP_RETCODE separateSequLiftedExtendedWeightInequality(
51705170
}
51715171
SCIP_CALL( SCIPflushRowExtensions(scip, row) );
51725172

5173-
/* checks, if cut is violated enough */
5173+
/* checks if cut is violated enough */
51745174
if( SCIPisCutEfficacious(scip, sol, row) )
51755175
{
51765176
if( cons != NULL )
@@ -5240,7 +5240,7 @@ SCIP_RETCODE separateSupLiftedMinimalCoverInequality(
52405240
nonmincovervars, nmincovervars, nnonmincovervars, mincoverweight, realliftcoefs, &cutact) );
52415241
liftrhs = nmincovervars - 1;
52425242

5243-
/* checks, if lifting yielded a violated cut */
5243+
/* checks if lifting yielded a violated cut */
52445244
if( SCIPisEfficacious(scip, (cutact - liftrhs)/sqrt((SCIP_Real)MAX(liftrhs, 1))) )
52455245
{
52465246
SCIP_ROW* row;
@@ -5284,7 +5284,7 @@ SCIP_RETCODE separateSupLiftedMinimalCoverInequality(
52845284
}
52855285
SCIP_CALL( SCIPflushRowExtensions(scip, row) );
52865286

5287-
/* checks, if cut is violated enough */
5287+
/* checks if cut is violated enough */
52885288
if( SCIPisCutEfficacious(scip, sol, row) )
52895289
{
52905290
if( cons != NULL )
@@ -13064,7 +13064,7 @@ SCIP_DECL_CONSRESPROP(consRespropKnapsack)
1306413064
else
1306513065
{
1306613066
/* locate the inference variable and calculate the capacity that has to be used up to conclude infervar == 0;
13067-
* inferinfo stores the position of the inference variable (but maybe the variables were resorted)
13067+
* inferinfo stores the position of the inference variable (but maybe the variables were re-sorted)
1306813068
*/
1306913069
if( inferinfo < consdata->nvars && consdata->vars[inferinfo] == infervar )
1307013070
capsum = consdata->weights[inferinfo];

‎src/scip/cons_sos1.c

+3-3
Original file line numberDiff line numberDiff line change
@@ -550,7 +550,7 @@ SCIP_Bool varIsSOS1(
550550
}
551551

552552

553-
/** returns SOS1 index of variable or -1 if variable is not part of the SOS1 conflict graph */
553+
/** returns node of variable in the conflict graph or -1 if variable is not part of the SOS1 conflict graph */
554554
static
555555
int varGetNodeSOS1(
556556
SCIP_CONSHDLRDATA* conshdlrdata, /**< SOS1 constraint handler */
@@ -10702,7 +10702,7 @@ SCIP_RETCODE SCIPcreateConsSOS1(
1070210702
/** creates and captures a SOS1 constraint with all constraint flags set to their default values.
1070310703
*
1070410704
* @warning Do NOT set the constraint to be modifiable manually, because this might lead
10705-
* to wrong results as the variable array will not be resorted
10705+
* to wrong results as the variable array will not be re-sorted
1070610706
*
1070710707
* @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()
1070810708
*/
@@ -10936,7 +10936,7 @@ SCIP_Bool SCIPvarIsSOS1(
1093610936
}
1093710937

1093810938

10939-
/** returns SOS1 index of variable or -1 if variable is not part of the SOS1 conflict graph */
10939+
/** returns node of variable in the conflict graph or -1 if variable is not part of the SOS1 conflict graph */
1094010940
int SCIPvarGetNodeSOS1(
1094110941
SCIP_CONSHDLR* conshdlr, /**< SOS1 constraint handler */
1094210942
SCIP_VAR* var /**< variable */

‎src/scip/cons_sos1.h

+1-1
Original file line numberDiff line numberDiff line change
@@ -116,7 +116,7 @@ SCIP_RETCODE SCIPcreateConsSOS1(
116116
* @see SCIPcreateConsSOS1() for the default constraint flag configuration
117117
*
118118
* @warning Do NOT set the constraint to be modifiable manually, because this might lead
119-
* to wrong results as the variable array will not be resorted
119+
* to wrong results as the variable array will not be re-sorted
120120
*
121121
* @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()
122122
*/

‎src/scip/cons_sos2.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -2664,7 +2664,7 @@ SCIP_RETCODE SCIPcreateConsSOS2(
26642664
/** creates and captures a SOS2 constraint with all constraint flags set to their default values.
26652665
*
26662666
* @warning Do NOT set the constraint to be modifiable manually, because this might lead
2667-
* to wrong results as the variable array will not be resorted
2667+
* to wrong results as the variable array will not be re-sorted
26682668
*
26692669
* @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()
26702670
*/

‎src/scip/cons_sos2.h

+1-1
Original file line numberDiff line numberDiff line change
@@ -109,7 +109,7 @@ SCIP_RETCODE SCIPcreateConsSOS2(
109109
/** creates and captures a SOS2 constraint with all constraint flags set to their default values.
110110
*
111111
* @warning Do NOT set the constraint to be modifiable manually, because this might lead
112-
* to wrong results as the variable array will not be resorted
112+
* to wrong results as the variable array will not be re-sorted
113113
*
114114
* @note the constraint gets captured, hence at one point you have to release it using the method SCIPreleaseCons()
115115
*/

‎src/scip/cuts.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -9587,7 +9587,7 @@ void buildFlowCover(
95879587

95889588
#ifndef NO_EXACT_KNAPSACK
95899589

9590-
/** checks, whether the given scalar scales the given value to an integral number with error in the given bounds */
9590+
/** checks whether the given scalar scales the given value to an integral number with error in the given bounds */
95919591
static
95929592
SCIP_Bool isIntegralScalar(
95939593
SCIP_Real val, /**< value that should be scaled to an integral value */

‎src/scip/cutsel_dynamic.c

+1-1
Original file line numberDiff line numberDiff line change
@@ -533,7 +533,7 @@ SCIP_RETCODE SCIPincludeCutselDynamic(
533533
*
534534
* This is the selection method of the dynamic cut selector which implements
535535
* the dynamic orthognality filtering based on the ratio of efficacies.
536-
* The input cuts array gets resorted s.t the selected cuts come first and the remaining
536+
* The input cuts array gets re-sorted s.t the selected cuts come first and the remaining
537537
* ones are the end.
538538
*/
539539
SCIP_RETCODE SCIPselectCutsDynamic(

‎src/scip/cutsel_dynamic.h

+2-2
Original file line numberDiff line numberDiff line change
@@ -37,7 +37,7 @@
3737
*
3838
* The selector allows the user to specify a filtering strategy during cut selection ('d'ynamic- and 'f'ull dynamic),
3939
* which determines how the orthogonality filtering is applied.
40-
* In both cases, after a cut is selected, the remaining cuts are resorted by computing their relative efficacy to the
40+
* In both cases, after a cut is selected, the remaining cuts are re-sorted by computing their relative efficacy to the
4141
* selected cut. The efficacy ratio is then used to filter the cuts based on the filtering strategy:
4242
* - 'd'ynamic-parallelism: The dynamic parallelism strategy filters cuts based on the efficacy ratio between cut
4343
* pairs. It only filters cuts that are not theoretically improving the efficacy of the pair given the first cut, i.e.,
@@ -80,7 +80,7 @@ SCIP_RETCODE SCIPincludeCutselDynamic(
8080
* This is an extension of the hybrid cutselector to employ a dynamic range
8181
* when applying orthogonality filtering, dependent on the efficacy ratio between cuts.
8282
*
83-
* The input cuts array should be resorted such that the selected cuts come first.
83+
* The input cuts array should be re-sorted such that the selected cuts come first.
8484
*/
8585
SCIP_EXPORT
8686
SCIP_RETCODE SCIPselectCutsDynamic(

0 commit comments

Comments
 (0)