Detailed Description

Steiner graph data structure

Definition at line 184 of file graphdefs.h.

#include <graphdefs.h>

Data Fields
int	norgmodelknots

int	norgmodelterms

int	ksize

int	knots

int	orgknots

int	terms

int	layers

int	orgsource

int	source

int *RESTRICT	term

int *RESTRICT	mark

int *RESTRICT	grad

int *RESTRICT	inpbeg

int *RESTRICT	outbeg

int *RESTRICT	maxdeg

int *	term2edge

SCIP_Real *	prize

SCIP_Real *	costbudget

SCIP_Real	budget

int	norgmodeledges

int	hoplimit

int	esize

int	edges

int	orgedges

SCIP_Real *	cost

SCIP_Real *	cost_org_pc

int *RESTRICT	tail

int *RESTRICT	head

int *RESTRICT	orgtail

int *RESTRICT	orghead

int *RESTRICT	rootedgeprevs

int *RESTRICT	ieat

int *RESTRICT	oeat

IDX **	ancestors

IDX **	pcancestors

PSEUDOANS *	pseudoancestors

FIXED *	fixedcomponents

int *	contracttrace

int	mincut_nnodes

int	mincut_nedges

int *RESTRICT	mincut_dist

int *RESTRICT	mincut_head

int *RESTRICT	mincut_head_inact

int *RESTRICT	mincut_numb

int *RESTRICT	mincut_prev

int *RESTRICT	mincut_next

int *RESTRICT	mincut_temp

int *RESTRICT	mincut_e

int *RESTRICT	mincut_x

int *RESTRICT	mincut_r

int *RESTRICT	path_heap

int *RESTRICT	path_state

int	grid_dim

int *	grid_ncoords

int **	grid_coordinates

int	stp_type

SCIP_Bool	is_packed

SCIP_Bool	withInexactReductions

SCIP_Bool	extended

CSR *	csr_storage

DCSR *	dcsr_storage

Field Documentation

◆ norgmodelknots

int GRAPH::norgmodelknots

Number of nodes in the original model

Definition at line 187 of file graphdefs.h.

Referenced by buildsolgraph(), computeHistoryPcMw(), getBiasedMw(), graph_copyData(), graph_freeHistoryDeep(), graph_init(), graph_pack(), graph_pc_getReductionRatios(), graph_transGstpClean(), graph_transPc(), graph_transRmw(), graph_transRpc(), redcostGraphBuild(), SCIPprobdataWriteSolution(), SCIPStpHeurPruneRun(), SCIPStpHeurRecExclude(), SCIPStpHeurSlackPruneRun(), and updatePropgraph().

◆ norgmodelterms

int GRAPH::norgmodelterms

Number of terminals in the original model

Definition at line 188 of file graphdefs.h.

Referenced by computeHistory(), graph_copyData(), graph_init(), graph_pack(), and graph_transGstpClean().

◆ ksize

int GRAPH::ksize

Count of allocated knot slots

Definition at line 189 of file graphdefs.h.

Referenced by extractSubgraphAddNodes(), extractSubgraphBuild(), getBiasedMw(), graph_copy(), graph_copyData(), graph_init(), graph_knot_add(), graph_pc_initSubgraph(), graph_resize(), graph_transPc(), graph_transPc2Spg(), graph_transPcGetRsap(), graph_transPcGetSap(), graph_transRmw(), graph_transRpc(), graph_transRpc2FixedProper(), and packPcMwInit().

◆ knots

int GRAPH::knots

Count of nodes in graph

Definition at line 190 of file graphdefs.h.

