SCIP
Solving Constraint Integer Programs
Detailed Description
Portable definitions.
Definition in file portab.h.
#include <limits.h>#include <math.h>#include <float.h>Go to the source code of this file.
Macros | |
| #define | EPSILON 1e-06 |
| #define | TRUE 1 |
| #define | FALSE 0 |
| #define | SUCCESS 0 |
| #define | FAILURE (-1) |
| #define | Max(a, b) (((a) >= (b)) ? (a) : (b)) |
| #define | Min(a, b) (((a) <= (b)) ? (a) : (b)) |
| #define | EPS_ZERO (DBL_EPSILON * 1e4) |
| #define | EPS_ZERO_HARD (DBL_EPSILON * 1e6) |
| #define | Fsgn(x) ((((x) > -EPS_ZERO) && ((x) < EPS_ZERO)) ? 0 : (((x) < 0.0) ? -1 : 1)) |
| #define | RELDIFF(a, b) (((a)-(b))/ MAX(MAX(fabs(a), fabs(b)), 1.0)) |
| #define | EQ_FEAS(a, b) (fabs(RELDIFF(a, b)) <= EPS_ZERO) |
| #define | LT_FEAS(a, b) (RELDIFF(a, b) < -EPS_ZERO) |
| #define | LE_FEAS(a, b) (RELDIFF(a, b) < EPS_ZERO) |
| #define | GT_FEAS(a, b) (RELDIFF(a, b) > EPS_ZERO) |
| #define | GE_FEAS(a, b) (RELDIFF(a, b) > -EPS_ZERO) |
| #define | EQ_FEAS_EPS(a, b, eps) (fabs(RELDIFF(a, b)) <= eps) |
| #define | LT_FEAS_EPS(a, b, eps) (RELDIFF(a, b) < -eps) |
| #define | LE_FEAS_EPS(a, b, eps) (RELDIFF(a, b) < eps) |
| #define | GT_FEAS_EPS(a, b, eps) (RELDIFF(a, b) > eps) |
| #define | GE_FEAS_EPS(a, b, eps) (RELDIFF(a, b) > -eps) |
| #define | EQ(a, b) (fabs((a) - (b)) <= EPS_ZERO) |
| #define | NE(a, b) (fabs((a) - (b)) > EPS_ZERO) |
| #define | LT(a, b) (((a) - (b)) < -EPS_ZERO) |
| #define | LT_HARD(a, b) (((a) - (b)) < -EPS_ZERO_HARD) |
| #define | LE(a, b) (((a) - (b)) < EPS_ZERO) |
| #define | GT(a, b) (((a) - (b)) > EPS_ZERO) |
| #define | GE(a, b) (((a) - (b)) > -EPS_ZERO) |
| #define | GE_HARD(a, b) (((a) - (b)) > -EPS_ZERO_HARD) |
| #define | DIRSEP "/" |
Typedefs | |
| typedef unsigned char | STP_Bool |
Macro Definition Documentation
◆ EPSILON
◆ TRUE
◆ FALSE
◆ SUCCESS
| #define SUCCESS 0 |
Definition at line 45 of file portab.h.
Referenced by get_arguments(), graph_load(), open_file(), SCIPgetNlpiOracleIpopt(), and start_section().
◆ FAILURE
| #define FAILURE (-1) |
Definition at line 48 of file portab.h.
Referenced by get_arguments(), graph_load(), open_file(), and start_section().
◆ Max
◆ Min
Definition at line 55 of file portab.h.
Referenced by graph_mincut_exec().
◆ EPS_ZERO
◆ EPS_ZERO_HARD
| #define EPS_ZERO_HARD (DBL_EPSILON * 1e6) |
Definition at line 59 of file portab.h.
Referenced by extTreeRedcostCutoff().
◆ Fsgn
◆ RELDIFF
◆ EQ_FEAS
◆ LT_FEAS
◆ LE_FEAS
Definition at line 70 of file portab.h.
Referenced by bdkStarGetCombinedSdCost().
◆ GT_FEAS
◆ GE_FEAS
Definition at line 72 of file portab.h.
Referenced by reduce_sollocalGetUpperBound().
◆ EQ_FEAS_EPS
◆ LT_FEAS_EPS
◆ LE_FEAS_EPS
Definition at line 75 of file portab.h.
Referenced by dapathsUpdate(), graph_tpathsSetAll2(), and graph_tpathsSetAll3().
◆ GT_FEAS_EPS
◆ GE_FEAS_EPS
Definition at line 77 of file portab.h.
Referenced by extTreeRedcostCutoff(), redcosts_setAndReturnCutoffFromBoundTop(), and redcosts_setCutoffFromBound().
◆ EQ
Definition at line 79 of file portab.h.
Referenced by addInitialPathNodes(), addPathHeadEdge(), bdkGetEdgeCutoffs(), bdkNodeIsInvalid(), blockEdgesWithGlobalFixings(), borderBuildCharDists(), bottleneckIsEqualityDominated(), bottleneckMarkEqualityEdges(), bottleneckMarkEqualityPath(), cgraph_node_append(), cgraph_node_applyMinAdjCosts(), cgraph_node_deleteTop(), cgraph_node_repositionTop(), cgraph_valid(), cmst_isSync(), computeReducedProbSolution(), computeSteinerTree_execBiased(), computeSteinerTree_execRpcMw(), csrdepoCSRsAreEqual(), daExec(), dapathsSortStarts(), dcmstTest1(), dcmstTest2(), dcmstTest2b(), dcmstTest3(), delPseudoDeleteVertex(), delPseudoEdgeDeleteEdge(), delPseudoEdgeGetReplaceEdges(), distCloseNodesIncluded(), dpborder_solve(), enumExec(), extGetSdPcUpdate(), extractSubgraphAddEdge(), extreduce_bottleneckIsDominated(), extreduce_bottleneckWithExtedgeIsDominated(), extreduce_distDataGetSd(), extreduce_distDataGetSdDouble(), extreduce_distDataGetSdDoubleEq(), extreduce_distDataGetSdDoubleForbidden(), extreduce_distDataGetSdDoubleForbiddenEq(), extreduce_distDataGetSdDoubleForbiddenLast(), extreduce_distDataGetSdDoubleForbiddenSingle(), extreduce_distDataGetSp(), extreduce_edgeIsValid(), extreduce_extdataIsClean(), extreduce_extPermaIsClean(), extreduce_mldistsEmptySlotTargetDists(), extreduce_mstbiased3LeafTreeRuleOut(), extreduce_mstbiasedCheck3NodeSimple(), extreduce_pcdataIsClean(), extreduce_reddataIsClean(), extreduce_sdshorizontalInSync(), extreduce_sdsTopInSync(), extreduce_sdsverticalInSync(), extreduce_spgCheck3ComponentSimple(), extreduce_spgCheck3NodeSimple(), extreduce_treeRecompCosts(), extSdGetProper(), extSdIsNonTrivial(), extTreeGetDirectedRedcostProper(), getBiasedMw(), getCloseNodeDistanceForbiddenEq(), getExtBottleneckDist(), getMinDistCombination(), graph_copyData(), graph_csr_costsAreInSync(), graph_csrdepo_addEmptyTop(), graph_csrdepo_emptyTopSetMarked(), graph_csrdepo_getTopCSR(), graph_dijkLimited_initPcShifts(), graph_edge_isBlocked(), graph_isAlmostUniform(), graph_pc_adaptSap(), graph_pc_costsEqualOrgCosts(), graph_pc_edgeIsExtended(), graph_pc_getOrgCosts(), graph_pc_getOrgCostsCsr(), graph_pc_knotChgPrize(), graph_pc_knotHasMaxPrize(), graph_pc_knotIsFixedTerm(), graph_pc_nonTermToFixedTerm(), graph_sdCloseNodesBiased(), graph_sdStar(), graph_sdStarBiased(), graph_subgraphCompleteNewHistory(), graph_transGstpClean(), graph_transNw2pc(), graph_transPc2Spg(), graph_transRmw(), graph_transRpc(), graph_transRpcGetSpg(), graph_voronoiWithDist(), graph_writeStp(), graphisValidPcMw(), impliedNodesAddTerm(), initFromParams(), isPseudoDeletable(), lpcutAdd(), lurkpruneInit(), mstCompLeafGetSDsToAncestors(), mstCompLeafGetSDsToSiblings(), mstCompLeafToAncestorsBiasedRuleOut(), mstCompRuleOut(), mstLevelHorizontalAddSds(), mwReduceTermDeg1(), nsvExec(), pathExendPrepare(), pcSdMarkSingle(), propagateUBs(), pseudodeleteDeleteComputeCutoffs(), redcosts_forLPget(), redlevelInitIncomplete(), redlevelIsClean(), reduce_bd34(), reduce_bd34WithSd(), reduce_boundHopDa(), reduce_dcmstGet0NodeMst(), reduce_dcmstGet1NodeMst(), reduce_dcmstGet2NodeMst(), reduce_exec(), reduce_sap(), reduce_sdBiased(), reduce_sdgraphGetSd(), reduce_sdRepair(), reduce_sdStarPc2(), reduce_sl(), reduce_solFinalizeLocal(), reduce_solGetUpperBoundWithOffset(), reduce_solLevelAdd(), reduce_solLevelTopTransferSolBack(), reduce_sollocalGetUpperBound(), reduce_sollocalHasUpperBound(), reduce_sollocalRebuildTry(), reduce_sollocalSetOffset(), reduce_sollocalUpdateNodesol(), reduce_termcompChangeSubgraphToOrgCosts(), reduceWithEdgeFixingBounds(), ruledOut(), ruleOutFromHead(), ruleOutFromTailCombs(), ruleOutFromTailSingle(), SCIP_DECL_HEUREXEC(), SCIP_DECL_SORTPTRCOMP(), sdCliqueStarComputeSds(), sdCliqueStarGetFinalProfitData(), sdCliqueStarInit(), sdCliqueUpdateGraphWithStarWalks(), sdDcExtendTree(), sdGetSd(), sdgraphGetSd(), sdgraphMstSortCosts(), sdmstGetWeight(), sdneighborMarkCloseNodes(), sdneighborUpdateExec(), sdqueryBuildBinaryTree(), sdqueryGetSd(), sdStarInit(), sepafullReduceFromSols(), setCostToOrgPc(), shortestpath_pcConnectNode(), solstp_getStpFromSCIPsol(), solveWithDpTerms(), spg3StarNeighborRuleOut(), spg4VerticesRuleOut(), stpsol_pruningIsPossible(), strongPruneSteinerTreePc(), subgraphBuild(), subtreesExtend(), subtreesRemoveNonValids(), tbottleneckGetMax(), tbottleneckInit(), testBiasedTerminalPathsTo4NextFound(), testBiconnectedDecomposition(), testBiconnectedDecomposition2(), testBiconnectedDecomposition3(), testBLCworksFor3Star(), testBLCworksFor3StarAfterReduction(), testBLCworksFor5Tree(), testDaPathsPcMw3EdgesWorks(), testDistCloseNodesPcAreValid1(), testDistCloseNodesPcAreValid2(), testDistCloseNodesPcAreValidAfterDeletion(), testPrunedSolIsImprovedPc1(), testPrunedSolIsImprovedPc2(), testRmwTerminalDeg1Contraction2(), testRmwTerminalDeg1Contraction3(), testSdCliqueStarDeg3AdjacencyIsCorrect(), testSdCliqueStarDeg3IsCorrect(), testSdCliqueStarDeg3IsCorrect2(), testSdCliqueStarDeg4IsCorrect(), testSdGetterReturnsCorrectSds(), testSdGraphDistsAreValid(), testSdGraphDistsAreValid2(), testSdGraphQueriesAreValid(), testSdGraphStrongBiasedDistsAreValid(), testSdRepair(), testTerminalPathsRepair(), testTerminalPathsRepair2(), testTerminalPathsRepair3(), testTerminalPathsTo3NextFound(), testTmGivesExpectedTreePcFull1(), testTmGivesExpectedTreePcFull2(), and testTmGivesExpectedTreePcFull3().
◆ NE
◆ LT
Definition at line 81 of file portab.h.
Referenced by addRedsol(), bdkStarGetCombinedSdCost(), bdkStarStoreMstsCosts(), blockEdgesWithGlobalFixings(), closeNodesRunCompute(), cmst_computeMst(), compRootDistUpdateMindists(), compUpDistAddLeaf(), compUpDistUpdateMindists(), computeOnMarked_exec(), computeReducedProbSolution(), computeSteinerTree(), computeSteinerTree_exec(), computeSteinerTree_execDirected(), computeSteinerTree_execPcMw(), computeSteinerTree_execPcMwFull(), computeSteinerTree_tryConnectNodePcMw(), computeSteinerTreeRedCosts(), csrdepoCsrIsSet(), daExec(), dapathsUpdate(), dhcstpWarmUp(), dpborder_partGetConnectionCost(), dpborder_partGetIdxNew(), dpborder_partGetIdxNewExclusive(), dpiterAddNewPrepare(), dpterms_isPromisingFully(), enumExec(), extreduce_bottleneckIsDominated(), extreduce_bottleneckIsDominatedBiased(), extreduce_bottleneckToSiblingIsDominated(), extreduce_bottleneckToSiblingIsDominatedBiased(), extreduce_bottleneckWithExtedgeIsDominated(), extreduce_bottleneckWithExtedgeIsDominatedBiased(), extreduce_distDataGetSdDoubleEq(), extreduce_distDataGetSdDoubleForbiddenLast(), extreduce_distDataGetSdDoubleForbiddenSingle(), extreduce_mstTopCompExtObjValid(), extreduce_mstTopCompInSync(), extreduce_mstTopCompObjValid(), extreduce_redcostAddEdge(), extreduce_redcostRemoveEdge(), extreduce_redcostTreeRecompute(), extSdIsNonTrivial(), extTreeGetDirectedRedcost(), extTreeGetDirectedRedcostProper(), extTreeRedcostCutoff(), getBiasedMw(), getMinDistCombination(), getSd(), getTreeRedcosts_dbg(), graph_knotIsNWLeaf(), graph_path_st_pcmw(), graph_pathInLimitedExec(), graph_pc_edgeIsExtended(), graph_pc_getNorgEdges(), graph_pc_knotHasMaxPrize(), graph_sdCloseNodesBiased(), graph_sdStar(), graph_sdStarBiased(), graph_sdWalks_csr(), graph_sdWalksTriangle(), graph_transNw2pc(), graph_transRpcGetSpg(), graph_transRpcToSpgIsStable(), impliedNodesAddTerm(), initCostsAndPrioLP(), lurkpruneFinalize(), mstCompRuleOut(), mstLevelLeafTryExtMst(), mstTopLevelBaseValidWeight(), nearest(), nearestX(), pathExendPrepare(), pathheapGetNearest(), pathneighborsUpdateDistances(), pcBiasCostsDCSR(), pcmwDeleteNonSolEdges(), pcmwUpdateBestSol(), pcsubtreePruneForProfit(), pcsubtreePruneForProfit_csr(), pseudodeleteDeleteComputeCutoffs(), redcosts_unifyBlockedEdgeCosts(), reduce_ans(), reduce_ansAdv2(), reduce_bound(), reduce_boundHopDa(), reduce_daPcMw(), reduce_nnp(), reduce_sd(), reduce_sdBiased(), reduce_sdneighborGetCloseTerms(), reduce_sdprofitUpdateFromBLC(), reduce_simple_sap(), reduce_sl(), reduce_solGetEdgesol(), reduce_sollocalUpdateNodesol(), reduceWithEdgeFixingBounds(), ruledOut(), ruleOutFromHead(), ruleOutFromTailCombs(), ruleOutFromTailSingle(), runTmPcMW_mode(), SCIP_DECL_SORTPTRCOMP(), SCIPStpHeurPruneUpdateSols(), SCIPStpHeurTMBuildTreeDc(), sdCliqueStarGetDistLimit(), sdCliqueStarUpdateNodeDist(), sdCliqueStarUpdateSd(), sdGetSd(), sdGetSdNeighbor(), sdgraphUpdateDistgraphFromTpaths(), sdneighborUpdateNode(), sdqueryGetSd(), sepafullReduceFromSols(), sepaspecial_vtimplicationsInit(), spg3StarNeighborRuleOut(), spg4VerticesRuleOut(), STP_Vectype(), strongPruneSteinerTreePc(), strongPruneSteinerTreePc_csr(), subtreesBuild(), subtreesExtend(), tpathsGetKCloseTerms(), tryPathPcMw(), updateBestSol(), updateFromPartition(), updateIncumbent(), and updateSolution().
◆ LT_HARD
| #define LT_HARD | ( | a, | |
| b | |||
| ) | (((a) - (b)) < -EPS_ZERO_HARD) |
Definition at line 82 of file portab.h.
Referenced by computeSteinerTree_execBiased().
◆ LE
Definition at line 83 of file portab.h.
Referenced by addPathHeadEdge(), ansProcessCandidate(), ansProcessCandidateWithBridge(), bottleneckIsEqualityDominated(), contractEdgeNoFixedEnd(), dcmstGetWeightFromStore(), debugPrintSeparator(), dhcstpWarmUp(), distgraphAddEdges(), distgraphAddEdgesFromTpaths(), extreduce_bottleneckIsDominated(), extreduce_bottleneckToSiblingIsDominated(), extreduce_bottleneckWithExtedgeIsDominated(), extSdGetProper(), extTreeGetDirectedRedcostProper(), extTreeRedcostCutoff(), getEdgeReductionRatio(), getMinDistCombination(), getOrderedRootIndices(), getSdProfit(), graph_sdStar(), graph_sdStarBiased(), graph_tpathsSetAll4(), graph_transGstpClean(), graph_transRmw(), graph_transRpcToSpgIsStable(), graph_voronoiTerms(), graph_voronoiWithDist(), impliedNodesAddTerm(), mst_getObj(), mstCompRuleOut(), mstEqComp3RuleOut(), mwContractTerminalsChainWise(), nsvExec(), pathExendPrepare(), pcsubtreePruneForProfit_csr(), pruneSteinerTreePc(), reduce_compbuilderGetSubNodesRatio(), reduce_nvAdv(), reduce_sdprofitGetProfit(), reduce_sdprofitUpdateFromBLC(), reduce_simple_mw(), reduce_sl(), reduce_sollocalHasUpperBound(), reduce_sollocalUpdateUpperBound(), ruleOutFromHead(), ruleOutFromTailCombs(), ruleOutFromTailSingle(), SCIPStpHeurTMRunLP(), sdCliqueStarGetNodeBias(), sdCliqueStarUpdateSd(), sdCliqueUpdateGraphWithStarWalks(), sdGet1ProfitDist(), sdGet2ProfitsDist(), sdgraphUpdateDistgraphFromTpaths(), sdprofitUpdateNode(), sepafullAddSingleSolcandEdges(), spg3StarNeighborRuleOut(), subsolUpdate(), subtreesRemoveNonValids(), tpathsGetDistNew(), tpathsGetKCloseTerms(), tpathsScan1st(), and writeRedcostdata().
◆ GT
Definition at line 84 of file portab.h.
Referenced by allExtensionsAreInvalid(), bidecomposition_getMaxcompNodeRatio(), computeSteinerTree_execBiased(), dapathsFixPotTerms(), dapathsSetRunParams(), debugPrintSeparator(), decomposeIsPromising(), decomposePartialIsPromising(), dhcstpWarmUp(), distCloseNodesCompute(), dpterms_isPromisingPartly(), extreduce_mstTopCompExtObjValid(), extreduce_mstTopCompInSync(), extreduce_mstTopCompObjValid(), generalStarSetUp(), getCloseNodeDistanceForbiddenEq(), getOrgNodeToNodeMap(), getSd(), graph_dijkLimited_initPcShifts(), graph_path_st_pcmw_full(), graph_pathHeapAdd(), graph_pc_markOrgGraph(), graph_sdPaths(), graph_sdStar(), graph_sdStarBiased(), graph_tpathsAdd2nd(), graph_tpathsAdd3rd(), graph_tpathsAdd4th(), graph_tpathsGetProfitNodes(), graph_transNw2pc(), graph_transRpcGetSpg(), graph_transRpcToSpgIsStable(), graph_voronoi(), graph_voronoiExtend(), graph_voronoiTerms(), graph_writeStp(), mstTopLevelBaseValidWeight(), nearest(), nearestX(), nsvEdgeGetTermDists(), pathheapGetNearest(), pathheapReset(), propagateUBs(), pseudodeleteBiasedIsPromising(), pseudodeleteNodeIsPromising(), reduce_ansAdv2(), reduce_bound(), reduce_compbuilderGetSubNodesRatio(), reduce_dcmstGetExtWeight(), reduce_dcmstGetWeight(), reduce_rpt(), reduce_sd(), reduce_sdprofitPrintStats(), reduce_solLevelTopTransferSolBack(), reduce_sollocalRebuildTry(), ruleOutFromHead(), ruleOutFromTailCombs(), ruleOutFromTailSingle(), SCIPprobdataGetPresolUpperBound(), SCIPprobdataProbIsAdversarial(), sdCliqueStarComputeSds(), sdCliqueStarGetDistLimit(), sdCliqueStarGetNodeBias(), sdCliqueStarUpdateSd(), sdCliqueUpdateGraphWithStarWalks(), sdDcExtendTree(), sdGetSd(), sdGetSdNeighbor(), sdneighborMarkCloseNodes(), sdneighborUpdateNode(), sdprofitBuild(), sdprofitBuild1stOnly(), sdprofitUpdateNode(), sepafullSolcandsArePromising(), sepaspecial_pacliquesSeparate(), spg3StarNeighborRuleOut(), subscipSetupParameters(), subtreesBuild(), subtreesRemoveNonValids(), tbottleneckGetMax(), termcompIsPromising(), tpathsScan1st(), tpathsScan2nd(), tpathsScan3rd(), tpathsScan4th(), updateFromPartition(), vnoiCompute(), and vnoiComputeImplied().
◆ GE
Definition at line 85 of file portab.h.
Referenced by addComponentUpdateTreeCosts(), bdkStarGetCombinedSdCost(), bdkStarIsReplacableDeg3(), bdkStarIsSdTreeReplacable(), bdkStarStoreMstsCosts(), bidecomposition_getCompNodeRatio(), blctreeUpdateRootPath(), bottleneckIsEqualityDominated(), bottleneckMarkEqualityEdges(), cgraph_node_applyMinAdjCosts(), closeNodesRunCompute(), compRootDistAddLeaf(), compRootDistUpdateMindists(), compUpDistAddLeaf(), compUpDistUpdateMindists(), computeSteinerTree_execRpcMw(), computeSteinerTree_tryConnectNodePcMw(), dapathsUpdate(), dcmstGetWeightFromStore(), decomposeReduceSubDoIt(), dhcstpWarmUp(), distCloseNodesGetMaxCost(), distgraphInsertEdge(), dpborder_partGetConnectionCost(), dpiterAddNewPrepare(), dualascent_update(), extGetSdPcUpdate(), extInnerNodeRemoveTop(), extreduce_bottleneckToSiblingIsDominated(), extreduce_bottleneckToSiblingIsDominatedBiased(), extreduce_distDataGetSd(), extreduce_distDataGetSdDouble(), extreduce_distDataGetSdDoubleEq(), extreduce_distDataGetSdDoubleForbidden(), extreduce_distDataGetSdDoubleForbiddenEq(), extreduce_distDataGetSdDoubleForbiddenLast(), extreduce_distDataGetSdDoubleForbiddenSingle(), extreduce_mldistsTargetDist(), extreduce_mldistsTopTargetDist(), extreduce_mstbiased3LeafTreeRuleOut(), extreduce_redcostInitExpansion(), extreduce_spg3LeafTreeRuleOut(), extreduce_spgCheck3ComponentSimple(), extSdGetProper(), extTreeGetDirectedRedcostProper(), findSolPcMw2Term(), findSolRPcMw(), fixVarsRedbasedIsPromising(), generalStarSetUp(), getBiasedMw(), getBiasedPc(), getEdgeReductionRatio(), getSd(), getSdProfit(), graph_getEdgeCosts(), graph_getEdgeRevCosts(), graph_heap_correct(), graph_path_st_rpcmw(), graph_pc_knotChgPrize(), graph_sdPaths(), graph_transNw2pc(), graph_transRpcToSpgIsStable(), graph_voronoiTerms(), graph_voronoiWithDist(), initCostsAndPrioLP(), initFromParams(), lurkpruneInit(), mst_getObj(), mstCompRuleOut(), mstLevelLeafTryExtMst(), nsvEdgeGetTermDists(), nsvExec(), pathExendPrepare(), pcSdMarkSingle(), pseudodeleteDeleteNode(), redcosts_increaseOnDeletedArcs(), redcosts_setAndReturnCutoffFromBoundTop(), redcosts_setCutoff(), redcosts_setCutoffFromBound(), redcosts_setDualBound(), redcosts_setDualBoundTop(), redcosts_unifyBlockedEdgeCosts(), reduce_applyPseudoDeletions(), reduce_blctreeGetMstEdgesToCutDist(), reduce_cnsAdv(), reduce_da(), reduce_daPcMw(), reduce_dcmstGetExtWeight(), reduce_dcmstGetWeight(), reduce_impliedProfitBasedRpc(), reduce_nvAdv(), reduce_sd(), reduce_sdgraphGetMaxCost(), reduce_sdneighborGetCloseTerms(), reduce_sdprofitGetBiasedDist(), reduce_sdprofitGetProfit(), reduce_simple_mw(), reduce_sl(), reduce_solLevelTopTransferSolBack(), reduce_sollocalRebuildTry(), reduce_sollocalSetOffset(), reduce_sollocalUpdateUpperBound(), reduce_solSetOffset(), reduceRootedProb(), SCIPlinkcuttreeFindMax(), SCIPStpValidateSol(), sdCliqueStarComputeSds(), sdCliqueStarGetDistLimit(), sdCliqueStarGetNodeBias(), sdCliqueStarUpdateNodeDist(), sdCliqueStarUpdateNodeMaxDist(), sdCliqueStarUpdateSd(), sdGet1ProfitDist(), sdGet2ProfitsDist(), sdGetSd(), sdgraphGetSd(), sdgraphMstSortCosts(), sdmstGetWeight(), sdprofitBuild(), sdprofitBuild1stOnly(), sdprofitUpdateNode(), sepaspecial_vtimplicationsInit(), solstp_isUnreduced(), spg3StarNeighborRuleOut(), spg4VerticesRuleOut(), stpsol_pruningIsPossible(), subgraphBuild(), subtreesBuild(), subtreesRemoveNonValids(), tbottleneckGetMax(), tbottleneckInit(), termcompReduceWithParams(), tpathsGetDistNew(), tpathsGetKCloseTerms(), tpathsScan1st(), trail(), and writeRedcostdata().
◆ GE_HARD
◆ DIRSEP
| #define DIRSEP "/" |
Definition at line 91 of file portab.h.
Referenced by graph_load().