Referenced by ansUnmark(), applyBranchHistoryToGraph(), bdkGetCliqueSds(), bea_save(), blctreeBuildNodeMap(), bottleneckRuleOut(), boundPruneHeur(), boundPruneHeurMw(), buildsolgraph(), checkSdWalk(), closeNodesRunInit(), collectFixedTerminals(), computeDegConsTree(), computeHistory(), computeNewSols(), computePertubedSol(), computeReducedProbSolution(), computeReducedProbSolutionBiased(), computeStarts(), computeSteinerTree(), computeSteinerTreeKeyNodesCsr(), computeSteinerTreeVnoi(), computeTransVoronoi(), connectivityDataInit(), createPrizeConstraints(), createVariables(), cutNodesComputePostProcess(), daExec(), daInit(), daOrderRoots(), dapathsReplaceNodes(), dapathsRunShortestPaths(), daPcFindRoots(), daRedCostIsValid(), decomposeGetSubgraph(), decomposeIsPromising(), decomposePartialIsPromising(), distCloseNodesCompute(), distDataAllocateNodesArrays(), distDataPathRootsInitialize(), distGetRestricted(), distgraphAddNodes(), dpborder_init(), dpborder_solve(), dpborderIsNonPromising(), dpsolverGetSolution(), dpsolverInitData(), dpterms_isPromisingPartly(), dualascent_exec(), dualascent_execPcMw(), dualascent_update(), enumExec(), extInitRedCostArrays(), extInitRedCostArraysPc(), extPreprocessInitialComponent(), extractSubgraphAddNodes(), extreduce_checkComponent(), extreduce_deleteEdges(), extreduce_deleteGeneralStars(), extreduce_distDataInit(), extreduce_redcostAddEdge(), extreduce_redcostInitExpansion(), extreduce_spg3LeafTreeRuleOut(), extTreeGetDirectedRedcost(), extTreeGetDirectedRedcostProper(), findRootsMark(), fixVarsDualcost(), fixVarsDualcostLurking(), generalStarExit(), generalStarInit(), getBiasedMw(), getBoundchangesPcMW(), getEdgeReductionRatio(), getExtBottleneckDist(), getHighSolDegVertex(), getLowestCommonAncestors(), getReductionRatios(), graph_copyData(), graph_dijkLimited_clean(), graph_dijkLimited_init(), graph_dijkLimited_reset(), graph_edge_del(), graph_get4nextTTerms(), graph_get_avgDeg(), graph_get_nNodes(), graph_get_nVET(), graph_getCsr(), graph_getIsTermArray(), graph_init(), graph_init_csr(), graph_init_csrWithEdgeId(), graph_init_dcsr(), graph_initHistory(), graph_initPseudoAncestorsSized(), graph_isMarked(), graph_knot_add(), graph_load(), graph_mincut_exec(), graph_mincut_init(), graph_mincut_setDefaultVals(), graph_pack(), graph_path_execX(), graph_path_init(), graph_path_invroot(), graph_path_st(), graph_path_st_brmwcs(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_extendBiased(), graph_path_st_pcmw_extendOut(), graph_path_st_pcmw_full(), graph_path_st_rpcmw(), graph_pathInLimitedExec(), graph_pc_2trans(), graph_pc_getPosPrizeSum(), graph_pc_getReductionRatios(), graph_pc_initSubgraph(), graph_pc_markOrgGraph(), graph_pc_nFixedTerms(), graph_pc_shiftNonLeafCosts(), graph_pc_term2edgeIsConsistent(), graph_pc_termMarkProper(), graph_printEdgeConflicts(), graph_printInfo(), graph_pseudoAncestors_edgesInConflict(), graph_resize(), graph_sdComputeCliqueStar(), graph_sdStar(), graph_sdWalks_csr(), graph_sdWalksConnected(), graph_sdWalksTriangle(), graph_show(), graph_subgraphExtract(), graph_termsReachable(), graph_tpathsGetProfitNodes(), graph_transGstpClean(), graph_transPc(), graph_transPc2Spg(), graph_transPcGetRsap(), graph_transPcGetSap(), graph_transRmw(), graph_transRpc(), graph_transRpc2FixedProper(), graph_transRpcGetSpg(), graph_valid(), graph_valid_csr(), graph_valid_dcsr(), graph_validInput(), graph_vnoiCompute(), graph_vnoiComputeImplied(), graph_voronoi(), graph_voronoiExtend(), graph_voronoiMw(), graph_voronoiRepairMult(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), graph_writeGml(), graph_writeGmlSub(), graph_writeStp(), graph_writeStpOrg(), graphisValidPcMw(), initCostsAndPrioLP(), initReceivedSubproblem(), insertionFinalizeReplacement(), insertionInit(), insertionRestoreTree(), localExtendPc(), localInsertion(), localInsertion2(), localInsertion2pc(), localKeyPathExchange(), localKeyPathExchangeMw(), localKeyPathExchangePc(), localKeyPathExchangePc2(), localKeyVertex(), localKeyVertexHeuristics(), localKeyVertexPc(), localKeyVertexPc2(), localRun(), localVertexInsertion(), lpcutAdd(), markNonLeafTerms_2trans(), markNonLeafTerms_pretransPc(), markPseudoDeletablesFromBounds(), markSolTreeNodes(), mincutGetNextSinkTerm(), mst_computeOnMarked(), packNodes(), packPcMwVanished(), pcBiasCostsDCSR(), pcmwDataIsClean(), pcmwGetStartNodes(), pcmwUpdate(), pcSdToNodeUnmark(), pricing(), propagateUBs(), propgraphApplyBoundchanges(), propgraphApplyImplicationsPcMw(), pruneSteinerTreePc(), pseudoAncestorsCreation(), pseudoAncestorsHash(), pseudoAncestorsHashPc(), pseudoAncestorsMerge(), pseudoAncestorsMergePc(), redcostGraphBuild(), redcostGraphComputeSteinerTree(), redcostGraphSolRetransform(), reduce_bd34(), reduce_bd34WithSd(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_da(), reduce_dapaths(), reduce_daPcMw(), reduce_deleteMultiedges(), reduce_extendedCheck3Tree(), reduce_extendedEdge(), reduce_getSdByPaths(), reduce_hc(), reduce_nv(), reduce_nvAdv(), reduce_nw(), reduce_pc(), reduce_redLoopPc(), reduce_sd(), reduce_sdGetSdsCliquegraph(), reduce_sdPc(), reduce_sdspSap(), reduce_sdStar(), reduce_sdStarPc(), reduce_sdStarPc2(), reduce_sdWalk(), reduce_sdWalk_csr(), reduce_sdWalkExt(), reduce_sdWalkExt2(), reduce_sdWalkTriangle(), reduce_simple(), reduce_simple_hc(), reduce_sl(), reduce_solAddNodesol(), reduce_solGetEdgesol(), reduce_solGetNodesol(), reduce_solInit(), reduce_sollocalRebuildTry(), reduce_solReInitLocal(), reduce_termcompChangeSubgraphToBottleneck(), reduce_termcompInit(), reduce_termsepaDaWithExperma(), reduce_unconnected(), reduce_unconnectedRpcRmwInfeas(), reduceCheckEdge(), reduceRootedProb(), reduceWithEdgeFixingBounds(), reduceWithNodeFixingBounds(), reinsertSubgraph(), retransformReducedProbSolution(), rpcTryFullReduce(), runTm(), runTmPcMW_mode(), SCIP_DECL_CONSPROP(), SCIP_DECL_CONSSEPALP(), SCIP_DECL_PROBCOPY(), SCIPprobdataAddNewSol(), SCIPprobdataCreateFromGraph(), SCIPStpBranchruleInitNodeState(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalExtendPcMwImp(), SCIPStpHeurLocalExtendPcMwOut(), SCIPStpHeurPruneRun(), SCIPStpHeurPruneUpdateSols(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), SCIPStpHeurSlackPruneRun(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMCompStarts(), sdCliqueStarComputeSds(), sdCliqueStarInit(), sdGetSdPcMw(), sdneighborUpdateNode(), sdqueryFullBuild(), sdqueryFullInit(), selectBranchingVertexByDegree(), selectBranchingVertexByLp(), selectBranchingVertexByLp2Flow(), sepaspecial_pcimplicationsSeparate(), setParams(), shortestpath_computeSteinerTree(), shortestpath_computeSteinerTreeBiased(), shortestpath_computeSteinerTreeDirected(), shortestpath_computeSteinerTreePcMw(), shortestpath_computeSteinerTreePcMwFull(), shortestpath_computeSteinerTreeRpcMw(), solDegIsValid(), solgraphAdaptForDCSTP(), solgraphAdaptForPcMw(), solNodeIsValid(), solPrune(), solstp_getOrg(), solstp_setVertexFromEdge(), solstp_setVertexFromEdgeConn(), stp_save(), stptest_graphSetUpPcExtended(), stptest_graphSetUpRmwExtended(), stptest_graphSetUpRpcExtended(), subgraphBuild(), subgraphIdentify(), subtreesExtend(), subtreesRemoveNonValids(), supergraphComputeMst(), supergraphDataRestore(), termcompReduceWithParams(), testEdgeDeletedBy3LeafSpg(), testEdgeDeletedByCommonRedCostsTargets(), testEdgeDeletedByEqBottleneck(), testEdgeDeletedByEqBottleneck2(), testEdgeDeletedByMst1(), testEdgeDeletedByMst2(), testEdgeDeletedByMultiRedCosts(), testEdgeDeletion1_deprecated(), testEdgeDeletion2_deprecated(), testEdgeDeletion3_deprecated(), testEdgeDeletion4_deprecated(), testEdgeDeletion5_deprecated(), testGeneralStarDeletedEdge1(), testGeneralStarDeletedEdge2(), testNode3PseudoDeletedByContraction(), testNode3PseudoDeletedByRedCosts1(), testNode3PseudoDeletedBySd1(), testNode3PseudoDeletedBySd2(), testNode3PseudoDeletedBySd3(), testNode3PseudoDeletedBySdBiased(), testNode3PseudoDeletedBySdBiasedSimple(), testNode4PseudoDeletedBySd1(), testNode4PseudoNotDeletedBySd1(), testPcEdgeDeletedByMst1(), testPcEdgeNotDeleted(), testPcNode3PseudoDeletedBySd1(), testPcNode4PseudoDeletedBySd1(), tpathsGetDistNew(), tpathsGetKCloseTerms(), tpathsRepairExitLevel(), tpathsRepairInit(), trail(), updateDeg2LurkingBounds(), updateEdgeFixingBounds(), updateEdgeLurkingBounds(), updateEdgestateFromRedPcmw(), updateNodeFixingBounds(), updateNodeReplaceBounds(), updatePropgraph(), and updateSolution().

◆ orgknots

int GRAPH::orgknots

Count of nodes prior to graph reduction

Definition at line 191 of file graphdefs.h.

Referenced by cleanHistory(), graph_copyData(), graph_init(), graph_pack(), retransformReducedProbSolution(), SCIPprobdataWriteSolution(), and solhistory_init().

◆ terms

int GRAPH::terms

Count of terminals

Definition at line 192 of file graphdefs.h.

Referenced by abortSlackPruneEarly(), addRedsol(), allExtensionsAreInvalid(), bdkStarIsReplacableDegGe4(), bdkTryDeg3(), bea_save(), borderNodesContract(), boundPruneHeur(), boundPruneHeurMw(), buildsolgraph(), check_inputgraph(), collectFixedTerminals(), collectRoots(), computeDegConsTree(), computeHistory(), computeNewSols(), computeReducedProbSolution(), computeStarts(), computeSteinerTree(), computeSteinerTree_exec(), computeSteinerTree_execBiased(), computeSteinerTree_execDirected(), computeSteinerTree_execPcMwFull(), computeSteinerTreeKeyNodesCsr(), computeSteinerTreeVnoi(), createInitialCuts(), createModel(), createPrizeConstraints(), createVariables(), cutNodesGetLastCutnode(), cutNodesTreeBuildSteinerTree(), daExec(), daGetNruns(), dapathsFixPotTerms(), dapathsSetRunParams(), daPcFindRoots(), distgraphAddNodes(), distgraphGetNedges(), divideAndConquer(), dpborder_coreSolve(), dpborder_coreUpdateOrdering(), dpborder_init(), dpborderIsNonPromising(), dpsolverInitData(), dpterms_coreSolve(), dpterms_isPromisingEmbarrassingly(), dpterms_isPromisingFully(), dpterms_isPromisingPartly(), dualascent_allTermsReachable(), dualascent_execPcMw(), enumeration_isPossible(), findRootsMark(), findSolPcMw(), findSolPcMw1Term(), findSolPcMw2Term(), findSolRPcMw(), getBiasedMw(), graph_copyData(), graph_get_nTerms(), graph_getTerms(), graph_getTermsRandom(), graph_init(), graph_knot_add(), graph_knot_chg(), graph_load(), graph_pack(), graph_path_st(), graph_path_st_brmwcs(), graph_path_st_dc(), graph_path_st_pcmw_full(), graph_path_st_rpcmw(), graph_pc_getReductionRatios(), graph_pc_nNonFixedTerms(), graph_printInfo(), graph_transGstpClean(), graph_transMw(), graph_transNw2pc(), graph_transPc(), graph_transPc2Spg(), graph_transPcGetSap(), graph_transPcmw2rooted(), graph_transRmw(), graph_transRpc(), graph_valid(), graph_validInput(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), graph_writeStp(), graph_writeStpOrg(), graphisValidPcMw(), initDecompose(), initHelpers(), initSolve(), localRun(), mincut_findTerminalSeparators(), mincut_findTerminalSeparatorsIsPromising(), mincut_separateLp(), mincutInitForLp(), mincutInitForTermSepa(), mincutPrepareForLp(), nodesolSetTrivial(), nwptstpSetRoot(), pcmwGetStartNodes(), pruneSteinerTreeStp(), pseudodeleteBiasedIsPromising(), redcostGraphMark(), reduce_bdk(), reduce_bdkBiased(), reduce_bdkWithSd(), reduce_bidecomposition(), reduce_bidecompositionExact(), reduce_bound(), reduce_boundMw(), reduce_da(), reduce_dapaths(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_impliedProfitBased(), reduce_impliedProfitBasedRpc(), reduce_nv(), reduce_pc(), reduce_redLoopMw(), reduce_redLoopPc(), reduce_rpt(), reduce_sd(), reduce_sdBiasedNeighbor(), reduce_sdPc(), reduce_simple(), reduce_simple_dc(), reduce_simple_sap(), reduce_sl(), reduce_solFinalizeLocal(), reduce_sollocalRebuildTry(), reduce_termsepaDa(), reduce_termsepaDaWithExperma(), reduce_termsepaFull(), reinsertSubgraphAdaptSubToOrgMap(), reroot(), retransformReducedProbSolution(), runDualAscent(), runTmPcFull(), runTmPcMW_mode(), SCIP_DECL_CONSPROP(), SCIP_DECL_CONSSEPALP(), SCIP_DECL_HEUREXEC(), SCIPprobdataCreateFromGraph(), SCIPStpHeurLurkPruneRun(), SCIPStpHeurPruneRun(), SCIPStpHeurRecRun(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMCompStarts(), sdDcExtendTree(), sdgraphAlloc(), sdgraphAllocRestricted(), sdgraphBuildDistgraph(), sdgraphBuildDistgraphFromTpaths(), sdneighborUpdate(), sdprofitBuild(), sdprofitBuild1stOnly(), sdqueryFullInit(), sdqueryInit(), sdqueryRmqInit(), selectBranchingVertexBySol(), sep_flowBalance(), sepaBadGetZeroHalfMaxrounds(), setParams(), setParamsSepaIsBad(), shortestpath_pcInit(), solstp_getOrg(), solstp_isValid(), solstp_pcGetSolRoot(), stp_save(), subtreesAddNew(), subtreesAddNewFinalize(), subtreesExtend(), subtreesRemoveNonValids(), termsepaFindTerminalSource(), termsepaGetCapaInf(), testBiconnectedDecomposition(), testBiconnectedDecomposition2(), testBiconnectedDecomposition3(), tmVnoiInit(), and trailGraphWithStates().

◆ layers

int GRAPH::layers

Count of different networks

Definition at line 193 of file graphdefs.h.

Referenced by createModel(), graph_copy(), graph_findCentralTerminal(), graph_init(), graph_pack(), graph_resize(), and nail().

◆ orgsource

int GRAPH::orgsource

root of unreduced graph

Definition at line 194 of file graphdefs.h.

Referenced by computeHistory(), computeHistoryPcMw(), graph_copyData(), graph_init(), graph_pack(), graph_transPc(), graph_transRmw(), graph_transRpc(), and presolveStp().

◆ source

int GRAPH::source

The root

Definition at line 195 of file graphdefs.h.

Referenced by allTermsAreVisited(), applyBranchHistoryToGraph(), blctreeBuildMst(), blctreeComputeBottlenecks(), blctreeComputeEdgesState(), boundPruneHeur(), boundPruneHeurMw(), buildsolgraph(), buildTmAllSp(), computeDualSolutionGuided(), computeHistory(), computeHistoryPcMw(), computeNewSols(), computePertubedSol(), computeReducedProbSolutionBiased(), computeStarts(), computeSteinerTree(), computeSteinerTree_execDirected(), computeSteinerTreeRedCostsDirected(), computeSteinerTreeSingleNode(), computeSteinerTreeTM(), computeSteinerTreeVnoi(), computeTransVoronoi(), contractEdgeWithFixedEnd(), createConstraints(), createInitialCuts(), createModel(), createPrizeConstraints(), createVariables(), cutNodesSetDfsRoot(), daExec(), daOrderRoots(), dapathsFixPotTerms(), dapathsRunShortestPaths(), dapathsSetRunParams(), dapathsSortStarts(), daPcAddTmSolToPool(), daPcFindRoots(), daPcMarkRoots(), daRedCostIsValid(), decomposeExactSubTry(), decomposeGetFirstMarked(), decomposeGetSubgraph(), dhcstpWarmUp(), distgraphAddNodes(), dpborder_coreComputeOrderingSimple(), dualascent_execDegCons(), dualascent_execPcMw(), enumExec(), extInitRedCostArrays(), extractSubgraphAddNodes(), findRootsMark(), findSolPcMw1Term(), findSolPcMw2Term(), findSolRPcMw(), fixVarsDualcost(), fixVarsExtendedRed(), getBiasedMw(), getBiasedPc(), getKeyPathReplaceCost(), getKeyPathUpper(), getLowestCommonAncestors(), getRedCost2ndNextDistances(), gmlWriteNode(), graph_copyData(), graph_dijkLimited_initPcShifts(), graph_findCentralTerminal(), graph_init(), graph_isMarked(), graph_knot_contract(), graph_knot_printInfo(), graph_load(), graph_mark(), graph_obstgrid_create(), graph_pack(), graph_path_invroot(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_extendBiased(), graph_pc_2org(), graph_pc_2trans(), graph_pc_adaptSap(), graph_pc_contractEdge(), graph_pc_contractEdgeUnordered(), graph_pc_deleteTerm(), graph_pc_evalTermIsNonLeaf(), graph_pc_finalizeSubgraph(), graph_pc_fixedTermToNonTerm(), graph_pc_getBiased(), graph_pc_getPosPrizeSum(), graph_pc_getReductionRatios(), graph_pc_getRoot2PtermEdge(), graph_pc_knotIsDummyTerm(), graph_pc_knotIsFixedTerm(), graph_pc_knotToFixedTerm(), graph_pc_markOrgGraph(), graph_pc_nonTermToFixedTerm(), graph_pc_presolInit(), graph_pc_realDegree(), graph_pc_subtractPrize(), graph_pc_term2edgeIsConsistent(), graph_pc_termToNonTerm(), graph_pc_updateSubgraphEdge(), graph_printInfo(), graph_printInfoReduced(), graph_termsReachable(), graph_transNw2pc(), graph_transPc(), graph_transPc2Spg(), graph_transPcGetRsap(), graph_transPcGetSap(), graph_transPcmw2rooted(), graph_transRmw(), graph_transRpc(), graph_transRpc2FixedProper(), graph_transRpcGetSpg(), graph_valid(), graph_validInput(), graph_voronoi(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), graph_writeGml(), graph_writeGmlSub(), graph_writeStp(), graphBuildV5E5(), graphisValidPcMw(), initPropAtFirstCall(), initReceivedSubproblem(), insertionGetCandidateEdges(), isLastTerm(), isMaxprizeTerm(), localExtendPc(), localInsertion(), localInsertion2(), localInsertion2pc(), localKeyPathExchange(), localKeyPathExchangeMw(), localKeyPathExchangePc(), localKeyPathExchangePc2(), localKeyVertex(), localKeyVertexHeuristics(), localKeyVertexPc(), localKeyVertexPc2(), localRun(), localVertexInsertion(), lpcutAdd(), markSolTreeNodes(), mincut_separateLp(), mincutExec(), mincutInit(), mincutPrepareForLp(), mst_computeOnMarked(), mwContractTerminalsChainWise(), mwContractTerminalsSimple(), nwptstpSetRoot(), packNodes(), packPcMwVanished(), pcContractWithAdjacentTerm(), pcmwEnumerationTry(), pcmwFindMax2Terms(), pcmwGetSolRoot(), pcmwGetStartNodes(), pcmwReduceTerm0Prize(), pcmwUpdate(), pcReduceTermDeg1(), pcReduceTermDeg2(), pcsolGetTrivialEdges(), pcsolMarkGraphNodes(), pcsolMarkGraphNodes_csr(), pcsolPrune(), presolveStp(), pruneSteinerTreePc(), pruneSteinerTreePc_csr(), pruneSteinerTreeStp(), pruneSteinerTreeStp_csr(), pseudoDelDouble(), pseudoDelSingle(), redcostGraphBuild(), redcostGraphComputeSteinerTree(), redcostGraphComputeSteinerTreeDegCons(), redcostGraphComputeSteinerTreeDirected(), redcostGraphMark(), redcostGraphSolRetransform(), redcosts_forLPget(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_boundPruneHeur(), reduce_da(), reduce_dapaths(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_identifyNonLeafTerms(), reduce_impliedProfitBasedRpc(), reduce_nv(), reduce_nvAdv(), reduce_rpt(), reduce_sd(), reduce_sdPc(), reduce_sdStar(), reduce_sdStarBiasedWithProfit(), reduce_sdStarPc(), reduce_sdStarPc2(), reduce_simple_hc(), reduce_simple_mw(), reduce_simple_pc(), reduce_simple_sap(), reduce_sl(), reduce_unconnected(), reduce_unconnectedForDirected(), reduce_unconnectedInfeas(), reduce_unconnectedRpcRmwInfeas(), reinsertSubgraphTransferTerminals(), removeEdge(), replaceEdgeByPath(), reroot(), rpcTryFullReduce(), runTmPcMW_mode(), SCIP_DECL_HEUREXEC(), SCIPprobdataAddNewSol(), SCIPprobdataCreateFromGraph(), SCIPprobdataGetRoot(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurRecExclude(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMCompStarts(), SCIPStpHeurTMRun(), SCIPStpHeurTMRunLP(), SCIPStpValidateSol(), sdgraphGetSd(), sdgraphMstBuild(), sdprofitBuild(), sdprofitBuild1stOnly(), sep_flow(), sepaspecial_pcimplicationsInit(), setNodeSolArray(), shortestpath_computeSteinerTreeDirected(), solgraphAdaptForPcMw(), solIsTrivialPcMw(), solstp_getOrg(), solstp_isValid(), solstp_pcConnectDummies(), solstp_pcGetSolRoot(), solstp_setVertexFromEdge(), solstp_setVertexFromEdgeConn(), stRpcmwInit(), subgraphBuild(), tbottleneckInit(), termcompReduce(), termDeleteExtension(), termsepaFindTerminalSource(), testBdkSdMstDeletesNodeDeg3(), testBdkSdMstDeletesNodeDeg4(), testBdkSdMstStarDeletesNodeDeg4(), testBdkTreeDistDeletesNodeDeg4(), testBiasedTerminalPathsTo4NextFound(), testBiconnectedComponentsAreFound(), testBiconnectedComponentsAreFound2(), testBiconnectedComponentsAreFound3(), testBiconnectedDecomposition(), testBiconnectedDecomposition2(), testBiconnectedDecomposition3(), testBLCworksFor3Star(), testBLCworksFor3StarAfterReduction(), testBLCworksFor5Tree(), testDaPathsPcMw3EdgesWorks(), testDistCloseNodesAreValid(), testDistCloseNodesPcAreValid1(), testDistCloseNodesPcAreValid2(), testDistCloseNodesPcAreValidAfterDeletion(), testDistDistancesAreValid(), testDistRootPathsAreValid(), testEdgeDeletedBy3LeafSpg(), testEdgeDeletedByCommonRedCostsTargets(), testEdgeDeletedByEqBottleneck(), testEdgeDeletedByEqBottleneck2(), testEdgeDeletedByMst1(), testEdgeDeletedByMst2(), testEdgeDeletedByMultiRedCosts(), testEdgeDeletion1_deprecated(), testEdgeDeletion2_deprecated(), testEdgeDeletion3_deprecated(), testEdgeDeletion4_deprecated(), testEdgeDeletion5_deprecated(), testEdgeNotDeleted1(), testGeneralStarDeletedEdge1(), testGeneralStarDeletedEdge2(), testGeneralStarDeletedEdge3(), testNode3PseudoDeletedByContraction(), testNode3PseudoDeletedByRedCosts1(), testNode3PseudoDeletedBySd1(), testNode3PseudoDeletedBySd2(), testNode3PseudoDeletedBySd3(), testNode3PseudoDeletedBySdBiased(), testNode3PseudoDeletedBySdBiasedSimple(), testNode4PseudoDeletedBySd1(), testNode4PseudoNotDeletedBySd1(), testNsvImpliedContractsCutDistEdge(), testNsvImpliedContractsCutDistMiddleEdge(), testNsvImpliedContractsEdge(), testNsvImpliedContractsEdge2(), testNsvImpliedContractsImpliedToTermEdge(), testPathReplaceDeletesEdge(), testPathReplaceDeletesEdge2(), testPcEdgeDeletedByMst1(), testPcEdgeNotDeleted(), testPcNode3PseudoDeletedBySd1(), testPcNode4PseudoDeletedBySd1(), testPrunedSolIsImprovedPc1(), testPrunedSolIsImprovedPc2(), testRmwAnsDeletesOneEdge(), testRmwAnsDeletesOneNode(), testRmwAnsDeletesTwoNodes(), testRmwChain2DeletesNode(), testRmwNpv3DeletesNode(), testRmwTerminalContraction(), testRmwTerminalDeg1Contraction1(), testRmwTerminalDeg1Contraction2(), testRmwTerminalDeg1Contraction3(), testSdBiasedBottleneckDeletesEdge(), testSdBiasedBottleneckTermPathDeletesEdge(), testSdBiasedDeletesEdge(), testSdCliqueStarDeg3AdjacencyIsCorrect(), testSdCliqueStarDeg3IsCorrect(), testSdCliqueStarDeg3IsCorrect2(), testSdCliqueStarDeg4IsCorrect(), testSdCliqueStarDeletesEdge(), testSdGetterReturnsCorrectSds(), testSdGraphDistsAreValid(), testSdGraphDistsAreValid2(), testSdGraphQueriesAreValid(), testSdGraphStrongBiasedDistsAreValid(), testSdPcKillsEdge1(), testSdPcKillsEdge2(), testSdPcKillsTwoEdges(), testSdRepair(), testSdStarBiasedDeletesEdge(), testSdStarBiasedDeletesEdge2(), testSdStarBiasedDeletesEdge3(), testSdStarPcKillsEdge(), testStar3IsCorrect(), testStar4EdgeIsCorrect(), testStar4IsCorrect(), testStar5IsCorrect(), testTerminalPathsRepair(), testTerminalPathsRepair2(), testTerminalPathsRepair3(), testTerminalPathsTo3NextFound(), testTerminalSeparatorsAreFound(), testTerminalSeparatorsAreFound2(), testTerminalSeparatorsAreFound3(), testTmGivesExpectedTreePcFull1(), testTmGivesExpectedTreePcFull2(), testTmGivesExpectedTreePcFull3(), tmLpGetEdgeRandomizations(), tpathsGetDistNew(), trailGraphWithStates(), tryPathPcMw(), updateEdgestateFromRed(), updateEdgestateFromRedPcmw(), updateSolution(), and writeRedcostdata().

◆ term

int* RESTRICT GRAPH::term

Array [0..nodes-1] of networknumber for knot [i], -1 if [i] is never a terminal

Definition at line 196 of file graphdefs.h.

◆ mark

int* RESTRICT GRAPH::mark

Array [0..nodes-1], normally TRUE or FALSE to mark nodes for inclusion in the shortest path / minimum spanning tree routine

Definition at line 198 of file graphdefs.h.

Referenced by ansDeleteVertex(), ansProcessCandidate(), bdkGetCliqueSds(), bdkInit(), bdkStarGetMstStartNode(), bdkStarMarkCliqueNodes(), bdkStarStoreMstsCosts(), bidecomposition_isPossible(), bidecomposition_markSub(), blctreeBuildNodeMap(), blctreeComputeBottlenecks(), borderNodesCollect(), boundPruneHeur(), boundPruneHeurMw(), buildTmAllSp(), closeNodesRunCompute(), collectFixedTerminals(), computeDegConsTree(), computeHistory(), computeNewSols(), computeStarts(), computeSteinerTree(), computeSteinerTreeVnoi(), computeTransVoronoi(), connectivityDataInit(), connectivityDataKeyElimUpdate(), createVariables(), cutNodesComputeDfs(), cutNodesTreeBuildSteinerTree(), cutNodesTreeDeleteComponents(), cutNodesTreeMakeTermsIsComplete(), decomposeBuildCsr(), decomposeGetFirstMarked(), decomposeGetSubgraph(), deletenodesDeg1(), distCloseNodesCompute(), distGetRestricted(), dualascent_execPcMw(), extendSubtreeHead(), extendSubtreeTail(), extractSubgraphAddEdgesWithHistory(), extractSubgraphGetSizeAndMap(), extreduce_checkArc(), extreduce_distDataInit(), extreduce_distDataRecomputeDirtyPaths(), extreduce_edgeIsValid(), extreduce_extPermaInit(), findRootsMark(), getKeyPathUpper(), graph_copyData(), graph_findCentralTerminal(), graph_free(), graph_get4nextTTerms(), graph_init(), graph_init_dcsr(), graph_isMarked(), graph_knot_add(), graph_mark(), graph_path_exec(), graph_path_execX(), graph_path_invroot(), graph_path_PcMwSd(), graph_path_st(), graph_path_st_brmwcs(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_extendBiased(), graph_path_st_pcmw_full(), graph_path_st_rpcmw(), graph_pc_deleteTerm(), graph_pc_markOrgGraph(), graph_pc_subtractPrize(), graph_resize(), graph_sdPaths(), graph_sdStar(), graph_sdStarBiased(), graph_sdWalks(), graph_sdWalks_csr(), graph_sdWalksConnected(), graph_sdWalksExt(), graph_sdWalksExt2(), graph_sdWalksTriangle(), graph_tpathsAdd1st(), graph_tpathsAdd2nd(), graph_tpathsAdd3rd(), graph_tpathsAdd4th(), graph_transPcGetRsap(), graph_transRpcGetSpg(), graph_voronoiExtend(), graph_voronoiMw(), graph_voronoiRepair(), graph_voronoiRepairMult(), graph_voronoiTerms(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), graphmarkIsClean(), hasAdjacentTerminals(), isMaxprizeTerm(), localKeyVertexHeuristics(), mincut_separateLp(), mwContract0WeightVertices(), mwContractNonPositiveChain(), mwContractTerminalsChainWise(), mwContractTerminalsSimple(), mwReduceTermDeg1(), mwTraverseChain(), packNodes(), pcBiasCostsDCSR(), pcContractWithAdjacentTerm(), pcmwDeleteNonSolEdges(), pcmwEnumerationTry(), pcmwGetNewEdgePrize(), pcmwGetStartNodes(), pcmwUpdate(), pcReduceTermDeg1(), pcReduceTermDeg2(), pcsolGetMstEdges(), pcsolMarkGraphNodes(), pcsolPrune(), pcsubtreeDelete(), pricing(), pruneSteinerTreePc(), pruneSteinerTreeStp(), pseudodeleteDeleteNode(), pseudodeleteExecute(), pseudodeleteNodeIsPromising(), redcostGetNTermsMarked(), redcostGraphBuild(), redcostGraphMark(), redcosts_initializeDistances(), reduce_ans(), reduce_ansAdv(), reduce_ansAdv2(), reduce_applyPseudoDeletions(), reduce_bd34(), reduce_bd34WithSd(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_chain2(), reduce_cnsAdv(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_extendedEdge(), reduce_nnp(), reduce_nodesDeg1(), reduce_npv(), reduce_nv(), reduce_nvAdv(), reduce_sd(), reduce_sdBiased(), reduce_sdBiasedNeighbor(), reduce_sdEdgeCliqueStar(), reduce_sdPc(), reduce_sdsp(), reduce_sdspSap(), reduce_sdStar(), reduce_sdStarBiasedWithProfit(), reduce_sdStarPc(), reduce_sdStarPc2(), reduce_sdWalk(), reduce_sdWalk_csr(), reduce_sdWalkExt(), reduce_sdWalkExt2(), reduce_sdWalkTriangle(), reduce_simple_mw(), reduce_simple_pc(), reduce_simple_sap(), reduce_sl(), reduce_termcompChangeSubgraphToBottleneck(), reduce_unconnectedRpcRmwInfeas(), reduceCheckEdge(), reducePcMw(), reduceRootedProb(), reduceWithEdgeFixingBounds(), reduceWithNodeFixingBounds(), removeEdge(), replaceEdgeByPath(), ruleOutSubtree(), SCIPprobdataAddNewSol(), SCIPStpHeurLocalExtendPcMwOut(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMCompStarts(), sdCliqueInitData(), sdCliqueUpdateGraphWithStarWalks(), sdgraphMstBuild(), sdStarBiasedProcessNode(), sdStarFinalize(), soltreeElimKeyPathsStar(), soltreeExchangeKeyPath(), stPcmwInit(), stRpcmwInit(), testSdGetterReturnsCorrectSds(), tmAllspInit(), tpathsScan1st(), tpathsScan2nd(), tpathsScan3rd(), tpathsScan4th(), truncateSubtree(), updateEdgeFixingBounds(), updateNodeFixingBounds(), and vnoiDataRepairPreprocess().

◆ grad

int* RESTRICT GRAPH::grad

Array [0..nodes-1] with degree of knot [i]

Definition at line 201 of file graphdefs.h.

Referenced by ansDeleteVertex(), ansUnmark(), applyBranchHistoryToGraph(), bdkGetCliqueSds(), bdkGetNeighborhood(), bdkNodeIsInvalid(), bdkTryDeg3(), bdkTryDegGe4(), blctreeBuildMst(), blctreeBuildNodeMap(), blctreeComputeBottlenecks(), blctreeComputeEdgesState(), borderNodesContract(), boundPruneHeur(), boundPruneHeurMw(), buildTmAllSp(), closeNodesRunSort(), computeDegConsTree(), computeNewSols(), computeOrderingFromNode(), computeSteinerTree(), computeSteinerTreeVnoi(), computeTransVoronoi(), contractEdgeNoFixedEnd(), createVariables(), cutNodesTreeMakeTerms(), cutNodesTreeMakeTermsIsComplete(), daExec(), daInit(), daOrderRoots(), dapathsFixPotTerms(), dapathsSetRunParams(), daPcFindRoots(), daRpcmwDeleteTermIncidents(), decomposeBuildCsr(), deletenodesDeg1(), delPseudoInit(), delPseudoInitForCheck(), distDataPathRootsInitialize(), dpborderInitHelper(), dualascent_execPcMw(), enumExec(), extCheckNode(), extLeafIsExtendable(), extreduce_checkNode(), extreduce_distDataInit(), extreduce_distDataRecomputeDirtyPaths(), extreduce_mstbiasedCheck3NodeSimple(), extreduce_spgCheck3NodeSimple(), findRootsMark(), generalStarCheck(), generalStarSetUp(), getBiasedMw(), getBiasedPc(), getHighSolDegVertex(), getOrgNodeToNodeMap(), graph_buildOrgNodesToReducedMap(), graph_contractTrace(), graph_copyData(), graph_csr_build(), graph_csr_chgCosts(), graph_edge_add(), graph_edge_del(), graph_edge_delPseudo(), graph_edge_hide(), graph_edge_redirect(), graph_findCentralTerminal(), graph_free(), graph_get_avgDeg(), graph_get_nVET(), graph_init(), graph_init_dcsr(), graph_isMarked(), graph_knot_add(), graph_knot_contract(), graph_knot_contractLowdeg2High(), graph_knot_del(), graph_knot_delFull(), graph_knot_delPseudo(), graph_knot_delPseudoCheckIfPossible(), graph_knot_printInfo(), graph_knot_replaceDeg2(), graph_load(), graph_mark(), graph_pack(), graph_path_PcMwSd(), graph_path_st_pcmw_extend(), graph_pc_contractEdge(), graph_pc_contractEdgeUnordered(), graph_pc_deleteTerm(), graph_pc_getReductionRatios(), graph_pc_knotIsDummyTerm(), graph_pc_markOrgGraph(), graph_pc_nonTermToFixedTerm(), graph_pc_presolInit(), graph_pc_realDegree(), graph_resize(), graph_sdPaths(), graph_sdWalks(), graph_sdWalks_csr(), graph_sdWalksConnected(), graph_sdWalksExt(), graph_sdWalksExt2(), graph_sdWalksTriangle(), graph_show(), graph_transPcGetRsap(), graph_transPcmw2rooted(), graph_transRmw(), graph_transRpcGetSpg(), graph_uncover(), graph_valid(), graph_validInput(), graph_writeGml(), graph_writeGmlSub(), graph_writeStp(), graphisValidPcMw(), graphmarkIsClean(), isLastTerm(), keyNodesResetTerms(), localKeyVertexHeuristics(), localRun(), localVertexInsertion(), markPseudoDeletablesFromBounds(), mwContract0WeightVertices(), mwContractNonPositiveChain(), mwContractTerminalsChainWise(), mwContractTerminalsSimple(), mwGetNchains(), mwReduceTermDeg1(), mwTraverseChain(), nwptstpSetRoot(), packNodes(), pathExend(), pcmwEnumerationTry(), pcmwGetStartNodes(), pcmwReduceKnotDeg1(), pcReduceTermDeg1(), pcsolMarkGraphNodes_csr(), processPath(), propgraphApplyImplicationsPcMw(), pseudoDelDouble(), pseudodeleteDeleteComputeCutoffs(), pseudodeleteDeleteMarkedNodes(), pseudodeleteDeleteNode(), pseudodeleteExecute(), pseudodeleteInitStar(), pseudodeleteNodeIsPromising(), redcostGraphComputeSteinerTree(), reduce_ans(), reduce_ansAdv(), reduce_ansAdv2(), reduce_applyPseudoDeletions(), reduce_bd34(), reduce_bd34WithSd(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_chain2(), reduce_cnsAdv(), reduce_cutEdgeTryPrune(), reduce_da(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_extendedCheck3Tree(), reduce_extendedEdge(), reduce_identifyNonLeafTerms(), reduce_impliedNodesIsValid(), reduce_nodesDeg1(), reduce_npv(), reduce_nv(), reduce_nvAdv(), reduce_removeDeg0NonLeafTerms(), reduce_rpt(), reduce_sd(), reduce_sdsp(), reduce_sdspSap(), reduce_sdStar(), reduce_sdStarBiasedWithProfit(), reduce_sdStarPc(), reduce_sdStarPc2(), reduce_simple(), reduce_simple_mw(), reduce_simple_pc(), reduce_simple_sap(), reduce_sl(), reduce_starReset(), reduce_unconnected(), reduce_unconnectedForDirected(), reduce_unconnectedInfeas(), reduce_unconnectedRpcRmwInfeas(), reduceCheckEdge(), reduceRootedProb(), reduceWithNodeFixingBounds(), reinsertSubgraphAdaptSubToOrgMap(), reinsertSubgraphTransferTerminals(), removeEdge(), replaceEdgeByPath(), reroot(), rpcTryFullReduce(), runTmPcMW_mode(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurTMRunLP(), SCIPStpValidateSol(), sdneighborUpdateExec(), selectBranchingVertexByDegree(), selectBranchingVertexByLp2Flow(), solgraphAdaptForPcMw(), solstp_pcConnectDummies(), solstp_pcGetObjCsr(), STP_Vectype(), stPcmwInit(), subgraphIdentify(), subtreesExtend(), termDeleteExtension(), termsepaCsrAddEdges(), termsepaCsrGetMaxNedges(), testBdkSdMstDeletesNodeDeg3(), testBdkSdMstDeletesNodeDeg4(), testBdkSdMstStarDeletesNodeDeg4(), testBdkTreeDistDeletesNodeDeg4(), testBiconnectedComponentsAreFound(), testBiconnectedComponentsAreFound2(), testBiconnectedComponentsAreFound3(), testNode3PseudoDeletedBySdBiased(), testNsvImpliedContractsCutDistEdge(), testNsvImpliedContractsCutDistMiddleEdge(), testNsvImpliedContractsEdge(), testNsvImpliedContractsEdge2(), testNsvImpliedContractsImpliedToTermEdge(), testPcNode4PseudoDeletedBySd1(), testRmwAnsDeletesOneEdge(), testRmwAnsDeletesOneNode(), testRmwAnsDeletesTwoNodes(), testRmwChain2DeletesNode(), testRmwNpv3DeletesNode(), testRmwTerminalContraction(), testRmwTerminalDeg1Contraction1(), testRmwTerminalDeg1Contraction2(), testRmwTerminalDeg1Contraction3(), tmAllspInit(), tpathsGetKCloseTerms(), trail(), truncateSubtree(), and updateNodeReplaceBounds().

◆ inpbeg

int* RESTRICT GRAPH::inpbeg

Array [0..nodes-1] with starting slot index for the ieat array, -1 if not used

Definition at line 202 of file graphdefs.h.

Referenced by branchOnVertex(), createPrizeConstraints(), createVariables(), daInit(), dapathsSetRunParams(), daPcMarkRoots(), dualascent_execPcMw(), extendSubtreeTail(), findRootsMark(), fixVarsDualcost(), get_inflow(), getBiasedMw(), getBiasedPc(), getKeyPathsStar(), graph_copyData(), graph_dijkLimited_initPcShifts(), graph_edge_add(), graph_edge_redirect(), graph_free(), graph_getCsr(), graph_init(), graph_knot_add(), graph_knot_contract(), graph_knot_del(), graph_knot_delFull(), graph_load(), graph_path_invroot(), graph_pathInLimitedExec(), graph_pc_enforceNonLeafTerm(), graph_pc_evalTermIsNonLeaf(), graph_pc_getRoot2PtermEdge(), graph_pc_knotIsFixedTerm(), graph_pc_nonTermToFixedTerm(), graph_pc_presolInit(), graph_pc_shiftNonLeafCosts(), graph_resize(), graph_show(), graph_transMw(), graph_transNw2sap(), graph_transPcGetSap(), graph_transRmw(), graph_uncover(), graph_valid(), graph_validInput(), graphisValidPcMw(), impliedNodesAddTerm(), initReceivedSubproblem(), isNonLeaf_pretransPc(), mincut_separateLp(), mwContractNonPositiveChain(), mwKnotUpdateIncEdges(), mwReduceTermDeg1(), pcmwReduceKnotDeg1(), pcsolPrune(), pruneSteinerTreeStp(), reduce_boundHopRc(), reduce_daSlackPrune(), reduce_extendedCheck3Tree(), reduce_rpt(), reduce_simple(), reduce_simple_hc(), reduce_simple_sap(), reduce_unconnectedInfeas(), reduce_unconnectedRpcRmwInfeas(), reduceCheckEdge(), removeEdge(), reroot(), ruleOutSubtree(), SCIPprobdataAddNewSol(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), sdprofitBuild(), sdprofitBuild1stOnly(), selectBranchingVertexByLp(), selectBranchingVertexByLp2Flow(), sep_flow(), sep_flowBalance(), sep_flowEdgeOut(), sep_flowIn(), sep_flowTermIn(), sepaspecial_pcimplicationsSeparate(), sepaspecial_vtimplicationsSeparate(), shortestpath_pcInit(), solstp_isValid(), solstp_pcConnectDummies(), stpsol_pruningIsPossible(), termDeleteExtension(), tpathsRepairUpdate1st(), tpathsRepairUpdateLevel(), and vnoiDataRepairPreprocess().

◆ outbeg

int* RESTRICT GRAPH::outbeg

Array [0..nodes-1] with starting slot index for the oeat array, -1 if not used

Definition at line 204 of file graphdefs.h.

Referenced by ansProcessCandidate(), ansProcessCandidateWithBridge(), ansUnmark(), applyBranchHistoryToGraph(), applyLastVertexBranch(), bdkGetCutoffs(), bdkGetEdgeCutoffs(), bdkGetNeighborhood(), bdkNodeIsInvalid(), blctreeComputeBottlenecks(), borderNodesCollect(), bottleneckMarkEqualityPath(), boundPruneHeur(), boundPruneHeurMw(), computeDegConsTree(), computeHistory(), computePertubedSol(), computeSteinerTreeVnoi(), computeTransVoronoi(), createPrizeConstraints(), createVariables(), cutEdgeProbe(), cutEdgePrune(), cutNodesComputeDfs(), cutNodesGetLastCutnode(), cutNodesTreeBuildSteinerTree(), cutNodesTreeMakeTerms(), cutNodesTreeMakeTermsIsComplete(), dapathsFixPotTerms(), dapathsSetRunParams(), dapathsSortStarts(), dapathsUpdate(), daPcFindRoots(), daRedCostIsValid(), daRpcmwDeleteTermIncidents(), decomposeGetFirstMarked(), deletenodesDeg1(), delPseudoCheckReplacement(), delPseudoEdgeGetReplaceEdges(), delPseudoGetReplaceEdges(), delPseudoInit(), delPseudoInitForCheck(), delPseudoPath(), dfsorder(), distGetRestricted(), distgraphAddEdges(), distgraphAddEdgesFromTpaths(), distgraphInsertEdge(), dualascent_allTermsReachable(), dualascent_execDegCons(), dualascent_execPcMw(), extendSubtreeHead(), extractSubgraphAddEdgesWithHistory(), extractSubgraphGetSizeAndMap(), extreduce_mstbiasedCheck3NodeSimple(), extreduce_spgCheck3NodeSimple(), extStackTopCollectExtEdges(), extTreeFindExtensions(), findSolPcMw1Term(), fixVarsDualcost(), generalStarSetUp(), getBiasedMw(), getcloseterms2term(), getHighSolDegVertex(), getKeyPathsStar(), getKeyPathUpper(), getRedCost2ndNextDistances(), getSd(), getTreeRedcosts_dbg(), graph_copyData(), graph_csr_build(), graph_csr_chgCosts(), graph_edge_add(), graph_edge_redirect(), graph_free(), graph_get4nextTTerms(), graph_hasMultiEdges(), graph_init(), graph_init_dcsr(), graph_knot_add(), graph_knot_contract(), graph_knot_del(), graph_knot_delFull(), graph_knot_replaceDeg2(), graph_knotIsNWLeaf(), graph_load(), graph_mincut_exec(), graph_path_exec(), graph_path_execX(), graph_path_PcMwSd(), graph_path_st(), graph_path_st_brmwcs(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_extendBiased(), graph_path_st_pcmw_full(), graph_path_st_pcmw_reduce(), graph_path_st_rpcmw(), graph_pc_adaptSap(), graph_pc_contractEdge(), graph_pc_contractNodeAncestors(), graph_pc_deleteTerm(), graph_pc_markOrgGraph(), graph_pc_presolInit(), graph_pc_term2edgeIsConsistent(), graph_resize(), graph_sdPaths(), graph_sdWalks(), graph_sdWalksConnected(), graph_sdWalksExt(), graph_sdWalksExt2(), graph_show(), graph_tpathsAdd2nd(), graph_tpathsAdd3rd(), graph_tpathsAdd4th(), graph_transPcGetRsap(), graph_transPcmw2rooted(), graph_transRpcGetSpg(), graph_uncover(), graph_valid(), graph_validInput(), graph_voronoi(), graph_voronoiExtend(), graph_voronoiMw(), graph_voronoiRepair(), graph_voronoiRepairMult(), graph_voronoiTerms(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), graphisValidPcMw(), initPropAtFirstCall(), insertionGetCandidateEdges(), isPseudoDeletable(), lca(), ledgeFromNetgraph(), mincutFree(), mincutPrepareForLp(), mwContract0WeightVertices(), mwContractNonPositiveChain(), mwContractTerminalsChainWise(), mwContractTerminalsSimple(), mwReduceTermDeg1(), mwTraverseChain(), nodeIsCrucial(), packNodes(), pcContractWithAdjacentTerm(), pcmwDeleteNonSolEdges(), pcmwGetSolRoot(), pcmwReduceKnotDeg1(), pcmwReduceTerm0Prize(), pcmwUpdate(), pcReduceKnotDeg2(), pcReduceTermDeg1(), pcReduceTermDeg2(), pcsolGetTrivialEdges(), pcsolPrune(), pcsubtreeDelete(), pcsubtreePruneForProfit(), pruneSteinerTreeStp(), pseudoDelDouble(), pseudodeleteDeleteComputeCutoffs(), pseudodeleteDeleteNode(), redcostGraphBuild(), redcostGraphMark(), redcosts_initializeDistances(), reduce_ans(), reduce_ansAdv(), reduce_ansAdv2(), reduce_applyPseudoDeletions(), reduce_bd34(), reduce_bd34WithSd(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_chain2(), reduce_cnsAdv(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_deleteMultiedges(), reduce_extendedCheck3Tree(), reduce_getSdByPaths(), reduce_impliedNodesIsValid(), reduce_nnp(), reduce_nodesDeg1(), reduce_npv(), reduce_nv(), reduce_nvAdv(), reduce_rpt(), reduce_sd(), reduce_sdBiased(), reduce_sdBiasedNeighbor(), reduce_sdEdgeCliqueStar(), reduce_sdImpLongEdge(), reduce_sdPc(), reduce_sdsp(), reduce_sdspSap(), reduce_sdWalk(), reduce_sdWalkExt(), reduce_sdWalkExt2(), reduce_simple(), reduce_simple_dc(), reduce_simple_hc(), reduce_simple_mw(), reduce_simple_sap(), reduce_sl(), reduce_starReset(), reduce_termcompChangeSubgraphToBottleneck(), reduce_termcompChangeSubgraphToOrgCosts(), reduce_unconnectedRpcRmwInfeas(), reduceCheckEdge(), reducePcMw(), reduceRootedProb(), reduceWithEdgeFixingBounds(), reinsertSubgraphDeleteOldEdges(), removeEdge(), reroot(), ruleOutSubtree(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpValidateSol(), sdCliqueStarComputeSds(), sdCliqueStarGetNodeBias(), sdCliqueUpdateGraphWithStarWalks(), sdDcExtendTree(), sddeltable(), sdGetSdPcMw(), sdgraphUpdateDistgraphFromTpaths(), sdneighborUpdateExec(), sep_flowBalance(), sep_flowEdgeOut(), sepafullAddSingleSolcandEdges(), sepaspecial_vtimplicationsInit(), solgraphAdaptForDCSTP(), solIsTrivialPcMw(), solstp_containsNode(), solstp_isValid(), solstp_pcGetSolRoot(), soltreeElimKeyPathsStar(), soltreeExchangeKeyPath(), spg3StarNeighborRuleOut(), stpsol_pruningIsPossible(), subgraphBuild(), subgraphIdentify(), termcompDeleteEdges(), termsepaBuildRootcomp(), termsepaCsrAddEdges(), termsepaCsrAddTermCopies(), termsepaCutIsCorrect(), termsepaTraverseSinkComp(), testEdgeDeletion2_deprecated(), testEdgeDeletion4_deprecated(), testEdgeDeletion5_deprecated(), testSdGetterReturnsCorrectSds(), tpathsRepairTraverse1st(), tpathsRepairTraverseLevelWithStack(), tpathsRepairTraverseStackAddBelow(), tpathsScan1st(), tpathsScan2nd(), tpathsScan3rd(), tpathsScan4th(), trail(), trail_old(), trailGraphWithStates(), updateEdgeFixingBounds(), updateEdgeLurkingBounds(), updateNodeReplaceBounds(), updateTerminalSource(), vnoiCompute(), and vnoiComputeImplied().

◆ maxdeg

int* RESTRICT GRAPH::maxdeg

For HCDSTP: Array [0..nodes-1] containing the maximal degrees of all nodes

Definition at line 206 of file graphdefs.h.

Referenced by buildsolgraph(), computeDegConsTree(), createDegreeConstraints(), dualascent_execDegCons(), graph_copyData(), graph_free(), graph_init(), graph_load(), graph_pack(), graph_path_st_dc(), initPropAtFirstCall(), redcostGraphBuild(), reduce_simple_dc(), SCIP_DECL_CONSPROP(), SCIPStpHeurTMBuildTreeDc(), SCIPStpValidateSol(), solstp_isValid(), and tmLpGetEdgeRandomizations().

◆ term2edge

int* GRAPH::term2edge

(R)PCSTP and (R)MWCSP: Array [0..nodes-1] of edge to twin terminal or -1

Definition at line 208 of file graphdefs.h.

Referenced by applyBranchHistoryToGraph(), contractEdgeNoFixedEnd(), daPcFindRoots(), daRpcmwDeleteTermIncidents(), findRootsMark(), getBoundchangesPcMW(), graph_copyData(), graph_free(), graph_init(), graph_knot_printInfo(), graph_pc_contractEdge(), graph_pc_deleteTerm(), graph_pc_finalizeSubgraph(), graph_pc_fixedTermToNonTerm(), graph_pc_getTwinTerm(), graph_pc_initTerm2Edge(), graph_pc_knotIsFixedTerm(), graph_pc_knotIsPropPotTerm(), graph_pc_knotToFixedTerm(), graph_pc_knotToFixedTermProperty(), graph_pc_knotToNonTermProperty(), graph_pc_nonTermToFixedTerm(), graph_pc_term2edgeIsConsistent(), graph_pc_termIsNonLeafTerm(), graph_pc_termToNonLeafTerm(), graph_pc_updateSubgraphEdge(), graph_resize(), graph_transPc(), graph_transPc2Spg(), graph_transPcGetRsap(), graph_transPcmw2rooted(), graph_transRmw(), graph_transRpc(), graph_transRpc2SpgTrivial(), graphisValidPcMw(), initReceivedSubproblem(), isLastTerm(), packNodes(), pcmwGetStartNodes(), pcmwReduceTerm0Prize(), pcmwUpdate(), redcostGraphBuild(), redcosts_forLPget(), reduce_identifyNonLeafTerms(), reduce_unconnectedRpcRmwInfeas(), selectBranchingVertexBySol(), solgraphAdaptForPcMw(), and termDeleteExtension().

◆ prize

SCIP_Real* GRAPH::prize

For NWSTP, (R)PCSTP and (R)MWCSP: Array [0..nodes-1] of node costs

Definition at line 210 of file graphdefs.h.

Referenced by addPathHeadEdge(), addToCandidates(), ansProcessCandidate(), ansProcessCandidateWithBridge(), applyBranchHistoryToGraph(), bottleneckGetDist(), bottleneckMarkEqualityEdges(), boundPruneHeur(), boundPruneHeurMw(), buildsolgraph(), computeReducedProbSolutionBiased(), contractEdgeNoFixedEnd(), contractEdgeWithFixedEnd(), createVariables(), daPcFindRoots(), daPcMarkRoots(), delPseudoInit(), delPseudoInitForCheck(), extInnerNodeAdd(), extInnerNodeRemoveTop(), extreduce_bottleneckMarkRootPath(), extreduce_spgCheck3ComponentSimple(), extreduce_treeRecompCosts(), findRootsMark(), findSolPcMw2Term(), findSolRPcMw(), getBiasedMw(), getBiasedPc(), getBoundchangesPcMW(), getKeyPathsStar(), getOrgNodeToNodeMap(), graph_copyData(), graph_dijkLimited_initPcShifts(), graph_free(), graph_init(), graph_knot_printInfo(), graph_load(), graph_pack(), graph_path_PcMwSd(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_extendOut(), graph_pc_contractEdge(), graph_pc_deleteTerm(), graph_pc_enforceNonLeafTerm(), graph_pc_enforcePseudoTerm(), graph_pc_evalTermIsNonLeaf(), graph_pc_finalizeSubgraph(), graph_pc_fixedTermToNonTerm(), graph_pc_getNonLeafTermOffset(), graph_pc_getPosPrizeSum(), graph_pc_initPrizes(), graph_pc_knotChgPrize(), graph_pc_knotHasMaxPrize(), graph_pc_knotIsFixedTerm(), graph_pc_knotIsPropPotTerm(), graph_pc_knotToFixedTerm(), graph_pc_knotToFixedTermProperty(), graph_pc_nonLeafTermIsEnforced(), graph_pc_nonTermToFixedTerm(), graph_pc_shiftNonLeafCosts(), graph_pc_solGetObj(), graph_pc_subtractPrize(), graph_pc_term2edgeIsConsistent(), graph_pc_termToNonTerm(), graph_pc_transOrgAreConistent(), graph_resize(), graph_sdWalks(), graph_sdWalks_csr(), graph_sdWalksConnected(), graph_sdWalksExt(), graph_sdWalksExt2(), graph_sdWalksTriangle(), graph_transMw(), graph_transNw2pc(), graph_transNw2sap(), graph_transPc(), graph_transPc2Spg(), graph_transPcGetRsap(), graph_transPcGetSap(), graph_transPcmw2rooted(), graph_transRmw(), graph_transRpc(), graph_transRpc2FixedProper(), graph_transRpc2SpgTrivial(), graph_transRpcGetSpg(), graph_transRpcToSpgIsStable(), graph_voronoiMw(), graph_voronoiTerms(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), graph_writeStp(), graphBuildV5E5(), graphisValidPcMw(), impliedNodesAddTerm(), initCostsAndPrioLP(), initReceivedSubproblem(), insertionInitInsert(), isMaxprizeTerm(), isNonLeaf_pretransPc(), localExtendPc(), localInsertion2pc(), localKeyPathExchangeMw(), localKeyPathExchangePc(), localKeyPathExchangePc2(), localKeyVertexHeuristics(), localKeyVertexPc(), localKeyVertexPc2(), localVertexInsertion(), mstCompRuleOut(), mstLevelLeafTryExtMst(), mwContract0WeightVertices(), mwContractNonPositiveChain(), mwContractTerminalsChainWise(), mwKnotUpdateIncEdges(), mwReduceTermDeg1(), mwTraverseChain(), packNodes(), pathExendPrepare(), pcBiasCostsDCSR(), pcContractWithAdjacentTerm(), pcmwFindMax2Terms(), pcmwGetStartNodes(), pcmwReduceKnotDeg1(), pcmwReduceTerm0Prize(), pcReduceTermDeg1(), pcReduceTermDeg2(), pcSdToNodeMark(), pcsubtreePruneForProfit(), propgraphApplyImplicationsPcMw(), pseudodeleteDeleteNode(), redcostGraphBuild(), reduce_ans(), reduce_ansAdv(), reduce_ansAdv2(), reduce_applyPseudoDeletions(), reduce_bd34(), reduce_bound(), reduce_boundMw(), reduce_chain2(), reduce_cnsAdv(), reduce_daPcMw(), reduce_getSdByPaths(), reduce_identifyNonLeafTerms(), reduce_nnp(), reduce_npv(), reduce_nv(), reduce_nvAdv(), reduce_sdPc(), reduce_sdsp(), reduce_simple_mw(), reduce_simple_pc(), reduce_sl(), ruleOutSubtree(), runTmPcMW_mode(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalExtendPcMwOut(), SCIPStpHeurRecExclude(), sdGetSdPcMw(), sdprofitBuild(), sdprofitBuild1stOnly(), selectBranchingVertexBySol(), solstp_pcGetObjCsr(), stpsol_pruningIsPossible(), strongPruneSteinerTreePc(), strongPruneSteinerTreePc_csr(), supergraphComputeMst(), termDeleteExtension(), testDaPathsPcMw3EdgesWorks(), testDistCloseNodesPcAreValid1(), testDistCloseNodesPcAreValid2(), testDistCloseNodesPcAreValidAfterDeletion(), testPcEdgeDeletedByMst1(), testPcEdgeNotDeleted(), testPcNode3PseudoDeletedBySd1(), testPcNode4PseudoDeletedBySd1(), testPrunedSolIsImprovedPc1(), testPrunedSolIsImprovedPc2(), testRmwAnsDeletesOneEdge(), testRmwAnsDeletesOneNode(), testRmwAnsDeletesTwoNodes(), testRmwChain2DeletesNode(), testRmwNpv3DeletesNode(), testRmwTerminalContraction(), testRmwTerminalDeg1Contraction1(), testRmwTerminalDeg1Contraction2(), testRmwTerminalDeg1Contraction3(), testSdBiasedBottleneckDeletesEdge(), testSdPcKillsEdge1(), testSdPcKillsEdge2(), testSdPcKillsTwoEdges(), testSdStarPcKillsEdge(), testTmGivesExpectedTreePcFull1(), testTmGivesExpectedTreePcFull2(), testTmGivesExpectedTreePcFull3(), and tryPathPcMw().

◆ costbudget

SCIP_Real* GRAPH::costbudget

budget cost value for (R)BMWCSP: Array [0..nodes-1]

Definition at line 211 of file graphdefs.h.

Referenced by createVariables(), graph_copyData(), graph_free(), graph_init(), graph_load(), graph_path_st_brmwcs(), graph_resize(), graph_transRpc2SpgTrivial(), packNodes(), and packPcMwInit().

◆ budget

SCIP_Real GRAPH::budget

budget value for (R)BMWCSP

Definition at line 212 of file graphdefs.h.

Referenced by createBudgetConstraint(), graph_copyData(), graph_init(), graph_load(), graph_pack(), graph_path_st_brmwcs(), and graph_printInfo().

◆ norgmodeledges

int GRAPH::norgmodeledges

Count of edges prior to graph transformation

Definition at line 215 of file graphdefs.h.

Referenced by getBiasedMw(), graph_copyData(), graph_init(), graph_pack(), graph_pc_getReductionRatios(), graph_transPc(), graph_transRmw(), graph_transRpc(), redcostGraphBuild(), SCIPStpHeurPruneRun(), and updatePropgraph().

◆ hoplimit

int GRAPH::hoplimit

maximal number of edges allowed for a solution to be feasible (only used for HCDSTPs)

Definition at line 216 of file graphdefs.h.

Referenced by buildsolgraph(), createHopConstraint(), dhcstpWarmUp(), graph_copyData(), graph_init(), graph_load(), graph_pack(), graph_writeStp(), redcostGraphBuild(), reduce_boundHop(), reduce_boundHopR(), reduce_da(), and updateBestSol().

◆ esize

int GRAPH::esize

Count of allocated edge slots

Definition at line 218 of file graphdefs.h.

Referenced by distgraphInsertEdge(), extractSubgraphAddEdgesWithHistory(), extractSubgraphBuild(), extractSubgraphInitHistory(), getBiasedMw(), graph_copy(), graph_copyData(), graph_edge_add(), graph_init(), graph_pc_initSubgraph(), graph_pc_updateSubgraphEdge(), graph_resize(), graph_transPc(), graph_transPc2Spg(), graph_transPcGetRsap(), graph_transPcGetSap(), graph_transRmw(), graph_transRpc(), and graph_transRpc2FixedProper().

◆ edges

int GRAPH::edges

Count of edges in the graph

Definition at line 219 of file graphdefs.h.

Referenced by abortSlackPruneEarly(), addRedsol(), ancestorsMarkConflict(), ancestorsUnmarkConflict(), bdkInit(), bea_save(), boundPruneHeur(), boundPruneHeurMw(), buildsolgraph(), checkSdWalk(), closeNodesRunInit(), computeDegConsTree(), computeHistory(), computeHistoryPcMw(), computeNewSols(), computeOnMarked_init(), computePertubedSol(), computeReducedProbSolution(), computeReducedProbSolutionBiased(), computeSteinerTree(), computeSteinerTree_init(), computeSteinerTreeRedCosts(), computeSteinerTreeRedCostsDirected(), computeSteinerTreeRedCostsPcMw(), computeSteinerTreeVnoi(), computeTransVoronoi(), connectivityDataInit(), copy_graph(), createInitialCuts(), createPrizeConstraints(), createVariables(), daExec(), daPcFindRoots(), distDataPathRootsFree(), distDataPathRootsInitialize(), distgraphInsertEdge(), dpborderIsNonPromising(), dpterms_isPromisingPartly(), dualascent_exec(), dualascent_execPcMw(), extInitRedCostArrays(), extractSubgraphAddEdgesWithHistory(), extreduce_checkComponent(), extreduce_redcostAddEdge(), extreduce_redcostTreeRecompute(), extTreeFindExtensions(), fixVarsDualcost(), fixVarsDualcostLurking(), fixVarsExtendedRed(), fixVarsRedbasedIsPromising(), generalStarDeleteEdges(), getBiasedMw(), getBiasedPc(), getEdgeReductionRatio(), getReductionRatios(), getSolObj(), getWorkLimitsPc(), graph_copyData(), graph_copyPseudoAncestors(), graph_csr_build(), graph_csr_chgCosts(), graph_edge_add(), graph_edge_delBlocked(), graph_findCentralTerminal(), graph_freeHistory(), graph_get4nextTTerms(), graph_get_nEdges(), graph_init(), graph_init_csr(), graph_init_csrWithEdgeId(), graph_init_dcsr(), graph_initPseudoAncestors(), graph_load(), graph_mincut_exec(), graph_mincut_init(), graph_pack(), graph_pc_2trans(), graph_pc_getReductionRatios(), graph_pc_getTwinTerm(), graph_pc_initSubgraph(), graph_pc_presolInit(), graph_pc_shiftNonLeafCosts(), graph_pc_transOrgAreConistent(), graph_pc_updateSubgraphEdge(), graph_printEdgeConflicts(), graph_printInfo(), graph_resize(), graph_show(), graph_transPc(), graph_transPc2Spg(), graph_transPcGetRsap(), graph_transPcGetSap(), graph_transRmw(), graph_transRpc(), graph_transRpc2FixedProper(), graph_transRpcGetSpg(), graph_uncover(), graph_valid(), graph_valid_ancestors(), graph_valid_csr(), graph_valid_dcsr(), graph_voronoiWithDist(), graph_writeGml(), graph_writeGmlSub(), graph_writeStp(), graph_writeStpOrg(), hasAdjacentTerminals(), initCostOrgPc(), initCostsAndPrioLP(), initDefault(), initialise(), initializeIncumbent(), insertionInit(), localExtendPc(), localInsertion(), localInsertion2(), localInsertion2pc(), localKeyPathExchange(), localKeyPathExchangeMw(), localKeyPathExchangePc(), localKeyPathExchangePc2(), localKeyVertex(), localKeyVertexHeuristics(), localKeyVertexPc(), localKeyVertexPc2(), localRun(), localVertexInsertion(), lpcutSetEdgeCapacity(), markAncestors(), markAncestorsConflict(), markSolTreeNodes(), maxflow(), mwGetNchains(), nail(), packEdges(), packPseudoAncestors(), pcBiasCostsDCSR(), pcsolGetTrivialEdges(), poolSolIsUnreduced(), presolveStp(), propgraphApplyBoundchanges(), pruneSteinerTreeStp(), pseudoAncestorsCreation(), pseudoAncestorsHash(), pseudoAncestorsHashPc(), pseudoAncestorsMerge(), pseudoAncestorsMergePc(), redcostGraphBuild(), redcostGraphComputeSteinerTree(), redLoopInnerPc(), reduce_bd34(), reduce_bd34WithSd(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_contract0Edges(), reduce_da(), reduce_daPcMw(), reduce_deleteConflictEdges(), reduce_extendedCheck3Tree(), reduce_extendedEdge(), reduce_impliedProfitBasedRpc(), reduce_pc(), reduce_sd(), reduce_sdGetSdsCliquegraph(), reduce_sdPc(), reduce_sdspSap(), reduce_sdStar(), reduce_sdStarPc(), reduce_sdStarPc2(), reduce_sdWalk_csr(), reduce_sdWalkTriangle(), reduce_termcompChangeSubgraphToOrgCosts(), reduceCheckEdge(), reinsertSubgraph(), retransformReducedProbSolution(), ruleOutSubtree(), runDualAscent(), runTmPcMW_mode(), tsp::ProbDataTSP::scip_copy(), SCIP_DECL_CONSLOCK(), SCIP_DECL_HEUREXEC(), SCIP_DECL_READERREAD(), SCIP_DECL_RELAXEXEC(), tsp::ProbDataTSP::scip_trans(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalExtendPcMwOut(), SCIPStpHeurPruneRun(), SCIPStpHeurPruneUpdateSols(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), SCIPStpValidateSol(), sdCliqueInitData(), selectBranchingVertexBySol(), sepafullAddSolForCand(), sepaspecial_pcimplicationsInit(), sepaSubtour(), setCostToOrgPc(), setCostToOrgPcPreState(), setParams(), setParamsSepaIsBad(), solgraphAddEdges(), solgraphSelectSolsDiff(), solPrune(), solstp_getObj(), solstp_getObjBounded(), solstp_getOrg(), solstp_isValid(), solstp_setVertexFromEdge(), solstp_setVertexFromEdgeConn(), solveWithDpBorder(), solveWithDpTerms(), stp_save(), stptest_graphSetUpPcExtended(), stptest_graphSetUpRmwExtended(), stptest_graphSetUpRpcExtended(), subgraphBuild(), substpsolver_getObjFromGraph(), substpsolver_initDP(), termcompReduceWithParams(), testDaPathsPcMw3EdgesWorks(), testEdgeDeletedBy3LeafSpg(), testEdgeDeletedByCommonRedCostsTargets(), testEdgeDeletedByEqBottleneck(), testEdgeDeletedByEqBottleneck2(), testEdgeDeletedByMst1(), testEdgeDeletedByMst2(), testEdgeDeletedByMultiRedCosts(), testEdgeDeletion1_deprecated(), testEdgeDeletion2_deprecated(), testEdgeDeletion3_deprecated(), testEdgeDeletion4_deprecated(), testEdgeDeletion5_deprecated(), testGeneralStarDeletedEdge1(), testGeneralStarDeletedEdge2(), testNode3PseudoDeletedByContraction(), testNode3PseudoDeletedByRedCosts1(), testNode3PseudoDeletedBySd1(), testNode3PseudoDeletedBySd2(), testNode3PseudoDeletedBySd3(), testNode3PseudoDeletedBySdBiased(), testNode3PseudoDeletedBySdBiasedSimple(), testNode4PseudoDeletedBySd1(), testNode4PseudoNotDeletedBySd1(), testPcEdgeDeletedByMst1(), testPcEdgeNotDeleted(), testPcNode3PseudoDeletedBySd1(), testPcNode4PseudoDeletedBySd1(), unmarkAncestors(), unmarkAncestorsConflict(), updateEdgestateFromRedPcmw(), updateNodeReplaceBounds(), updatePropgraph(), and updateSolution().

◆ orgedges

◆ cost

SCIP_Real* GRAPH::cost

Array [0..edges-1] of positive edge costs

Definition at line 221 of file graphdefs.h.

Referenced by addComponentUpdateTreeCosts(), addPathHeadEdge(), applyBranchHistoryToGraph(), applyEdgestateToProb(), bdkGetCutoffs(), bdkGetEdgeCutoffs(), bdkStarGetCost(), bdkStarIsReplacableDeg3(), bdkStarIsSdMstReplacable(), bdkTryDeg3(), bdkTryDegGe4(), bea_save(), blctreeBuildMst(), blctreeComputeBottlenecks(), blockEdgesWithGlobalFixings(), bottleneckMarkEqualityPath(), boundPruneHeur(), boundPruneHeurMw(), computeNewSols(), computeReducedProbSolutionBiased(), contractEdgeNoFixedEnd(), createInitialCuts(), createVariables(), daExec(), daInit(), daInitRescaps(), dapathsInitRedCosts(), dapathsSetRunParams(), dapathsSortStarts(), daPcAddTmSolToPool(), daPcFindRoots(), daPcMarkRoots(), daRpcmwDeleteTermIncidents(), decomposeExactFixSol(), delPseudoEdgeGetReplaceEdges(), delPseudoInit(), delPseudoInitForCheck(), delPseudoPath(), dhcstpWarmUp(), distGetRestricted(), distgraphAddEdges(), distgraphAddEdgesFromTpaths(), distgraphInsertEdge(), dualascent_execDegCons(), dualascent_execPcMw(), extendSubtreeHead(), extendSubtreeTail(), extPreprocessInitialGenStar(), extPreprocessInitialStar(), extractSubgraphAddEdge(), extreduce_bottleneckToSiblingIsDominated(), extreduce_bottleneckToSiblingIsDominatedBiased(), extreduce_bottleneckWithExtedgeIsDominated(), extreduce_bottleneckWithExtedgeIsDominatedBiased(), extreduce_deleteArcs(), extreduce_deleteEdges(), extreduce_mstbiasedCheck3NodeSimple(), extreduce_spgCheck3ComponentSimple(), extreduce_spgCheck3NodeSimple(), extreduce_treeRecompCosts(), extTreeAddEdge(), extTreeStackTopRemove(), findRootsMark(), generalStarSetUp(), getBiasedMw(), getBiasedPc(), getBoundaryPathCost(), getBoundchangesPcMW(), getcloseterms2term(), getEdgeCosts(), getEdgeCostUnbiased(), getExtBottleneckDist(), getKeyPathUpper(), getSd(), gmlWriteEdge(), graph_copyData(), graph_dijkLimited_initPcShifts(), graph_edge_add(), graph_edge_addSubgraph(), graph_edge_isBlocked(), graph_edge_printInfo(), graph_edge_redirect(), graph_free(), graph_getEdgeCosts(), graph_getEdgeRevCosts(), graph_init(), graph_init_csr(), graph_init_csrWithEdgeId(), graph_init_dcsr(), graph_isAlmostUniform(), graph_knot_contract(), graph_knot_replaceDeg2(), graph_knotIsNWLeaf(), graph_load(), graph_pc_2trans(), graph_pc_adaptSap(), graph_pc_edgeIsExtended(), graph_pc_enforceNonLeafTerm(), graph_pc_enforcePseudoTerm(), graph_pc_evalTermIsNonLeaf(), graph_pc_getNorgEdges(), graph_pc_getOrgCosts(), graph_pc_getOrgCostsCsr(), graph_pc_knotChgPrize(), graph_pc_knotIsFixedTerm(), graph_pc_markOrgGraph(), graph_pc_nonTermToFixedTerm(), graph_pc_shiftNonLeafCosts(), graph_pc_solGetObj(), graph_pc_subtractPrize(), graph_pc_transOrgAreConistent(), graph_resize(), graph_show(), graph_subgraphCompleteNewHistory(), graph_transGstpClean(), graph_transMw(), graph_transNw2pc(), graph_transNw2sap(), graph_transPcGetRsap(), graph_transPcGetSap(), graph_transPcmw2rooted(), graph_transRmw(), graph_transRpcGetSpg(), graph_valid_ancestors(), graph_voronoiTerms(), graph_voronoiWithRadius(), graph_writeGmlSub(), graph_writeStp(), graph_writeStpOrg(), graphisValidPcMw(), impliedNodesAddTerm(), initCostOrgPc(), initCostsAndPrioLP(), initReceivedSubproblem(), insertionGetCandidateEdges(), isNonLeaf_pretransPc(), isPseudoDeletable(), ledgeFromNetgraph(), localExtendPc(), localKeyVertexHeuristics(), localRun(), localVertexInsertion(), mst_init(), mwContractNonPositiveChain(), mwKnotUpdateIncEdges(), mwReduceTermDeg1(), mwTraverseChain(), nodesolUpdate(), nsvEdgeContract(), nsvEdgeGetTermDists(), nsvExec(), packNodes(), pathExendPrepare(), pcContractWithAdjacentTerm(), pcmwDeleteNonSolEdges(), pcmwGetSolRoot(), pcReduceKnotDeg2(), pcReduceTermDeg1(), pcReduceTermDeg2(), propgraphDeleteEdge(), propgraphFixEdge(), pseudodeleteBiasedIsPromising(), pseudodeleteDeleteComputeCutoffs(), pseudodeleteDeleteNode(), redcosts_forLPget(), reduce_bd34(), reduce_bd34WithSd(), reduce_bound(), reduce_boundHop(), reduce_boundHopDa(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_contract0Edges(), reduce_da(), reduce_daSlackPrune(), reduce_deleteConflictEdges(), reduce_extendedCheck3Tree(), reduce_extendedEdge(), reduce_getSdByPaths(), reduce_impliedProfitBasedRpc(), reduce_npv(), reduce_nv(), reduce_nvAdv(), reduce_rpt(), reduce_sap(), reduce_sd(), reduce_sdBiased(), reduce_sdBiasedNeighbor(), reduce_sdEdgeCliqueStar(), reduce_sdImpLongEdge(), reduce_sdPc(), reduce_sdprofitUpdateFromBLC(), reduce_sdRepair(), reduce_sdsp(), reduce_sdspSap(), reduce_sdWalk(), reduce_sdWalkExt(), reduce_sdWalkExt2(), reduce_simple(), reduce_simple_hc(), reduce_simple_sap(), reduce_sl(), reduce_termcompChangeSubgraphToBottleneck(), reduce_termcompChangeSubgraphToOrgCosts(), reduce_unconnectedRpcRmwInfeas(), reduceCheckEdge(), reduceRootedProb(), reduceWithEdgeFixingBounds(), ruleOutSubtree(), runTmPcFull(), SCIP_DECL_HEUREXEC(), SCIPprobdataAddNewSol(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurPruneUpdateSols(), SCIPStpHeurRecExclude(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMRunLP(), sdCliqueStarComputeSds(), sdCliqueStarGetNodeBias(), sdCliqueUpdateGraphWithStarWalks(), sddeltable(), sdGetSdPcMw(), sdgraphGetSd(), sdgraphMstBuild(), sdgraphMstSortCosts(), sdgraphUpdateDistgraphFromTpaths(), sdprofitBuild(), sdqueryBuildBinaryTree(), selectBranchingVertexBySol(), sepafullAddSolForCand(), sepafullBuildSolcands(), sepafullReduceFromSols(), sepaspecial_pcimplicationsInit(), sepaspecial_vtimplicationsInit(), setCostToOrgPc(), setCostToOrgPcPreState(), setNodeSolArray(), setSubBottleneckEdges(), solAddTry(), solstp_getObjBounded(), solstp_isUnreduced(), solstp_prune(), solstp_pruneFromTmHeur(), solstp_pruneFromTmHeur_csr(), spg3StarNeighborRuleOut(), stp_save(), stpsol_pruningIsPossible(), subgraphBuild(), supergraphComputeMst(), tbottleneckInit(), termDeleteExtension(), testBiasedTerminalPathsTo4NextFound(), testEdgeDeletedByMultiRedCosts(), testEdgeDeletion3_deprecated(), testSdGetterReturnsCorrectSds(), testTerminalPathsRepair(), testTerminalPathsRepair2(), testTerminalPathsRepair3(), testTerminalPathsTo3NextFound(), tmBaseInit(), tpathsBuild(), tpathsBuildBiased(), tpathsRepair1st(), tpathsRepair2nd(), tpathsRepair3rd(), tpathsRepair4th(), tpathsRepairUpdate1st(), tpathsRepairUpdateLevel(), trail(), tryPathPcMw(), updateSolution(), vnoiCompute(), and vnoiComputeImplied().

◆ cost_org_pc

SCIP_Real* GRAPH::cost_org_pc

Array [0..edges-1] of positive edge costs for non-transformed PC/MW variants

Definition at line 222 of file graphdefs.h.

Referenced by graph_copyData(), graph_free(), graph_init(), graph_pc_2trans(), graph_pc_enforceNonLeafTerm(), graph_pc_finalizeSubgraph(), graph_pc_getOrgCosts(), graph_pc_getOrgCostsCsr(), graph_pc_initSubgraph(), graph_pc_shiftNonLeafCosts(), graph_pc_transOrgAreConistent(), graph_pc_updateSubgraphEdge(), initCostOrgPc(), selectBranchingVertexBySol(), setCostToOrgPc(), setCostToOrgPcPreState(), and stpsol_pruningIsPossible().

◆ tail

int* RESTRICT GRAPH::tail

Array [0..edges-1] of node-number of tail of edge [i]

Definition at line 223 of file graphdefs.h.

Referenced by bdkGetEdgeCutoffs(), bdkStarGetCost(), bea_save(), blctreeBuildMst(), blctreeEvert(), bottleneckRuleOut(), boundPruneHeur(), boundPruneHeurMw(), buildsolgraph(), closeNodesPathIsForbidden(), closeNodesRunCompute(), computeDegConsTree(), computeReducedProbSolutionBiased(), computeSteinerTree(), computeSteinerTreeVnoi(), connectivityDataInit(), connectivityDataKeyElimUpdate(), contractEdgeNoFixedEnd(), contractEdgeWithFixedEnd(), createPrizeConstraints(), createVariables(), daExec(), daInit(), dapathsSetRunParams(), daPcMarkRoots(), daRpcmwDeleteTermIncidents(), decomposeExactFixSol(), delPseudoDeleteVertex(), delPseudoEdgeDeleteEdge(), delPseudoEdgeGetReplaceEdges(), delPseudoPath(), distCloseNodesIncluded(), distCloseNodesPrintLostNodeInfo(), distgraphAddEdges(), distgraphInsertEdge(), dualascent_execPcMw(), extendSubtreeTail(), extPreprocessInitialEdge(), extPreprocessInitialGenStar(), extPreprocessInitialStar(), extractSubgraphAddEdgesWithHistory(), extreduce_bottleneckCheckNonLeaves(), extreduce_bottleneckCheckNonLeaves_pc(), extreduce_bottleneckToSiblingIsDominated(), extreduce_bottleneckToSiblingIsDominatedBiased(), extreduce_bottleneckWithExtedgeIsDominated(), extreduce_bottleneckWithExtedgeIsDominatedBiased(), extreduce_checkArc(), extreduce_checkEdge(), extreduce_edgeIsValid(), extreduce_extCompClean(), extreduce_extCompRevert(), extreduce_mstLevelVerticalAddLeaf(), extreduce_mstLevelVerticalAddLeafInitial(), extreduce_redcostAddEdge(), extreduce_spgCheck3ComponentSimple(), extStackAddCompInitialExpanded(), extStackAddCompsExpanded(), extStackAddCompsExpandedSing(), extStackGetTopRoot(), extStackTopCollectExtEdges(), extStackTopProcessInitialEdges(), extTreeAddEdge(), extTreeRuleOutSingletonFull(), extTreeRuleOutSingletonImplied(), extTreeStackTopRemove(), extTreeStackTopRootRemove(), findRootsMark(), generalStarCheck(), generalStarCheckGetNextStar(), generalStarSetUp(), getBiasedMw(), getBiasedPc(), getBoundaryPathCost(), getBoundaryPathCostPrized(), getBoundchanges(), getCloseNodePath(), getExtBottleneckDist(), getGraphStatesDirected(), getKeyPathsStar(), getKeyPathUpper(), graph_copyData(), graph_dijkLimited_initPcShifts(), graph_edge_add(), graph_edge_addSubgraph(), graph_edge_del(), graph_edge_delPseudoPath(), graph_edge_hide(), graph_edge_printInfo(), graph_edge_redirect(), graph_free(), graph_get4nextTTerms(), graph_getCsr(), graph_init(), graph_initHistory(), graph_knot_contract(), graph_load(), graph_mincut_exec(), graph_path_invroot(), graph_path_st(), graph_path_st_brmwcs(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_extendBiased(), graph_path_st_pcmw_full(), graph_path_st_rpcmw(), graph_pathInLimitedExec(), graph_pc_edgeIsExtended(), graph_pc_evalTermIsNonLeaf(), graph_pc_getNorgEdges(), graph_pc_getRoot2PtermEdge(), graph_pc_getTwinTerm(), graph_pc_subtractPrize(), graph_pc_updateSubgraphEdge(), graph_resize(), graph_show(), graph_subgraphCompleteNewHistory(), graph_tpathsGetProfitNodes(), graph_transGstpClean(), graph_transPcGetRsap(), graph_transPcGetSap(), graph_uncover(), graph_valid(), graph_valid_dcsr(), graph_validInput(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_writeGml(), graph_writeGmlSub(), graph_writeStp(), graph_writeStpOrg(), graphisValidPcMw(), hasAdjacentTerminals(), impliedNodesAddTerm(), initCostsAndPrioLP(), initReceivedSubproblem(), insertionInit(), insertionInitInsert(), insertionReplaceChain(), insertionRestoreTree(), keyNodesSetTerms(), ledgeFromNetgraph(), localKeyVertexHeuristics(), localVertexInsertion(), lpcutAdd(), lurkpruneInit(), markSolTreeNodes(), mst3LeafTreeGetSds(), mstCompLeafGetSDsToSiblings(), mstCompLeafToSiblingsBiasedRuleOut(), mstLevelLeafSetVerticalSDsBoth(), mwGetNchains(), mwKnotUpdateIncEdges(), mwReduceTermDeg1(), nsvEdgeGetTermDists(), nsvEdgeIsValid(), nsvExec(), nsvInitData(), packEdges(), pathExendPrepare(), pcmwGetNewEdgePrize(), pcmwReduceKnotDeg1(), pcReduceTermDeg1(), pricing(), processPath(), propgraphApplyStates(), propgraphDeleteEdge(), propgraphFixEdge(), redcostGraphBuild(), redcostGraphMark(), redcostGraphSolRetransform(), reduce_bound(), reduce_boundHop(), reduce_contract0Edges(), reduce_cutEdgeTryPrune(), reduce_daSlackPrune(), reduce_deleteConflictEdges(), reduce_extendedCheck3Tree(), reduce_impliedProfitBasedRpc(), reduce_nv(), reduce_nvAdv(), reduce_rpt(), reduce_sd(), reduce_sdPc(), reduce_sdprofitUpdateFromBLC(), reduce_sdStar(), reduce_sdStarPc(), reduce_sdStarPc2(), reduce_sdWalk_csr(), reduce_sdWalkTriangle(), reduce_simple_sap(), reduce_sl(), reduce_termcompChangeSubgraphToOrgCosts(), reduceCheckEdge(), reinsertSubgraphTransferEdges(), removeEdge(), replaceEdgeByPath(), reroot(), retransformReducedProbSolution(), ruleOutSubtree(), SCIPprobdataAddNewSol(), SCIPprobdataWriteSolution(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurPruneRun(), SCIPStpHeurRecExclude(), SCIPStpHeurSlackPruneRun(), SCIPStpHeurTMBuildTreePcMw(), sdCliqueStarGetNodeBias(), sdDcExtendTree(), sddeltable(), sdgraphGetSd(), sdgraphMstMarkOrgEdges(), sdprofitBuild(), sdprofitBuild1stOnly(), sdqueryBuildBinaryTree(), sdStarFinalize(), sep_flowEdgeOut(), sepafullReduceFromSols(), sepaspecial_vtimplicationsSeparate(), setNodeList(), setNodeSolArray(), solDegIsValid(), solgraphAddEdges(), solgraphSelectSolsDiff(), solNodeIsValid(), solstp_getOrg(), solstp_isValid(), solstp_pcConnectDummies(), solstp_pruneFromEdges(), solstp_setVertexFromEdge(), solstp_setVertexFromEdgeConn(), soltreeElimKeyPathsStar(), soltreeExchangeKeyPath(), stDcTermIsConnectable(), stp_save(), stPcmwConnectNode(), subSolIsRedundant(), supergraphComputeMst(), tbottleneckInit(), termDeleteExtension(), testDistDistancesAreValid(), testDistRootPathsAreValid(), testEdgeDeletion3_deprecated(), tpathsGetDistNew(), tpathsPrintPath(), tpathsRepair1st(), tpathsRepairTraverse1st(), tpathsRepairTraverseLevelWithStack(), tpathsRepairTraverseStackAddBelow(), tpathsRepairTraverseStackAddEdge(), tpathsRepairUpdate1st(), tpathsRepairUpdateLevel(), tpathsScan1st(), treeGetCounters(), treeResetCounters(), tryPathPcMw(), updateEdgestateFromRed(), updateEdgestateFromRedPcmw(), vnoiComputeImplied(), and vnoiDataRepairPreprocess().

◆ head

int* RESTRICT GRAPH::head

Array [0..edges-1] of node-number of head of edge [i]

Definition at line 224 of file graphdefs.h.

Referenced by ansProcessCandidate(), ansProcessCandidateWithBridge(), ansUnmark(), applyBranchHistoryToGraph(), baseMstGetOrderedParentNodes(), bdkGetCutoffs(), bdkGetEdgeCutoffs(), bdkGetNeighborhood(), bdkTryDegGe4(), bea_save(), blctreeBuildMst(), blctreeComputeBottlenecks(), borderNodesCollect(), bottleneckMarkEqualityPath(), boundPruneHeur(), boundPruneHeurMw(), buildsolgraph(), closeNodesPathIsForbidden(), compUpDistUpdateLeavesDists(), computeDegConsTree(), computeHistory(), computePertubedSol(), computeReducedProbSolutionBiased(), computeSteinerTree(), computeSteinerTreeVnoi(), connectivityDataInit(), connectivityDataKeyElimUpdate(), contractEdgeNoFixedEnd(), contractEdgeWithFixedEnd(), createPrizeConstraints(), createVariables(), cutEdgeProbe(), cutEdgePrune(), cutNodesComputeDfs(), cutNodesGetLastCutnode(), cutNodesTreeBuildSteinerTree(), cutNodesTreeMakeTerms(), cutNodesTreeMakeTermsIsComplete(), dapathsFixPotTerms(), dapathsSortStarts(), dapathsUpdate(), daPcFindRoots(), daRedCostIsValid(), daRpcmwDeleteTermIncidents(), decomposeExactFixSol(), decomposeGetFirstMarked(), deletenodesDeg1(), delPseudoCheckReplacement(), delPseudoDeleteVertex(), delPseudoEdgeDeleteEdge(), delPseudoEdgeGetReplaceEdges(), delPseudoEdgeInit(), delPseudoGetReplaceEdges(), delPseudoInit(), delPseudoInitForCheck(), delPseudoPath(), dfsorder(), distCloseNodesIncluded(), distCloseNodesPrintLostNodeInfo(), distGetRestricted(), distgraphAddEdges(), distgraphAddEdgesFromTpaths(), distgraphInsertEdge(), dualascent_allTermsReachable(), dualascent_execPcMw(), extendSubtreeHead(), extensionHasImplicationConflict(), extLeafRemoveTop(), extPreprocessInitialEdge(), extPreprocessInitialGenStar(), extPreprocessInitialStar(), extProcessInitialComponent(), extractSubgraphAddEdgesWithHistory(), extractSubgraphGetSizeAndMap(), extreduce_bottleneckCheckNonLeaves(), extreduce_bottleneckCheckNonLeaves_pc(), extreduce_bottleneckToSiblingIsDominated(), extreduce_bottleneckWithExtedgeIsDominated(), extreduce_checkArc(), extreduce_checkEdge(), extreduce_edgeIsValid(), extreduce_extCompClean(), extreduce_extCompRevert(), extreduce_mstbiasedCheck3NodeSimple(), extreduce_mstLevelVerticalAddLeaf(), extreduce_mstLevelVerticalAddLeafInitial(), extreduce_nodeIsInStackTop(), extreduce_redcostAddEdge(), extreduce_sdshorizontalInSync(), extreduce_spgCheck3ComponentSimple(), extreduce_spgCheck3NodeSimple(), extStackAddCompsExpanded(), extStackAddCompsExpandedSing(), extStackTopCollectExtEdges(), extStackTopCollectExtEdgesSing(), extStackTopProcessInitialEdges(), extTreeAddEdge(), extTreeFindExtensions(), extTreeRuleOutEdgeSimple(), extTreeRuleOutSingletonFull(), extTreeStackTopRemove(), extTreeStackTopRootRemove(), extTruncate(), findRootsMark(), findSolPcMw1Term(), fixVarsDualcost(), generalStarCheck(), generalStarCheckExit(), generalStarCheckGetNextStar(), generalStarCheckInit(), generalStarSetUp(), getBiasedMw(), getBoundaryPathCost(), getBoundaryPathCostPrized(), getBoundchanges(), getCloseNodeDistanceForbiddenLast(), getCloseNodePath(), getcloseterms2term(), getExtBottleneckDist(), getGraphStatesDirected(), getKeyPathReplaceCost(), getKeyPathsStar(), getKeyPathUpper(), getSd(), getTreeRedcosts_dbg(), graph_copyData(), graph_csr_build(), graph_csr_chgCosts(), graph_edge_add(), graph_edge_addSubgraph(), graph_edge_del(), graph_edge_delPseudo(), graph_edge_delPseudoPath(), graph_edge_hide(), graph_edge_printInfo(), graph_edge_redirect(), graph_free(), graph_get4nextTTerms(), graph_hasMultiEdges(), graph_init(), graph_init_dcsr(), graph_initHistory(), graph_knot_contract(), graph_knot_replaceDeg2(), graph_mincut_exec(), graph_path_exec(), graph_path_execX(), graph_path_PcMwSd(), graph_path_st(), graph_path_st_brmwcs(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_extendBiased(), graph_path_st_pcmw_full(), graph_path_st_pcmw_reduce(), graph_path_st_rpcmw(), graph_pc_contractEdge(), graph_pc_contractNodeAncestors(), graph_pc_deleteTerm(), graph_pc_edgeIsExtended(), graph_pc_getNorgEdges(), graph_pc_getTwinTerm(), graph_pc_markOrgGraph(), graph_pc_subtractPrize(), graph_pc_term2edgeIsConsistent(), graph_pc_transOrgAreConistent(), graph_pc_updateSubgraphEdge(), graph_resize(), graph_sdPaths(), graph_sdWalks(), graph_sdWalksConnected(), graph_sdWalksExt(), graph_sdWalksExt2(), graph_show(), graph_subgraphCompleteNewHistory(), graph_tpathsAdd2nd(), graph_tpathsAdd3rd(), graph_tpathsAdd4th(), graph_transGstpClean(), graph_transPc(), graph_transPcGetRsap(), graph_transPcmw2rooted(), graph_transRmw(), graph_transRpc(), graph_transRpcGetSpg(), graph_uncover(), graph_valid(), graph_valid_dcsr(), graph_validInput(), graph_voronoi(), graph_voronoiExtend(), graph_voronoiMw(), graph_voronoiRepair(), graph_voronoiRepairMult(), graph_voronoiTerms(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), graph_writeGml(), graph_writeGmlSub(), graph_writeStp(), graph_writeStpOrg(), graphisValidPcMw(), hasAdjacentTerminals(), initCostsAndPrioLP(), initReceivedSubproblem(), insertionBlockChain(), insertionGetCandidateEdges(), insertionInit(), insertionInitInsert(), insertionReplaceChain(), insertionRestoreTree(), isPseudoDeletable(), keyNodesSetTerms(), lca(), ledgeFromNetgraph(), localKeyVertexHeuristics(), localVertexInsertion(), lpcutAdd(), lurkpruneInit(), markSolTreeNodes(), mincutFree(), mincutPrepareForLp(), mst3LeafTreeGetSds(), mstCompLeafGetSDs(), mstCompLeafGetSDsToAncestors(), mstCompLeafGetSDsToSiblings(), mstCompLeafToAncestorsBiasedRuleOut(), mstCompLeafToSiblingsBiasedRuleOut(), mstLevelHorizontalAddSds(), mstLevelLeafSetVerticalSDsBoth(), mwContract0WeightVertices(), mwContractNonPositiveChain(), mwContractTerminalsChainWise(), mwContractTerminalsSimple(), mwGetNchains(), mwReduceTermDeg1(), mwTraverseChain(), nsvEdgeGetTermDists(), nsvEdgeIsValid(), nsvExec(), nsvInitData(), packEdges(), packNodes(), pathExendPrepare(), pathGetHead(), pcContractWithAdjacentTerm(), pcmwDeleteNonSolEdges(), pcmwGetNewEdgePrize(), pcmwGetSolRoot(), pcmwReduceTerm0Prize(), pcmwUpdate(), pcReduceKnotDeg2(), pcReduceTermDeg1(), pcReduceTermDeg2(), pcsolGetMstEdges(), pcsolGetTrivialEdges(), pcsubtreeDelete(), pcsubtreePruneForProfit(), processPath(), propgraphDeleteEdge(), propgraphFixEdge(), pruneSteinerTreeStp(), pseudoDelDouble(), pseudodeleteDeleteComputeCutoffs(), pseudodeleteDeleteNode(), pseudodeleteGetNextStar(), redcostGraphBuild(), redcostGraphMark(), redcostGraphSolRetransform(), redcosts_forLPget(), reduce_ans(), reduce_ansAdv(), reduce_ansAdv2(), reduce_applyPseudoDeletions(), reduce_bd34(), reduce_bd34WithSd(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_chain2(), reduce_cnsAdv(), reduce_contract0Edges(), reduce_cutEdgeTryPrune(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_deleteConflictEdges(), reduce_deleteMultiedges(), reduce_extendedCheck3Tree(), reduce_getSdByPaths(), reduce_impliedNodesIsValid(), reduce_impliedProfitBasedRpc(), reduce_nnp(), reduce_nodesDeg1(), reduce_npv(), reduce_nv(), reduce_nvAdv(), reduce_rpt(), reduce_sd(), reduce_sdBiased(), reduce_sdBiasedNeighbor(), reduce_sdEdgeCliqueStar(), reduce_sdImpLongEdge(), reduce_sdPc(), reduce_sdprofitUpdateFromBLC(), reduce_sdsp(), reduce_sdspSap(), reduce_sdStar(), reduce_sdStarPc(), reduce_sdStarPc2(), reduce_sdWalk(), reduce_sdWalk_csr(), reduce_sdWalkExt(), reduce_sdWalkExt2(), reduce_sdWalkTriangle(), reduce_simple(), reduce_simple_dc(), reduce_simple_mw(), reduce_simple_sap(), reduce_sl(), reduce_termcompChangeSubgraphToBottleneck(), reduce_termcompChangeSubgraphToOrgCosts(), reduce_unconnectedRpcRmwInfeas(), reduceCheckEdge(), reducePcMw(), reduceRootedProb(), reduceWithEdgeFixingBounds(), reinsertSubgraphDeleteOldEdges(), reinsertSubgraphTransferEdges(), removeEdge(), replaceEdgeByPath(), reroot(), retransformReducedProbSolution(), ruleOutSubtree(), SCIPprobdataAddNewSol(), SCIPprobdataWriteSolution(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurPruneRun(), SCIPStpHeurRecExclude(), SCIPStpHeurSlackPruneRun(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMRunLP(), sdCliqueStarComputeSds(), sdCliqueStarGetNodeBias(), sdCliqueUpdateGraphWithStarWalks(), sdDcExtendTree(), sddeltable(), sdGetSdPcMw(), sdgraphGetSd(), sdgraphMstMarkOrgEdges(), sdgraphUpdateDistgraphFromTpaths(), sdneighborUpdateExec(), sdqueryBuildBinaryTree(), sdStarFinalize(), sep_flowEdgeOut(), sepafullAddSingleSolcandEdges(), sepafullReduceFromSols(), sepaspecial_vtimplicationsInit(), setNodeList(), setNodeSolArray(), solDegIsValid(), solgraphAdaptForDCSTP(), solgraphAdaptForPcMw(), solgraphAddEdges(), solgraphSelectSolsDiff(), solIsTrivialPcMw(), solNodeIsValid(), solstp_getOrg(), solstp_isValid(), solstp_pcGetSolRoot(), solstp_pruneFromEdges(), solstp_setVertexFromEdge(), solstp_setVertexFromEdgeConn(), soltreeElimKeyPathsStar(), soltreeExchangeKeyPath(), spg3StarNeighborRuleOut(), stp_save(), subgraphBuild(), subgraphIdentify(), subSolIsRedundant(), supergraphComputeMst(), tbottleneckInit(), termcompDeleteEdges(), termDeleteExtension(), termsepaBuildRootcomp(), termsepaCsrAddEdges(), termsepaCsrAddTermCopies(), termsepaCutIsCorrect(), termsepaTraverseSinkComp(), testDistDistancesAreValid(), testDistRootPathsAreValid(), testEdgeDeletion2_deprecated(), testEdgeDeletion3_deprecated(), testEdgeDeletion4_deprecated(), testEdgeDeletion5_deprecated(), testSdGetterReturnsCorrectSds(), tpathsGetDistNew(), tpathsRepair1st(), tpathsRepairTraverse1st(), tpathsRepairTraverseLevelWithStack(), tpathsRepairTraverseStackAddBelow(), tpathsRepairTraverseStackAddEdge(), tpathsScan1st(), tpathsScan2nd(), tpathsScan3rd(), tpathsScan4th(), trail(), trail_old(), trailGraphWithStates(), treeDegreesAreFlawed(), treeGetCounters(), treeInnerNodesAreFlawed(), treeLeavesAreFlawed(), treeResetCounters(), updateEdgeFixingBounds(), updateEdgeLurkingBounds(), updateEdgestateFromRed(), updateEdgestateFromRedPcmw(), updateNodeReplaceBounds(), updateTerminalSource(), vnoiCompute(), and vnoiComputeImplied().

◆ orgtail

int* RESTRICT GRAPH::orgtail

Array [0..edges-1] of node-number of tail of edge [i] prior to reduction

Definition at line 225 of file graphdefs.h.

Referenced by computeHistory(), computeHistoryPcMw(), graph_freeHistoryDeep(), graph_init(), graph_initHistory(), graph_isSetUp(), graph_pack(), graph_subgraphCompleteNewHistory(), graph_subgraphReinsert(), marksolverts(), retransformReducedProbSolution(), SCIPprobdataWriteSolution(), SCIPStpHeurRecExclude(), and updateorgsol().

◆ orghead

int* RESTRICT GRAPH::orghead

Array [0..edges-1] of node-number of head of edge [i] prior to reduction

Definition at line 226 of file graphdefs.h.

Referenced by computeHistory(), computeHistoryPcMw(), graph_freeHistoryDeep(), graph_init(), graph_initHistory(), graph_pack(), graph_subgraphCompleteNewHistory(), graph_subgraphReinsert(), marksolverts(), retransformReducedProbSolution(), SCIPprobdataWriteSolution(), SCIPStpHeurRecExclude(), and updateorgsol().

◆ rootedgeprevs

int* RESTRICT GRAPH::rootedgeprevs

Array [0..edges-1] for PC and MW problems

Definition at line 227 of file graphdefs.h.

Referenced by graph_free(), graph_init(), graph_pc_presolExit(), graph_pc_presolInit(), graph_transPcmw2rooted(), and removeEdge().

◆ ieat

int* RESTRICT GRAPH::ieat

Array [0..edges-1], incoming edge allocation table

Definition at line 230 of file graphdefs.h.

Referenced by bea_save(), branchOnVertex(), createPrizeConstraints(), createVariables(), daInit(), dapathsSetRunParams(), daPcMarkRoots(), dualascent_execPcMw(), extendSubtreeTail(), findRootsMark(), fixVarsDualcost(), get_inflow(), getBiasedMw(), getBiasedPc(), getKeyPathsStar(), graph_copyData(), graph_copyPseudoAncestors(), graph_dijkLimited_initPcShifts(), graph_edge_add(), graph_edge_del(), graph_edge_hide(), graph_edge_redirect(), graph_free(), graph_getCsr(), graph_init(), graph_knot_contract(), graph_load(), graph_pack(), graph_path_invroot(), graph_pathInLimitedExec(), graph_pc_enforceNonLeafTerm(), graph_pc_evalTermIsNonLeaf(), graph_pc_getRoot2PtermEdge(), graph_pc_knotIsFixedTerm(), graph_pc_nonTermToFixedTerm(), graph_pc_presolInit(), graph_pc_shiftNonLeafCosts(), graph_resize(), graph_show(), graph_transMw(), graph_transNw2sap(), graph_transPcGetSap(), graph_transRmw(), graph_uncover(), graph_valid(), graph_validInput(), graph_writeStp(), graphisValidPcMw(), impliedNodesAddTerm(), initReceivedSubproblem(), isNonLeaf_pretransPc(), mincut_separateLp(), mwContractNonPositiveChain(), mwKnotUpdateIncEdges(), mwReduceTermDeg1(), packEdges(), packPseudoAncestors(), pcmwReduceKnotDeg1(), pcsolPrune(), pruneSteinerTreeStp(), reduce_boundHopRc(), reduce_daSlackPrune(), reduce_extendedCheck3Tree(), reduce_rpt(), reduce_simple(), reduce_simple_hc(), reduce_simple_sap(), reduceCheckEdge(), removeEdge(), reroot(), ruleOutSubtree(), SCIPprobdataAddNewSol(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), sddeltable(), sdprofitBuild(), sdprofitBuild1stOnly(), selectBranchingVertexByLp(), selectBranchingVertexByLp2Flow(), sep_flow(), sep_flowBalance(), sep_flowEdgeOut(), sep_flowIn(), sep_flowTermIn(), sepaspecial_pcimplicationsSeparate(), sepaspecial_vtimplicationsSeparate(), shortestpath_pcInit(), solstp_isValid(), solstp_pcConnectDummies(), stp_save(), stpsol_pruningIsPossible(), tpathsRepairUpdate1st(), tpathsRepairUpdateLevel(), updateEdgestateFromRed(), updateEdgestateFromRedPcmw(), and vnoiDataRepairPreprocess().

◆ oeat

int* RESTRICT GRAPH::oeat

Array [0..edges-1], outgoing edge allocation table

Definition at line 231 of file graphdefs.h.

Referenced by ansProcessCandidate(), ansProcessCandidateWithBridge(), ansUnmark(), applyBranchHistoryToGraph(), applyLastVertexBranch(), bdkGetCutoffs(), bdkGetEdgeCutoffs(), bdkGetNeighborhood(), bdkNodeIsInvalid(), bea_save(), blctreeComputeBottlenecks(), borderNodesCollect(), bottleneckMarkEqualityPath(), boundPruneHeur(), boundPruneHeurMw(), buildsolgraph(), closeNodesRunExit(), computeDegConsTree(), computeHistory(), computePertubedSol(), computeSteinerTreeVnoi(), computeTransVoronoi(), connectivityDataInit(), createPrizeConstraints(), createVariables(), cutEdgeProbe(), cutEdgePrune(), cutNodesComputeDfs(), cutNodesGetLastCutnode(), cutNodesTreeBuildSteinerTree(), cutNodesTreeMakeTerms(), cutNodesTreeMakeTermsIsComplete(), dapathsFixPotTerms(), dapathsSortStarts(), dapathsUpdate(), daPcFindRoots(), daRedCostIsValid(), daRpcmwDeleteTermIncidents(), decomposeGetFirstMarked(), delPseudoCheckReplacement(), delPseudoEdgeGetReplaceEdges(), delPseudoGetReplaceEdges(), delPseudoInit(), delPseudoInitForCheck(), delPseudoPath(), dfsorder(), distDataPathRootsInitialize(), distGetRestricted(), distgraphAddEdges(), distgraphAddEdgesFromTpaths(), distgraphInsertEdge(), dualascent_allTermsReachable(), dualascent_execDegCons(), dualascent_execPcMw(), extendSubtreeHead(), extractSubgraphAddEdgesWithHistory(), extractSubgraphGetSizeAndMap(), extreduce_edgeIsValid(), extreduce_mstbiasedCheck3NodeSimple(), extreduce_spgCheck3NodeSimple(), extStackTopCollectExtEdges(), extTreeFindExtensions(), findSolPcMw1Term(), fixVarsDualcost(), generalStarSetUp(), getBiasedMw(), getcloseterms2term(), getHighSolDegVertex(), getKeyPathsStar(), getKeyPathUpper(), getRedCost2ndNextDistances(), getSd(), getTreeRedcosts_dbg(), graph_copyData(), graph_csr_build(), graph_csr_chgCosts(), graph_edge_add(), graph_edge_del(), graph_edge_hide(), graph_edge_isDeleted(), graph_edge_redirect(), graph_free(), graph_get4nextTTerms(), graph_hasMultiEdges(), graph_init(), graph_init_dcsr(), graph_isAlmostUniform(), graph_knot_contract(), graph_knot_replaceDeg2(), graph_knotIsNWLeaf(), graph_load(), graph_mincut_exec(), graph_pack(), graph_path_exec(), graph_path_execX(), graph_path_PcMwSd(), graph_path_st(), graph_path_st_brmwcs(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_extendBiased(), graph_path_st_pcmw_full(), graph_path_st_pcmw_reduce(), graph_path_st_rpcmw(), graph_pc_adaptSap(), graph_pc_contractEdge(), graph_pc_contractNodeAncestors(), graph_pc_getNorgEdges(), graph_pc_markOrgGraph(), graph_pc_presolInit(), graph_pc_shiftNonLeafCosts(), graph_pc_term2edgeIsConsistent(), graph_pc_transOrgAreConistent(), graph_resize(), graph_sdPaths(), graph_sdWalks(), graph_sdWalksConnected(), graph_sdWalksExt(), graph_sdWalksExt2(), graph_show(), graph_tpathsAdd2nd(), graph_tpathsAdd3rd(), graph_tpathsAdd4th(), graph_transPcGetRsap(), graph_transPcmw2rooted(), graph_transRpcGetSpg(), graph_uncover(), graph_valid(), graph_valid_ancestors(), graph_validInput(), graph_voronoi(), graph_voronoiExtend(), graph_voronoiMw(), graph_voronoiRepair(), graph_voronoiRepairMult(), graph_voronoiTerms(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), graph_writeGml(), graph_writeGmlSub(), graph_writeStp(), graphisValidPcMw(), hasAdjacentTerminals(), initCostsAndPrioLP(), initPropAtFirstCall(), insertionGetCandidateEdges(), isPseudoDeletable(), lca(), ledgeFromNetgraph(), mincutFree(), mincutPrepareForLp(), mwContract0WeightVertices(), mwContractNonPositiveChain(), mwContractTerminalsChainWise(), mwContractTerminalsSimple(), mwGetNchains(), mwReduceTermDeg1(), mwTraverseChain(), nodeIsCrucial(), packEdges(), packNodes(), pathreplaceExec(), pcContractWithAdjacentTerm(), pcmwDeleteNonSolEdges(), pcmwGetSolRoot(), pcmwReduceKnotDeg1(), pcmwReduceTerm0Prize(), pcmwUpdate(), pcReduceKnotDeg2(), pcReduceTermDeg1(), pcReduceTermDeg2(), pcsolGetTrivialEdges(), pcsolPrune(), pcsubtreeDelete(), pcsubtreePruneForProfit(), poolSolIsUnreduced(), pruneSteinerTreeStp(), pseudoDelDouble(), pseudodeleteDeleteComputeCutoffs(), pseudodeleteDeleteNode(), redcostGraphBuild(), redcostGraphMark(), redcosts_initializeDistances(), reduce_ans(), reduce_ansAdv(), reduce_ansAdv2(), reduce_applyPseudoDeletions(), reduce_bd34(), reduce_bd34WithSd(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_chain2(), reduce_cnsAdv(), reduce_contract0Edges(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_deleteConflictEdges(), reduce_deleteMultiedges(), reduce_extendedCheck3Tree(), reduce_extendedEdge(), reduce_fixedConflicts(), reduce_getSdByPaths(), reduce_impliedNodesIsValid(), reduce_impliedProfitBasedRpc(), reduce_nnp(), reduce_npv(), reduce_nv(), reduce_nvAdv(), reduce_rpt(), reduce_sd(), reduce_sdBiased(), reduce_sdBiasedNeighbor(), reduce_sdEdgeCliqueStar(), reduce_sdImpLongEdge(), reduce_sdPc(), reduce_sdsp(), reduce_sdspSap(), reduce_sdStar(), reduce_sdStarPc(), reduce_sdStarPc2(), reduce_sdWalk(), reduce_sdWalk_csr(), reduce_sdWalkExt(), reduce_sdWalkExt2(), reduce_sdWalkTriangle(), reduce_simple(), reduce_simple_dc(), reduce_simple_hc(), reduce_simple_mw(), reduce_simple_sap(), reduce_sl(), reduce_starReset(), reduce_termcompChangeSubgraphToBottleneck(), reduce_termcompChangeSubgraphToOrgCosts(), reduce_unconnectedRpcRmwInfeas(), reduceCheckEdge(), reducePcMw(), reduceRootedProb(), reduceWithEdgeFixingBounds(), reinsertSubgraphDeleteOldEdges(), reinsertSubgraphTransferEdges(), removeEdge(), reroot(), ruleOutSubtree(), SCIPStpHeurRecExclude(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpValidateSol(), sdCliqueStarComputeSds(), sdCliqueStarGetNodeBias(), sdCliqueUpdateGraphWithStarWalks(), sdDcExtendTree(), sddeltable(), sdGetSdPcMw(), sdgraphUpdateDistgraphFromTpaths(), sdneighborUpdateExec(), sdStarFinalize(), sep_flowBalance(), sep_flowEdgeOut(), sepafullAddSingleSolcandEdges(), sepaspecial_vtimplicationsInit(), solgraphAdaptForDCSTP(), solgraphAddEdges(), solIsTrivialPcMw(), solstp_containsNode(), solstp_isUnreduced(), solstp_isValid(), solstp_pcGetSolRoot(), solstp_setVertexFromEdge(), solstp_setVertexFromEdgeConn(), soltreeElimKeyPathsStar(), soltreeExchangeKeyPath(), spg3StarNeighborRuleOut(), stp_save(), stpsol_pruningIsPossible(), subgraphBuild(), subgraphIdentify(), termcompDeleteEdges(), termsepaBuildRootcomp(), termsepaCsrAddEdges(), termsepaCsrAddTermCopies(), termsepaCutIsCorrect(), termsepaTraverseSinkComp(), testEdgeDeletion2_deprecated(), testEdgeDeletion4_deprecated(), testEdgeDeletion5_deprecated(), testRmwAnsDeletesOneEdge(), testSdBiasedBottleneckDeletesEdge(), testSdBiasedBottleneckTermPathDeletesEdge(), testSdBiasedDeletesEdge(), testSdCliqueStarDeletesEdge(), testSdGetterReturnsCorrectSds(), testSdStarBiasedDeletesEdge(), testSdStarBiasedDeletesEdge2(), testSdStarBiasedDeletesEdge3(), testSdStarPcKillsEdge(), tpathsRepairTraverse1st(), tpathsRepairTraverseLevelWithStack(), tpathsRepairTraverseStackAddBelow(), tpathsScan1st(), tpathsScan2nd(), tpathsScan3rd(), tpathsScan4th(), trail(), trail_old(), trailGraphWithStates(), updateEdgeFixingBounds(), updateEdgeLurkingBounds(), updateNodeReplaceBounds(), updateTerminalSource(), vnoiCompute(), and vnoiComputeImplied().

◆ ancestors

IDX** GRAPH::ancestors

list of ancestor edges to each edge (to keep track of reductions)

Definition at line 234 of file graphdefs.h.

Referenced by ancestorsMarkConflict(), ancestorsUnmarkConflict(), computeHistory(), computeHistoryPcMw(), delPseudoPath(), extractSubgraphAddEdge(), extractSubgraphInitHistory(), graph_edge_del(), graph_edge_delHistory(), graph_edge_getAncestors(), graph_edge_reinsert(), graph_fixed_addEdge(), graph_fixed_addNodePc(), graph_freeHistory(), graph_init(), graph_initAncestors(), graph_initHistory(), graph_isSetUp(), graph_knot_contract(), graph_knot_replaceDeg2(), graph_pack(), graph_printEdgeConflicts(), graph_singletonAncestors_init(), graph_valid_ancestors(), initReceivedSubproblem(), mwTraverseChain(), packEdges(), reduce_deleteConflictEdges(), reduce_simple_sap(), reduceLurk(), solstp_getOrg(), updateEdgestateFromRed(), and updateEdgestateFromRedPcmw().

◆ pcancestors

IDX** GRAPH::pcancestors

list of ancestor edges to each node (to keep track of PC/MW reductions )

Definition at line 235 of file graphdefs.h.

Referenced by computeHistoryPcMw(), delPseudoInit(), delPseudoInitForCheck(), graph_edge_reinsert(), graph_fixed_addNodePc(), graph_fixed_moveNodePc(), graph_freeHistoryDeep(), graph_init(), graph_initHistory(), graph_knot_replaceDeg2(), graph_pack(), graph_pc_contractNodeAncestors(), graph_printEdgeConflicts(), reduce_contract0Edges(), retransformReducedProbSolution(), SCIPprobdataWriteSolution(), SCIPStpHeurRecExclude(), solstp_getOrg(), updateEdgestateFromRed(), and updateEdgestateFromRedPcmw().

◆ pseudoancestors

PSEUDOANS* GRAPH::pseudoancestors

pseudo ancestors

Definition at line 236 of file graphdefs.h.

◆ fixedcomponents

FIXED* GRAPH::fixedcomponents

fixed components

Definition at line 237 of file graphdefs.h.

Referenced by graph_copyFixed(), graph_fixed_add(), graph_fixed_resetMoved(), graph_free_fixed(), graph_free_fixedEdgesOnly(), graph_freeHistoryDeep(), graph_getFixedges(), graph_getFixpseudonodes(), graph_getNfixpseudonodes(), graph_init(), graph_init_fixed(), graph_pack(), graph_subgraphCompleteNewHistory(), graph_subgraphReinsert(), and reinsertSubgraphTransferFixedHistory().

◆ contracttrace

int* GRAPH::contracttrace

used to trace node contractions

Definition at line 238 of file graphdefs.h.

Referenced by graph_contractTrace(), graph_freeHistory(), graph_init(), graph_initContractTracing(), graph_knot_contract(), graph_knot_hasContractTrace(), and reinsertSubgraphTransferTerminals().

◆ mincut_nnodes

int GRAPH::mincut_nnodes

Definition at line 241 of file graphdefs.h.

Referenced by graph_init(), graph_mincut_exit(), graph_mincut_isInitialized(), graph_mincut_setDefaultVals(), and mincutInit().

◆ mincut_nedges

int GRAPH::mincut_nedges

Definition at line 242 of file graphdefs.h.

Referenced by graph_init(), graph_mincut_exit(), and mincutInit().

◆ mincut_dist

int* RESTRICT GRAPH::mincut_dist

dist[i] : Distance-label of node i

Definition at line 243 of file graphdefs.h.

Referenced by graph_init(), graph_mincut_exec(), graph_mincut_exit(), graph_mincut_isInitialized(), mincutGetNextSinkTerm(), and mincutInit().

◆ mincut_head

int* RESTRICT GRAPH::mincut_head

head[i] : Head of active queue with label i

Definition at line 244 of file graphdefs.h.

Referenced by graph_init(), graph_mincut_exec(), graph_mincut_exit(), graph_mincut_isInitialized(), graph_mincut_setDefaultVals(), and mincutInit().

◆ mincut_head_inact

int* RESTRICT GRAPH::mincut_head_inact

head[i] : Head of inactive queue with label i

Definition at line 245 of file graphdefs.h.

Referenced by graph_mincut_exec(), graph_mincut_exit(), graph_mincut_setDefaultVals(), and mincutInit().

◆ mincut_numb

int* RESTRICT GRAPH::mincut_numb

numb[i] : numb[i] nodes with label i

Definition at line 246 of file graphdefs.h.

Referenced by graph_init(), graph_mincut_exec(), graph_mincut_exit(), graph_mincut_isInitialized(), mincutInit(), mincutPrepareForLp(), and termsepaCsrAddEdges().

◆ mincut_prev

int* RESTRICT GRAPH::mincut_prev

Definition at line 247 of file graphdefs.h.

Referenced by graph_init(), graph_mincut_exec(), graph_mincut_exit(), graph_mincut_isInitialized(), and mincutInit().

◆ mincut_next

int* RESTRICT GRAPH::mincut_next

Definition at line 248 of file graphdefs.h.

Referenced by graph_init(), graph_mincut_exec(), graph_mincut_exit(), graph_mincut_isInitialized(), and mincutInit().

◆ mincut_temp

int* RESTRICT GRAPH::mincut_temp

Definition at line 249 of file graphdefs.h.

Referenced by graph_init(), graph_mincut_exec(), graph_mincut_exit(), graph_mincut_isInitialized(), and mincutInit().

◆ mincut_e

int* RESTRICT GRAPH::mincut_e

e[i] : Excess of node i

Definition at line 250 of file graphdefs.h.

Referenced by graph_init(), graph_mincut_exec(), graph_mincut_exit(), graph_mincut_isInitialized(), graph_mincut_setDefaultVals(), mincutInit(), mincutPrepareForLp(), and termsepaCsrAddTermCopies().

◆ mincut_x

int* RESTRICT GRAPH::mincut_x

x[k] : Actual flow on arc k

Definition at line 251 of file graphdefs.h.

Referenced by graph_init(), graph_mincut_exec(), and graph_mincut_isInitialized().

◆ mincut_r

int* RESTRICT GRAPH::mincut_r

r[k] : residual capacity of arc k

Definition at line 252 of file graphdefs.h.

Referenced by csrFlipedgesAreValid(), graph_init(), graph_mincut_exec(), graph_mincut_exit(), graph_mincut_isInitialized(), mincutInit(), mincutPrepareForLp(), and termsepaCsrAddEdges().

◆ path_heap

int* RESTRICT GRAPH::path_heap

Definition at line 255 of file graphdefs.h.

Referenced by computeSteinerTreeVnoi(), findRootsMark(), graph_freeHistoryDeep(), graph_init(), graph_pack(), graph_path_exec(), graph_path_execX(), graph_path_exists(), graph_path_exit(), graph_path_init(), graph_path_invroot(), graph_path_st(), graph_path_st_brmwcs(), graph_path_st_dc(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_extendBiased(), graph_path_st_pcmw_full(), graph_path_st_rpcmw(), graph_sdWalksConnected(), graph_tpathsAdd1st(), graph_tpathsAdd2nd(), graph_tpathsAdd3rd(), graph_tpathsAdd4th(), graph_voronoi(), graph_voronoiExtend(), graph_voronoiRepair(), graph_voronoiRepairMult(), graph_voronoiTerms(), graph_voronoiWithDist(), sdDcExtendTree(), sdgraphMstBuild(), sepaspecial_pcimplicationsInit(), stPcmwConnectNode(), tpathsRepairUpdate1st(), tpathsRepairUpdateLevel(), tpathsScan1st(), tpathsScan2nd(), tpathsScan3rd(), tpathsScan4th(), and vnoiDataRepairPreprocess().

◆ path_state

int* RESTRICT GRAPH::path_state

Definition at line 256 of file graphdefs.h.

Referenced by boundPruneHeur(), computeSteinerTreeVnoi(), computeTransVoronoi(), connectivityDataInit(), daPcFindRoots(), findRootsMark(), graph_freeHistoryDeep(), graph_init(), graph_path_exec(), graph_path_execX(), graph_path_exists(), graph_path_exit(), graph_path_init(), graph_path_invroot(), graph_path_st(), graph_path_st_brmwcs(), graph_path_st_dc(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_extendBiased(), graph_path_st_pcmw_full(), graph_path_st_rpcmw(), graph_sdWalksConnected(), graph_voronoi(), graph_voronoiExtend(), graph_voronoiRepair(), graph_voronoiRepairMult(), graph_voronoiTerms(), graph_voronoiWithDist(), ledgeFromNetgraph(), localKeyVertexHeuristics(), pcsolGetMstEdges(), pcsolPrune(), pruneSteinerTreePc(), reduce_bound(), reduce_boundHop(), SCIPStpHeurTMBuildTreePcMw(), sdDcExtendTree(), sepaspecial_pcimplicationsInit(), stPcmwConnectNode(), stPcmwInit(), and stRpcmwInit().

◆ grid_dim

int GRAPH::grid_dim

Definition at line 259 of file graphdefs.h.

Referenced by graph_copyData(), graph_free(), graph_grid_create(), graph_init(), graph_obstgrid_create(), graph_pack(), and SCIPprobdataWriteSolution().

◆ grid_ncoords

int* GRAPH::grid_ncoords

Definition at line 260 of file graphdefs.h.

Referenced by graph_copyData(), graph_free(), graph_grid_create(), graph_init(), graph_obstgrid_create(), graph_pack(), and SCIPprobdataWriteSolution().

◆ grid_coordinates

int** GRAPH::grid_coordinates

Definition at line 261 of file graphdefs.h.

Referenced by graph_copyData(), graph_free(), graph_grid_create(), graph_init(), graph_obstgrid_create(), graph_pack(), and SCIPprobdataWriteSolution().

◆ stp_type

int GRAPH::stp_type

Steiner problem variant

Definition at line 264 of file graphdefs.h.

◆ is_packed

SCIP_Bool GRAPH::is_packed

graph already packed?

Definition at line 265 of file graphdefs.h.

Referenced by graph_copyData(), graph_init(), graph_pack(), reduce_fixedConflicts(), and substpsolver_getObjFromGraph().

◆ withInexactReductions

SCIP_Bool GRAPH::withInexactReductions

Definition at line 266 of file graphdefs.h.

Referenced by graph_copyData(), graph_fixed_add(), graph_init(), graph_subgraphExtract(), graph_valid_ancestors(), and SCIPStpHeurPruneRun().

◆ extended

SCIP_Bool GRAPH::extended

For (R)PCSTP and (R)MWCSP: signifies whether problem is in extended form (TRUE) or not (FALSE)

Definition at line 267 of file graphdefs.h.

Referenced by applyBranchHistoryToGraph(), applyEdgestateToProb(), blctreeBuildMst(), boundPruneHeurMw(), buildsolgraph(), collectFixedTerminals(), computeReducedProbSolutionBiased(), computeSteinerTree(), computeSteinerTree_execPcMw(), computeSteinerTree_execPcMwFull(), computeSteinerTree_execRpcMw(), computeSteinerTreeTM(), contractEdgeWithFixedEnd(), createVariables(), cutNodesSetDfsRoot(), dapathsFixPotTerms(), daPcFindRoots(), daPcMarkRoots(), extInit(), extreduce_checkArc(), extreduce_checkEdge(), extreduce_distDataInit(), extreduce_init(), extreduce_pseudoDeleteNodes(), findRootsMark(), findSolPcMw2Term(), fixVarsRedbased(), getBiasedMw(), getBoundchanges(), getBoundchangesPcMW(), getEdgeCostUnbiased(), getGraphStatesDirected(), getReductionRatiosPcMw(), graph_copyData(), graph_dijkLimited_initPcShifts(), graph_edge_addSubgraph(), graph_getIsTermArray(), graph_init(), graph_init_dcsr(), graph_isMarked(), graph_mark(), graph_pack(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_extendBiased(), graph_path_st_pcmw_extendOut(), graph_path_st_pcmw_full(), graph_path_st_rpcmw(), graph_pc_2org(), graph_pc_2orgcheck(), graph_pc_2trans(), graph_pc_2transcheck(), graph_pc_contractEdge(), graph_pc_deleteTerm(), graph_pc_enforceNode(), graph_pc_enforceNonLeafTerm(), graph_pc_evalTermIsNonLeaf(), graph_pc_finalizeSubgraph(), graph_pc_getBiased(), graph_pc_getOrgCosts(), graph_pc_getOrgCostsCsr(), graph_pc_getPosPrizeSum(), graph_pc_getReductionRatios(), graph_pc_knotIsDummyTerm(), graph_pc_knotIsPropPotTerm(), graph_pc_knotToFixedTerm(), graph_pc_markOrgGraph(), graph_pc_nonLeafTermIsEnforced(), graph_pc_nProperPotentialTerms(), graph_pc_realDegree(), graph_pc_shiftNonLeafCosts(), graph_pc_solGetObj(), graph_pc_subtractPrize(), graph_pc_term2edgeIsConsistent(), graph_pc_termIsNonLeafTerm(), graph_pc_termMarkProper(), graph_pc_termToNonLeafTerm(), graph_pc_termToNonTerm(), graph_pc_transOrgAreConistent(), graph_pc_updateSubgraphEdge(), graph_printEdgeConflicts(), graph_printInfo(), graph_printInfoReduced(), graph_sdCloseNodesBiased(), graph_sdStar(), graph_sdStarBiased(), graph_sdWalks(), graph_sdWalks_csr(), graph_sdWalksConnected(), graph_sdWalksExt(), graph_sdWalksExt2(), graph_sdWalksTriangle(), graph_transPc(), graph_transPc2Spg(), graph_transPcGetSap(), graph_transPcmw2rooted(), graph_transRmw(), graph_transRpc(), graph_transRpc2FixedProper(), graph_transRpcGetSpg(), graph_voronoiWithRadius(), graph_writeStp(), graphisValidPcMw(), initCostOrgPc(), initCostsAndPrioLP(), isLastTerm(), localKeyVertexHeuristics(), localRun(), markNonLeafTerms_2trans(), pcBiasCostsDCSR(), pcmwGetStartNodes(), pcmwReduceTerm0Prize(), pcmwUpdate(), pcsolMarkGraphNodes(), pcsolMarkGraphNodes_csr(), propgraphApplyImplicationsPcMw(), propgraphDeleteEdge(), propgraphDeleteNode(), propgraphFixEdge(), propgraphFixNode(), propgraphMarkFixedTermsPcMw(), pruneSteinerTreePc(), pruneSteinerTreePc_csr(), pseudodeleteNodeIsPromising(), redcostGraphBuild(), redcosts_initializeDistances(), reduce_applyPseudoDeletions(), reduce_bd34(), reduce_bound(), reduce_boundPruneHeur(), reduce_da(), reduce_dapaths(), reduce_daSlackPrune(), reduce_deleteConflictEdges(), reduce_extendedEdge(), reduce_identifyNonLeafTerms(), reduce_impliedNodesGet(), reduce_impliedNodesRepair(), reduce_nvAdv(), reduce_removeDeg0NonLeafTerms(), reduce_sdPc(), reduce_sdsp(), reduce_sdStar(), reduce_sdStarPc(), reduce_sdStarPc2(), reduce_sdWalk(), reduce_sdWalk_csr(), reduce_sdWalkExt(), reduce_sdWalkExt2(), reduce_sdWalkTriangle(), reduce_simple_pc(), reduce_sollocalRebuildTry(), reduce_unconnectedRpcRmwInfeas(), reduceCheckEdge(), reduceRootedProb(), reduceWithEdgeFixingBounds(), reduceWithNodeFixingBounds(), runTmPcMW_mode(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalExtendPcMwImp(), SCIPStpHeurLocalExtendPcMwOut(), SCIPStpHeurLurkPruneRun(), SCIPStpHeurPruneRun(), SCIPStpHeurRecExclude(), SCIPStpHeurTMBuildTreePcMw(), sdprofitBuild(), sdprofitBuild1stOnly(), sdStarInit(), selectBranchingVertexByDegree(), selectBranchingVertexBySol(), sepaspecial_pcimplicationsInit(), sepaspecial_pcimplicationsSeparate(), setCostToOrgPc(), setCostToOrgPcPreState(), shortestpath_computeSteinerTreePcMw(), shortestpath_computeSteinerTreePcMwFull(), shortestpath_computeSteinerTreeRpcMw(), shortestpath_pcInit(), solgraphAdaptForPcMw(), solIsTrivialPcMw(), solstp_getObjBounded(), solstp_isValid(), solstp_pcGetObjCsr(), solstp_prune(), strongPruneSteinerTreePc(), strongPruneSteinerTreePc_csr(), termDeleteExtension(), updateEdgeFixingBounds(), updateEdgestateFromRed(), updateNodeFixingBounds(), and updateNodeReplaceBounds().

◆ csr_storage

CSR* GRAPH::csr_storage

CSR structure or NULL

Definition at line 270 of file graphdefs.h.

Referenced by borderBuildCharDists(), computeOrderingFromNode(), graph_copyData(), graph_edge_delFull(), graph_free(), graph_free_csr(), graph_init(), graph_init_csr(), graph_init_csrWithEdgeId(), graph_path_st_pcmw_extendOut(), graph_valid_csr(), initSolve(), propagateUBs(), subtreesExtend(), subtreesRemoveNonValids(), and updateBorder().

◆ dcsr_storage

DCSR* GRAPH::dcsr_storage

SCIP

Detailed Description

Data Fields

Field Documentation

◆ norgmodelknots

◆ norgmodelterms

◆ ksize

◆ knots

◆ orgknots

◆ terms

◆ layers

◆ orgsource

◆ source

◆ term

◆ mark

◆ grad

◆ inpbeg

◆ outbeg

◆ maxdeg

◆ term2edge

◆ prize

◆ costbudget

◆ budget

◆ norgmodeledges

◆ hoplimit

◆ esize

◆ edges

◆ orgedges

◆ cost

◆ cost_org_pc

◆ tail

◆ head

◆ orgtail

◆ orghead

◆ rootedgeprevs

◆ ieat

◆ oeat

◆ ancestors

◆ pcancestors

◆ pseudoancestors

◆ fixedcomponents

◆ contracttrace

◆ mincut_nnodes

◆ mincut_nedges

◆ mincut_dist

◆ mincut_head

◆ mincut_head_inact

◆ mincut_numb

◆ mincut_prev

◆ mincut_next

◆ mincut_temp

◆ mincut_e

◆ mincut_x

◆ mincut_r

◆ path_heap

◆ path_state

◆ grid_dim

◆ grid_ncoords

◆ grid_coordinates

◆ stp_type

◆ is_packed

◆ withInexactReductions

◆ extended

◆ csr_storage

◆ dcsr_storage