Scippy

SCIP

Solving Constraint Integer Programs

Data Structures | Macros | Typedefs | Enumerations
graphdefs.h File Reference

Detailed Description

includes graph definitions used for Steiner tree problems

Author
Thorsten Koch
Daniel Rehfeldt

Definition in file graphdefs.h.

#include "scip/scip.h"
#include "misc_stp.h"
#include "portab.h"

Go to the source code of this file.

Data Structures

struct  csr_storage
 
struct  csr_range
 
struct  dynamic_csr_storage
 
struct  singleton_ancestors_edge
 
struct  GRAPH
 
struct  presolve_info
 
struct  shortest_path
 
struct  dijkstra_heap_entry
 
struct  dijkstra_heap
 
struct  dijkstra_data
 
struct  voronoi_storage
 
struct  special_distance_clique
 

Macros

#define STP_SPG   0
 
#define STP_SAP   1
 
#define STP_PCSPG   2
 
#define STP_RPCSPG   3
 
#define STP_NWSPG   4
 
#define STP_DCSTP   5
 
#define STP_NWPTSPG   6
 
#define STP_RSMT   7
 
#define STP_OARSMT   8
 
#define STP_MWCSP   9
 
#define STP_DHCSTP   10
 
#define STP_GSTP   11
 
#define STP_RMWCSP   12
 
#define STP_BRMWCSP   13
 
#define EAT_FREE   -1
 
#define EAT_LAST   -2
 
#define EAT_HIDE   -3
 
#define STP_TERM   0
 
#define STP_TERM_NONE   -1
 
#define STP_TERM_PSEUDO   -2
 
#define STP_TERM_NONLEAF   -3
 
#define STP_CENTER_OK   0
 
#define STP_CENTER_DEG   1
 
#define STP_CENTER_SUM   2
 
#define STP_CENTER_MIN   3
 
#define STP_CENTER_ALL   4
 
#define TERM2EDGE_NOTERM   -1
 
#define TERM2EDGE_FIXEDTERM   -2
 
#define TERM2EDGE_NONLEAFTERM   -3
 
#define SDSTAR_BASE_UNSET   -1
 
#define SDSTAR_BASE_KILLED   -2
 
#define STP_DELPSEUDO_MAXGRAD   7
 
#define STP_DELPSEUDO_MAXNEDGES   21
 
#define flipedge(edge)   ( ((edge) + 1) - 2 * ((edge) % 2) )
 
#define flipedge_Uint(edge)   ( (((unsigned int) edge) + 1) - 2 * (((unsigned int) edge) % 2) )
 
#define CONNECT   0
 
#define UNKNOWN   (-1)
 
#define FARAWAY   1e15
 
#define BLOCKED   1e10
 
#define BLOCKED_MINOR   (BLOCKED - 1.0)
 
#define EDGE_BLOCKED   0
 
#define EDGE_MODIFIABLE   1
 
#define MST_MODE   0
 
#define FSP_MODE   1
 
#define BSP_MODE   2
 
#define Is_term(a)   ((a) >= 0)
 
#define Is_pseudoTerm(a)   ((a) == STP_TERM_PSEUDO)
 
#define Is_nonleafTerm(a)   ((a) == STP_TERM_NONLEAF)
 
#define Is_anyTerm(a)   ((a) >= 0 || (a) == STP_TERM_PSEUDO || (a) == STP_TERM_NONLEAF )
 
#define Edge_anti(a)   ((((a) % 2) > 0) ? (a) - 1 : (a) + 1)
 
#define Edge_even(a)   ((((a) % 2) == 0) ? (a) : (a) - 1)
 
#define STP_FILE_MAGIC   0x33d32945
 
#define STP_FILE_VERSION_MAJOR   1
 
#define STP_FILE_VERSION_MINOR   0
 

Typedefs

typedef struct fixed_graph_components FIXED
 
typedef struct pseudo_ancestors PSEUDOANS
 
typedef struct compressed_sparse_storages_depository CSRDEPO
 
typedef struct special_distance_implied_profit SDPROFIT
 
typedef struct subgraph_extraction_insertion SUBINOUT
 
typedef struct csr_storage CSR
 
typedef struct csr_range RANGE
 
typedef struct dynamic_csr_storage DCSR
 
typedef struct singleton_ancestors_edge SINGLETONANS
 
typedef struct presolve_info PRESOL
 
typedef struct shortest_path PATH
 
typedef struct nodes_to_terminal_paths TPATHS
 
typedef struct dijkstra_heap_entry DENTRY
 
typedef struct dijkstra_heap DHEAP
 
typedef struct dijkstra_data DIJK
 
typedef struct voronoi_storage VNOI
 
typedef struct special_distance_clique SDCLIQUE
 

Enumerations

enum  FILETYPE {
  FF_BEA,
  FF_STP,
  FF_PRB,
  FF_GRD
}
 

Macro Definition Documentation

◆ STP_SPG

#define STP_SPG   0

Definition at line 42 of file graphdefs.h.

Referenced by buildsolgraph(), extractSubgraphBuild(), graph_load(), graph_transPc2Spg(), graph_transRpc2SpgTrivial(), graph_transRpcGetSpg(), graph_typeIsSpgLike(), graph_writeStp(), localInsertion(), localInsertion2(), localInsertion2pc(), localVertexInsertion(), probdataCreate(), probtypeIsValidForLocal(), redcostGraphBuild(), reduce_exec(), reduce_nvAdv(), reduceWithEdgeFixingBounds(), reduceWithNodeFixingBounds(), SCIP_DECL_HEUREXEC(), SCIP_DECL_HEURINIT(), SCIPintListNodeAppendCopy(), SCIPprobdataWriteSolution(), SCIPStpHeurPruneRun(), SCIPStpHeurSlackPruneRun(), supergraphComputeMst(), testBiconnectedDecomposition(), testBiconnectedDecomposition2(), testBiconnectedDecomposition3(), updateEdgeFixingBounds(), updateNodeFixingBounds(), updateNodeReplaceBounds(), and writeCommentSection().

◆ STP_SAP

#define STP_SAP   1

Definition at line 43 of file graphdefs.h.

Referenced by computeReducedProbSolutionBiased(), computeSteinerTree(), graph_load(), graph_transPcGetRsap(), graph_transPcGetSap(), graph_typeIsUndirected(), redcosts_initializeDistances(), reduce_daPcMw(), reduce_exec(), reduce_sap(), SCIPprobdataWriteSolution(), and writeCommentSection().

◆ STP_PCSPG

#define STP_PCSPG   2

Definition at line 44 of file graphdefs.h.

Referenced by boundPruneHeur(), collectFixedTerminals(), collectRoots(), createInitialCuts(), createModel(), createPrizeConstraints(), createVariables(), execNvSl(), freeConstraintsCutModel(), getBiasedMw(), graph_load(), graph_pc_getNonLeafTermOffset(), graph_pc_isPc(), graph_pc_isPcMw(), graph_pc_isUnrootedPcMw(), graph_transPc(), graph_transPcGetSap(), graph_transPcmw2rooted(), graph_voronoiWithRadius(), graph_writeStp(), mst_computeOnMarked(), pcContractWithAdjacentTerm(), pcReduceTermDeg1(), pcReduceTermDeg2(), probtypeIsValidForLocal(), reduce_bound(), reduce_exec(), reduce_identifyNonLeafTerms(), reduce_nv(), reduce_nvAdv(), reduce_sdsp(), runDualAscent(), SCIP_DECL_PROBCOPY(), SCIP_DECL_PROBTRANS(), SCIPprobdataAddNewSol(), SCIPStpHeurPruneRun(), SCIPStpHeurPruneUpdateSols(), sdGetSdPcMw(), setParams(), stptest_graphSetUpPcExtended(), updateEdgeLurkingBounds(), and writeCommentSection().

◆ STP_RPCSPG

#define STP_RPCSPG   3

Definition at line 45 of file graphdefs.h.

Referenced by boundPruneHeur(), computeDualSolution(), computeDualSolutionGuided(), computeSteinerTreeDijkPcMw(), computeSteinerTreeRedCosts(), computeSteinerTreeTM(), createPrizeConstraints(), execNvSl(), freeConstraintsCutModel(), graph_load(), graph_pc_getNonLeafTermOffset(), graph_pc_isPc(), graph_pc_isPcMw(), graph_pc_isRootedPcMw(), graph_pc_knotHasMaxPrize(), graph_pc_presolExit(), graph_pc_presolInit(), graph_transPcmw2rooted(), graph_transRpc(), graph_transRpc2SpgTrivial(), graph_transRpcToSpgIsStable(), graph_voronoiWithRadius(), graph_writeStp(), impliedNodesAddTerm(), markPseudoDeletablesFromBounds(), pcmwEnumerationTry(), pcmwReduceTerm0Prize(), probtypeIsValidForLocal(), probtypeIsValidForSlackPrune(), redLoopInnerPc(), reduce_bound(), reduce_da(), reduce_daPcMw(), reduce_exec(), reduce_impliedProfitBasedRpc(), reduce_nv(), reduce_nvAdv(), reduce_redLoopPc(), reduce_sdsp(), reduce_simple_pc(), reduce_sl(), rpcTryFullReduce(), SCIP_DECL_PROBCOPY(), SCIPprobdataWriteSolution(), SCIPStpHeurPruneRun(), SCIPStpHeurPruneUpdateSols(), sdGetSdPcMw(), stptest_graphSetUpRpcExtended(), and writeCommentSection().

◆ STP_NWSPG

#define STP_NWSPG   4

Definition at line 46 of file graphdefs.h.

Referenced by computeReducedProbSolutionBiased(), graph_load(), graph_writeStp(), redcosts_initializeDistances(), reduce_exec(), SCIPprobdataCreateFromGraph(), SCIPprobdataWriteSolution(), and writeCommentSection().

◆ STP_DCSTP

#define STP_DCSTP   5

Definition at line 47 of file graphdefs.h.

Referenced by blockEdgesWithGlobalFixings(), buildsolgraph(), computeDualSolution(), computeDualSolutionGuided(), computeReducedProbSolutionBiased(), computeSteinerTreeRedCostsDirected(), computeSteinerTreeTM(), createInitialCuts(), createModel(), createVariables(), daExec(), dualascent_execDegCons(), freeConstraintsCutModel(), graph_copyData(), graph_csr_build(), graph_free(), graph_load(), graph_path_st_dc(), graph_writeStp(), initPropAtFirstCall(), isTMSpType(), probIsCompatible(), redcostGraphBuild(), redcostGraphComputeSteinerTreeDegCons(), redcostGraphSolRetransform(), reduce_da(), reduce_exec(), reduce_simple_dc(), retransformReducedProbSolution(), runTm(), SCIP_DECL_CONSPROP(), SCIP_DECL_HEUREXEC(), SCIP_DECL_PROBCOPY(), SCIP_DECL_PROBTRANS(), SCIPprobdataWriteSolution(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurRecRun(), SCIPStpValidateSol(), solstp_isValid(), solstp_prune(), stDcTermIsConnectable(), tmLpGetEdgeRandomizations(), updateBestSol(), and writeCommentSection().

◆ STP_NWPTSPG

#define STP_NWPTSPG   6

Definition at line 48 of file graphdefs.h.

Referenced by computeReducedProbSolutionBiased(), computeStarts(), computeSteinerTree(), graph_findCentralTerminal(), graph_knot_printInfo(), graph_knotIsNWLeaf(), graph_load(), graph_transNw(), graph_typeIsUndirected(), graph_writeStp(), nwptstpSetRoot(), redcostGraphComputeSteinerTreeDirected(), reduce_exec(), reduce_rpt(), runTm(), and SCIPprobdataWriteSolution().

◆ STP_RSMT

#define STP_RSMT   7

Definition at line 49 of file graphdefs.h.

Referenced by buildsolgraph(), graph_copyData(), graph_free(), graph_grid_create(), graph_load(), graph_pack(), graph_typeIsSpgLike(), graph_writeStp(), localVertexInsertion(), probtypeIsValidForLocal(), reduceWithEdgeFixingBounds(), reduceWithNodeFixingBounds(), SCIP_DECL_HEUREXEC(), SCIPprobdataWriteSolution(), SCIPStpHeurPruneRun(), SCIPStpHeurSlackPruneRun(), updateEdgeFixingBounds(), updateNodeFixingBounds(), updateNodeReplaceBounds(), and writeCommentSection().

◆ STP_OARSMT

#define STP_OARSMT   8

Definition at line 50 of file graphdefs.h.

Referenced by buildsolgraph(), graph_load(), graph_obstgrid_create(), graph_typeIsSpgLike(), graph_writeStp(), localVertexInsertion(), probtypeIsValidForLocal(), SCIP_DECL_HEUREXEC(), SCIPStpHeurPruneRun(), SCIPStpHeurSlackPruneRun(), and writeCommentSection().

◆ STP_MWCSP

#define STP_MWCSP   9

Definition at line 51 of file graphdefs.h.

Referenced by boundPruneHeurMw(), collectFixedTerminals(), collectRoots(), computeHistoryPcMw(), computeSteinerTreeRedCostsPcMw(), createInitialCuts(), createModel(), createVariables(), freeConstraintsCutModel(), getBiasedMw(), getEdgeCostUnbiased(), graph_load(), graph_path_PcMwSd(), graph_pc_isMw(), graph_pc_isPcMw(), graph_pc_isUnrootedPcMw(), graph_pc_knotChgPrize(), graph_transMw(), graph_transPc(), graph_transPcmw2rooted(), graph_voronoiWithRadius(), graph_writeStp(), insertionInitInsert(), localVertexInsertion(), mst_computeOnMarked(), probtypeIsValidForLocal(), reduce_bound(), reduce_cnsAdv(), reduce_daPcMw(), reduce_exec(), reduce_simple_mw(), runDualAscent(), SCIP_DECL_EVENTEXEC(), SCIP_DECL_PROBCOPY(), SCIP_DECL_PROBEXITSOL(), SCIP_DECL_PROBTRANS(), SCIPprobdataAddNewSol(), SCIPprobdataWriteLogfileEnd(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurPruneRun(), SCIPStpHeurPruneUpdateSols(), SCIPStpHeurRecExclude(), sdGetSdPcMw(), setParams(), shortestpath_pcInit(), updateEdgeLurkingBounds(), and writeCommentSection().

◆ STP_DHCSTP

#define STP_DHCSTP   10

Definition at line 52 of file graphdefs.h.

Referenced by computeReducedProbSolutionBiased(), computeStarts(), computeSteinerTree(), computeSteinerTreeCsr(), computeSteinerTreeKeyNodesCsr(), computeSteinerTreeRedCostsDirected(), computeSteinerTreeTM(), createModel(), createVariables(), daGetNruns(), dhcstpWarmUp(), graph_load(), graph_typeIsUndirected(), graph_voronoiWithRadius(), graph_writeStp(), initCostsAndPrioLP(), isTMSpType(), probdataFree(), redcostGraphComputeSteinerTreeDirected(), reduce_bound(), reduce_da(), reduce_exec(), reduce_simple_hc(), runTmDhcstp(), SCIP_DECL_HEUREXEC(), SCIP_DECL_PROBCOPY(), SCIP_DECL_PROBTRANS(), SCIPprobdataWriteSolution(), SCIPStpHeurPruneRun(), SCIPStpHeurRecRun(), SCIPStpHeurTMRun(), SCIPStpHeurTMRunLP(), setParams(), solstp_pruneFromNodes(), solstp_pruneFromTmHeur(), solstp_pruneFromTmHeur_csr(), updateBestSol(), and writeCommentSection().

◆ STP_GSTP

#define STP_GSTP   11

Definition at line 53 of file graphdefs.h.

Referenced by buildsolgraph(), computeHistory(), graph_load(), graph_transGstpClean(), graph_typeIsSpgLike(), localVertexInsertion(), probtypeIsValidForLocal(), SCIP_DECL_HEUREXEC(), SCIPprobdataWriteSolution(), SCIPStpHeurPruneRun(), and SCIPStpHeurSlackPruneRun().

◆ STP_RMWCSP

#define STP_RMWCSP   12

Definition at line 54 of file graphdefs.h.

Referenced by computeHistoryPcMw(), computeReducedProbSolution(), computeSteinerTreeDijkPcMw(), getEdgeCostUnbiased(), graph_load(), graph_pc_isMw(), graph_pc_isPcMw(), graph_pc_isRootedPcMw(), graph_pc_knotChgPrize(), graph_transPcmw2rooted(), graph_transRmw(), insertionInitInsert(), localVertexInsertion(), probtypeIsValidForLocal(), probtypeIsValidForSlackPrune(), reduce_bound(), reduce_exec(), reduce_simple_mw(), SCIP_DECL_PROBEXITSOL(), SCIPprobdataWriteLogfileEnd(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurPruneRun(), SCIPStpHeurPruneUpdateSols(), SCIPStpHeurRecRun(), shortestpath_pcInit(), stptest_graphSetUpRmwExtended(), and writeCommentSection().

◆ STP_BRMWCSP

#define STP_BRMWCSP   13

Definition at line 55 of file graphdefs.h.

Referenced by computeHistoryPcMw(), computeSteinerTreeDijkBMw(), createInitialCuts(), createModel(), createVariables(), fixVarsRedbasedIsPromising(), graph_copyData(), graph_load(), graph_pc_isMw(), graph_pc_isPcMw(), graph_pc_isRootedPcMw(), graph_printInfo(), initPropAtFirstCall(), packNodes(), packPcMwInit(), probAllowsSolBranching(), probdataFree(), reduce_exec(), runTmPcMW(), runTmPcMW_mode(), SCIP_DECL_CONSSEPALP(), SCIP_DECL_HEUREXEC(), SCIP_DECL_PROBCOPY(), SCIP_DECL_PROBEXITSOL(), SCIP_DECL_PROBTRANS(), SCIPprobdataWriteLogfileEnd(), SCIPStpHeurTMRunLP(), and writeCommentSection().

◆ EAT_FREE

#define EAT_FREE   -1

Definition at line 57 of file graphdefs.h.

Referenced by bea_save(), buildsolgraph(), closeNodesRunExit(), connectivityDataInit(), distDataPathRootsInitialize(), extreduce_edgeIsValid(), graph_copyPseudoAncestors(), graph_edge_del(), graph_edge_hide(), graph_edge_isDeleted(), graph_edge_redirect(), graph_isAlmostUniform(), graph_pack(), graph_pc_getNorgEdges(), graph_pc_transOrgAreConistent(), graph_show(), graph_valid(), graph_valid_ancestors(), graph_writeGml(), graph_writeGmlSub(), graph_writeStp(), hasAdjacentTerminals(), initCostsAndPrioLP(), mwGetNchains(), packEdges(), packPseudoAncestors(), pathreplaceExec(), poolSolIsUnreduced(), reduce_contract0Edges(), reduce_deleteConflictEdges(), reduce_extendedEdge(), reduce_fixedConflicts(), reduce_impliedProfitBasedRpc(), reduce_sd(), reduce_sdPc(), reduce_sdStar(), reduce_sdStarPc(), reduce_sdStarPc2(), reduce_sdWalk_csr(), reduce_sdWalkTriangle(), reducePcMw(), reinsertSubgraphTransferEdges(), SCIPStpHeurRecExclude(), sddeltable(), sdStarFinalize(), solgraphAddEdges(), solstp_isUnreduced(), solstp_setVertexFromEdge(), solstp_setVertexFromEdgeConn(), stp_save(), testRmwAnsDeletesOneEdge(), testSdBiasedBottleneckDeletesEdge(), testSdBiasedBottleneckTermPathDeletesEdge(), testSdBiasedDeletesEdge(), testSdCliqueStarDeletesEdge(), testSdStarBiasedDeletesEdge(), testSdStarBiasedDeletesEdge2(), testSdStarBiasedDeletesEdge3(), testSdStarPcKillsEdge(), updateEdgestateFromRed(), and updateEdgestateFromRedPcmw().

◆ EAT_LAST

#define EAT_LAST   -2

Definition at line 58 of file graphdefs.h.

Referenced by ansProcessCandidateWithBridge(), applyBranchHistoryToGraph(), applyLastVertexBranch(), bdkGetCutoffs(), bdkGetEdgeCutoffs(), bdkGetNeighborhood(), bdkNodeIsInvalid(), blctreeComputeBottlenecks(), borderNodesCollect(), bottleneckMarkEqualityPath(), boundPruneHeur(), boundPruneHeurMw(), branchOnVertex(), computeDegConsTree(), computeHistory(), computePertubedSol(), computeSteinerTreeVnoi(), computeTransVoronoi(), createPrizeConstraints(), createVariables(), cutEdgeProbe(), cutNodesGetLastCutnode(), cutNodesProcessComponent(), cutNodesProcessNext(), cutNodesTreeBuildSteinerTree(), cutNodesTreeMakeTerms(), cutNodesTreeMakeTermsIsComplete(), daInit(), dapathsFixPotTerms(), dapathsSetRunParams(), dapathsSortStarts(), daPcFindRoots(), daPcMarkRoots(), daRedCostIsValid(), daRpcmwDeleteTermIncidents(), decomposeGetFirstMarked(), delPseudoCheckReplacement(), delPseudoEdgeGetReplaceEdges(), delPseudoGetReplaceEdges(), delPseudoInit(), delPseudoInitForCheck(), delPseudoPath(), distGetRestricted(), distgraphAddEdges(), distgraphAddEdgesFromTpaths(), distgraphInsertEdge(), dualascent_allTermsReachable(), dualascent_execDegCons(), dualascent_execPcMw(), extendSubtreeHead(), extendSubtreeTail(), extractSubgraphAddEdgesWithHistory(), extractSubgraphGetSizeAndMap(), extreduce_mstbiasedCheck3NodeSimple(), extreduce_spgCheck3NodeSimple(), extStackTopCollectExtEdges(), extTreeFindExtensions(), findRootsMark(), findSolPcMw1Term(), fixVarsDualcost(), generalStarSetUp(), getBiasedMw(), getBiasedPc(), getcloseterms2term(), getHighSolDegVertex(), getKeyPathsStar(), getKeyPathUpper(), getRedCost2ndNextDistances(), getSd(), getTreeRedcosts_dbg(), graph_dijkLimited_initPcShifts(), graph_edge_redirect(), graph_get4nextTTerms(), graph_hasMultiEdges(), graph_init_dcsr(), graph_knot_add(), graph_knot_contract(), graph_knot_del(), graph_knot_delFull(), graph_knotIsNWLeaf(), graph_load(), graph_mincut_exec(), 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_reduce(), graph_pc_adaptSap(), graph_pc_contractEdge(), graph_pc_contractNodeAncestors(), graph_pc_deleteTerm(), graph_pc_enforceNonLeafTerm(), graph_pc_evalTermIsNonLeaf(), graph_pc_getRoot2PtermEdge(), graph_pc_knotIsFixedTerm(), graph_pc_markOrgGraph(), graph_pc_nonTermToFixedTerm(), graph_pc_presolInit(), graph_pc_shiftNonLeafCosts(), graph_pc_term2edgeIsConsistent(), graph_sdWalks(), graph_sdWalksConnected(), graph_sdWalksExt(), graph_sdWalksExt2(), graph_tpathsAdd2nd(), graph_tpathsAdd3rd(), graph_tpathsAdd4th(), graph_transMw(), graph_transNw2sap(), graph_transPcGetRsap(), graph_transPcGetSap(), graph_transPcmw2rooted(), graph_transRmw(), graph_transRpcGetSpg(), graph_valid(), graph_validInput(), graph_voronoiExtend(), graph_voronoiMw(), graph_voronoiRepair(), graph_voronoiRepairMult(), graph_voronoiTerms(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), graphisValidPcMw(), impliedNodesAddTerm(), initPropAtFirstCall(), initReceivedSubproblem(), insertionGetCandidateEdges(), isNonLeaf_pretransPc(), isPseudoDeletable(), lca(), ledgeFromNetgraph(), mincut_separateLp(), mincutPrepareForLp(), mwContract0WeightVertices(), mwContractNonPositiveChain(), mwContractTerminalsSimple(), mwTraverseChain(), nodeIsCrucial(), packNodes(), pcmwDeleteNonSolEdges(), pcmwGetSolRoot(), pcmwReduceKnotDeg1(), pcmwReduceTerm0Prize(), pcmwUpdate(), pcReduceTermDeg1(), pcReduceTermDeg2(), pcsolPrune(), pcsubtreeDelete(), 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_cnsAdv(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_deleteMultiedges(), reduce_extendedCheck3Tree(), reduce_getSdByPaths(), reduce_impliedNodesIsValid(), 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_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_unconnectedInfeas(), reduce_unconnectedRpcRmwInfeas(), reduceCheckEdge(), reducePcMw(), reduceRootedProb(), reduceWithEdgeFixingBounds(), reinsertSubgraphDeleteOldEdges(), reroot(), ruleOutSubtree(), SCIPprobdataAddNewSol(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpValidateSol(), sdCliqueStarGetNodeBias(), sdCliqueUpdateGraphWithStarWalks(), sdDcExtendTree(), sddeltable(), sdGetSdPcMw(), sdGetSdsCliqueTermWalks(), sdgraphMstMarkOrgEdges(), sdgraphUpdateDistgraphFromTpaths(), sdneighborUpdateExec(), sdprofitBuild(), sdprofitBuild1stOnly(), selectBranchingVertexByLp(), selectBranchingVertexByLp2Flow(), sep_flowBalance(), sep_flowEdgeOut(), sep_flowIn(), sep_flowTermIn(), sepafullAddSingleSolcandEdges(), sepaspecial_pcimplicationsSeparate(), sepaspecial_vtimplicationsInit(), sepaspecial_vtimplicationsSeparate(), shortestpath_pcInit(), solgraphAdaptForDCSTP(), solIsTrivialPcMw(), solstp_containsNode(), solstp_isValid(), solstp_pcConnectDummies(), soltreeElimKeyPathsStar(), soltreeExchangeKeyPath(), spg3StarNeighborRuleOut(), stpsol_pruningIsPossible(), subgraphBuild(), subgraphIdentify(), termcompDeleteEdges(), termDeleteExtension(), termsepaBuildRootcomp(), termsepaCsrAddEdges(), termsepaCsrAddTermCopies(), termsepaCutIsCorrect(), testEdgeDeletion2_deprecated(), testEdgeDeletion4_deprecated(), testEdgeDeletion5_deprecated(), testSdGetterReturnsCorrectSds(), tpathsRepairTraverse1st(), tpathsRepairTraverseLevelWithStack(), tpathsRepairTraverseStackAddBelow(), tpathsRepairUpdate1st(), tpathsRepairUpdateLevel(), tpathsScan1st(), tpathsScan2nd(), tpathsScan3rd(), tpathsScan4th(), trail(), trail_old(), updateEdgeFixingBounds(), updateEdgeLurkingBounds(), updateNodeReplaceBounds(), and vnoiDataRepairPreprocess().

◆ EAT_HIDE

#define EAT_HIDE   -3

Definition at line 59 of file graphdefs.h.

Referenced by graph_edge_del(), graph_edge_hide(), and graph_uncover().

◆ STP_TERM

#define STP_TERM   0

terminal

Definition at line 61 of file graphdefs.h.

Referenced by applyBranchHistoryToGraph(), cutNodesTreeMakeTerms(), decomposeExactFixSol(), distgraphAddNodes(), extractSubgraphAddNodes(), fixVarsDualcost(), graph_knot_chg(), graph_load(), graph_pc_2org(), graph_pc_2trans(), graph_pc_knotToFixedTermProperty(), graph_pc_nonTermToFixedTerm(), graph_transNw2pc(), graph_transPc(), graph_transPc2Spg(), graph_transPcGetRsap(), graph_transRmw(), graph_transRpc(), graph_transRpc2FixedProper(), graph_transRpcGetSpg(), keyNodesSetTerms(), nsvEdgeContract(), propgraphFixNode(), reduce_sl(), SCIP_DECL_CONSSEPALP(), SCIPStpHeurTMRunLP(), sepafullReduceFromSols(), subgraphBuild(), testBdkSdMstDeletesNodeDeg3(), testBdkSdMstDeletesNodeDeg4(), testBdkSdMstStarDeletesNodeDeg4(), testBdkTreeDistDeletesNodeDeg4(), testBiasedTerminalPathsTo4NextFound(), testBiconnectedComponentsAreFound(), testBiconnectedComponentsAreFound2(), testBiconnectedComponentsAreFound3(), testBiconnectedDecomposition(), testBiconnectedDecomposition2(), testBiconnectedDecomposition3(), testBLCworksFor3Star(), testBLCworksFor3StarAfterReduction(), testBLCworksFor5Tree(), testDaPathsPcMw3EdgesWorks(), testDistCloseNodesPcAreValid1(), testDistCloseNodesPcAreValid2(), testDistCloseNodesPcAreValidAfterDeletion(), testDistDistancesAreValid(), testEdgeDeletedBy3LeafSpg(), testEdgeDeletedByCommonRedCostsTargets(), testEdgeDeletedByEqBottleneck(), testEdgeDeletedByEqBottleneck2(), testEdgeDeletedByMst1(), testEdgeDeletedByMst2(), testEdgeDeletedByMultiRedCosts(), 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(), testSdRepair(), testSdStarBiasedDeletesEdge(), testSdStarBiasedDeletesEdge2(), testSdStarBiasedDeletesEdge3(), testSdStarPcKillsEdge(), testStar3IsCorrect(), testStar4EdgeIsCorrect(), testStar4IsCorrect(), testStar5IsCorrect(), testTerminalPathsRepair(), testTerminalPathsRepair2(), testTerminalPathsRepair3(), testTerminalPathsTo3NextFound(), testTerminalSeparatorsAreFound(), testTerminalSeparatorsAreFound2(), testTerminalSeparatorsAreFound3(), testTmGivesExpectedTreePcFull1(), testTmGivesExpectedTreePcFull2(), and testTmGivesExpectedTreePcFull3().

◆ STP_TERM_NONE

#define STP_TERM_NONE   -1

non-terminal

Definition at line 62 of file graphdefs.h.

Referenced by distgraphAddNodes(), extractSubgraphAddNodes(), graph_knot_chg(), graph_pc_fixedTermToNonTerm(), graph_pc_knotToFixedTerm(), graph_pc_knotToNonTermProperty(), graph_pc_nonTermToFixedTerm(), graph_transPc2Spg(), graph_transPcGetRsap(), graph_transPcmw2rooted(), graph_transRpc(), graph_transRpc2FixedProper(), graph_transRpcGetSpg(), keyNodesResetTerms(), termDeleteExtension(), testBdkSdMstDeletesNodeDeg3(), testBdkSdMstDeletesNodeDeg4(), testBdkSdMstStarDeletesNodeDeg4(), testBdkTreeDistDeletesNodeDeg4(), testBiasedTerminalPathsTo4NextFound(), testBiconnectedComponentsAreFound(), testBiconnectedComponentsAreFound2(), testBiconnectedComponentsAreFound3(), testBiconnectedDecomposition(), testBiconnectedDecomposition2(), testBiconnectedDecomposition3(), testBLCworksFor3Star(), testBLCworksFor3StarAfterReduction(), testBLCworksFor5Tree(), testDaPathsPcMw3EdgesWorks(), testDistCloseNodesAreValid(), testDistCloseNodesPcAreValid2(), testDistCloseNodesPcAreValidAfterDeletion(), testDistDistancesAreValid(), testDistRootPathsAreValid(), testEdgeDeletedBy3LeafSpg(), testEdgeDeletedByCommonRedCostsTargets(), testEdgeDeletedByEqBottleneck(), testEdgeDeletedByEqBottleneck2(), testEdgeDeletedByMst1(), testEdgeDeletedByMst2(), testEdgeDeletedByMultiRedCosts(), testEdgeNotDeleted1(), testGeneralStarDeletedEdge1(), testGeneralStarDeletedEdge2(), testGeneralStarDeletedEdge3(), testNode3PseudoDeletedByContraction(), testNode3PseudoDeletedByRedCosts1(), testNode3PseudoDeletedBySd1(), testNode3PseudoDeletedBySd2(), testNode3PseudoDeletedBySd3(), testNode3PseudoDeletedBySdBiased(), testNode3PseudoDeletedBySdBiasedSimple(), testNode4PseudoDeletedBySd1(), testNode4PseudoNotDeletedBySd1(), testNsvImpliedContractsCutDistEdge(), testNsvImpliedContractsCutDistMiddleEdge(), testNsvImpliedContractsEdge(), testNsvImpliedContractsEdge2(), testNsvImpliedContractsImpliedToTermEdge(), testPathReplaceDeletesEdge(), testPathReplaceDeletesEdge2(), testPcNode4PseudoDeletedBySd1(), testRmwAnsDeletesOneEdge(), testRmwAnsDeletesOneNode(), testRmwAnsDeletesTwoNodes(), testRmwChain2DeletesNode(), testRmwNpv3DeletesNode(), testRmwTerminalContraction(), testRmwTerminalDeg1Contraction1(), testRmwTerminalDeg1Contraction2(), testRmwTerminalDeg1Contraction3(), testSdBiasedBottleneckDeletesEdge(), testSdBiasedBottleneckTermPathDeletesEdge(), testSdBiasedDeletesEdge(), testSdCliqueStarDeg3AdjacencyIsCorrect(), testSdCliqueStarDeg3IsCorrect(), testSdCliqueStarDeg3IsCorrect2(), testSdCliqueStarDeg4IsCorrect(), testSdCliqueStarDeletesEdge(), testSdGetterReturnsCorrectSds(), testSdGraphDistsAreValid(), testSdGraphDistsAreValid2(), testSdGraphStrongBiasedDistsAreValid(), testSdRepair(), testSdStarBiasedDeletesEdge(), testSdStarBiasedDeletesEdge2(), testSdStarBiasedDeletesEdge3(), testSdStarPcKillsEdge(), testStar3IsCorrect(), testStar4EdgeIsCorrect(), testStar4IsCorrect(), testStar5IsCorrect(), testTerminalPathsRepair(), testTerminalPathsRepair2(), testTerminalPathsRepair3(), testTerminalPathsTo3NextFound(), testTerminalSeparatorsAreFound(), testTerminalSeparatorsAreFound2(), testTerminalSeparatorsAreFound3(), testTmGivesExpectedTreePcFull2(), and testTmGivesExpectedTreePcFull3().

◆ STP_TERM_PSEUDO

#define STP_TERM_PSEUDO   -2

pseudo-terminal (for PC/MW variants)

Definition at line 63 of file graphdefs.h.

Referenced by graph_knot_chg(), graph_pc_2org(), graph_pc_2trans(), graph_transPc(), and graph_transRpc().

◆ STP_TERM_NONLEAF

#define STP_TERM_NONLEAF   -3

non-leaf (pseudo-) terminal (for PC/MW variants)

Definition at line 64 of file graphdefs.h.

Referenced by graph_knot_chg(), markNonLeafTerms_2trans(), and markNonLeafTerms_pretransPc().

◆ STP_CENTER_OK

#define STP_CENTER_OK   0

do nothing

Definition at line 66 of file graphdefs.h.

Referenced by graph_findCentralTerminal().

◆ STP_CENTER_DEG

#define STP_CENTER_DEG   1

find maximum degree

Definition at line 67 of file graphdefs.h.

Referenced by graph_findCentralTerminal().

◆ STP_CENTER_SUM

#define STP_CENTER_SUM   2

find the minimum distance sum

Definition at line 68 of file graphdefs.h.

Referenced by graph_findCentralTerminal().

◆ STP_CENTER_MIN

#define STP_CENTER_MIN   3

find the minimum largest distance

Definition at line 69 of file graphdefs.h.

Referenced by graph_findCentralTerminal().

◆ STP_CENTER_ALL

#define STP_CENTER_ALL   4

find the minimum distance sum to all knots

Definition at line 70 of file graphdefs.h.

Referenced by graph_findCentralTerminal().

◆ TERM2EDGE_NOTERM

#define TERM2EDGE_NOTERM   -1

for PC/MW: vertex is no terminal

Definition at line 72 of file graphdefs.h.

Referenced by contractEdgeNoFixedEnd(), graph_pc_contractEdge(), graph_pc_fixedTermToNonTerm(), graph_pc_initTerm2Edge(), graph_pc_knotToFixedTerm(), graph_pc_knotToNonTermProperty(), graph_pc_nonTermToFixedTerm(), graph_pc_term2edgeIsConsistent(), graph_pc_updateSubgraphEdge(), graph_transPcGetRsap(), graph_transPcmw2rooted(), and termDeleteExtension().

◆ TERM2EDGE_FIXEDTERM

#define TERM2EDGE_FIXEDTERM   -2

for PC/MW: vertex is fixed terminal; artificial root is also considered a fixed terminal

Definition at line 73 of file graphdefs.h.

Referenced by graph_pc_knotIsFixedTerm(), graph_pc_knotToFixedTermProperty(), graph_pc_nonTermToFixedTerm(), graph_pc_term2edgeIsConsistent(), graph_transPc(), graph_transPcGetRsap(), and redcostGraphBuild().

◆ TERM2EDGE_NONLEAFTERM

#define TERM2EDGE_NONLEAFTERM   -3

for PC/MW: vertex is non-leaf terminal

Definition at line 74 of file graphdefs.h.

Referenced by contractEdgeNoFixedEnd(), graph_pc_term2edgeIsConsistent(), graph_pc_termIsNonLeafTerm(), graph_pc_termToNonLeafTerm(), graph_transPc(), and graph_transRpc().

◆ SDSTAR_BASE_UNSET

#define SDSTAR_BASE_UNSET   -1

Definition at line 76 of file graphdefs.h.

Referenced by graph_sdStar(), graph_sdStarBiased(), reduce_sdStar(), reduce_sdStarPc(), reduce_sdStarPc2(), sdStarBiasedProcessNode(), sdStarInit(), and sdStarReset().

◆ SDSTAR_BASE_KILLED

#define SDSTAR_BASE_KILLED   -2

Definition at line 77 of file graphdefs.h.

Referenced by reduce_sdStar(), reduce_sdStarPc(), reduce_sdStarPc2(), and sdStarBiasedProcessNode().

◆ STP_DELPSEUDO_MAXGRAD

#define STP_DELPSEUDO_MAXGRAD   7

Definition at line 79 of file graphdefs.h.

Referenced by delPseudoCheckReplacement(), delPseudoDeleteVertex(), delPseudoEdgeDeleteEdge(), delPseudoEdgeGetReplaceEdges(), delPseudoFreeData(), delPseudoFreeDataForCheck(), delPseudoGetReplaceEdges(), delPseudoInit(), delPseudoInitForCheck(), graph_edge_delPseudo(), graph_knot_delPseudo(), graph_knot_delPseudoCheckIfPossible(), pseudodeleteDeleteComputeCutoffs(), pseudodeleteDeleteMarkedNodes(), and reduce_applyPseudoDeletions().

◆ STP_DELPSEUDO_MAXNEDGES

#define STP_DELPSEUDO_MAXNEDGES   21

Definition at line 80 of file graphdefs.h.

Referenced by delPseudoCheckReplacement(), delPseudoDeleteVertex(), delPseudoFreeData(), delPseudoGetReplaceEdges(), delPseudoInit(), graph_knot_delPseudo(), pseudodeleteDeleteComputeCutoffs(), pseudodeleteInit(), and reduce_applyPseudoDeletions().

◆ flipedge

#define flipedge (   edge)    ( ((edge) + 1) - 2 * ((edge) % 2) )

Definition at line 84 of file graphdefs.h.

Referenced by applyBranchHistoryToGraph(), applyLastVertexBranch(), bdkTryDegGe4(), blctreeBuildMst(), blctreeComputeBottlenecks(), boundPruneHeur(), boundPruneHeurMw(), branchOnVertex(), computeDegConsTree(), computeHistory(), computeHistoryPcMw(), computeReducedProbSolutionBiased(), computeTransVoronoi(), connectivityDataInit(), createPrizeConstraints(), createVariables(), decomposeExactFixSol(), deleteEdge(), delPseudoDeleteVertex(), delPseudoEdgeDeleteEdge(), delPseudoEdgeGetReplaceEdges(), delPseudoGetEdgePosition(), delPseudoInit(), delPseudoInitForCheck(), delPseudoPath(), dhcstpWarmUp(), extractSubgraphAddEdge(), extractSubgraphAddEdgesWithHistory(), extreduce_checkArc(), extreduce_deleteArcs(), extreduce_deleteEdges(), extreduce_edgeIsValid(), extreduce_extCompRevert(), extreduce_mstbiasedCheck3NodeSimple(), extreduce_redcostAddEdge(), extreduce_spgCheck3ComponentSimple(), extreduce_spgCheck3NodeSimple(), fixEdgestate(), fixEdgeVar(), fixVarsDualcost(), generalStarCheck(), generalStarCheckGetNextStar(), generalStarDeleteEdges(), getHighSolDegVertex(), getKeyPathsStar(), getKeyPathUpper(), getRedCost2ndNextDistances(), getTreeRedcosts_dbg(), graph_csr_build(), graph_csr_chgCosts(), graph_dcsr_deleteEdgeBi(), graph_edge_addSubgraph(), graph_edge_getAncestors(), graph_edge_printInfo(), graph_edge_reinsert(), graph_getEdgeCosts(), graph_getEdgeRevCosts(), graph_init_dcsr(), graph_knot_contract(), graph_knot_replaceDeg2(), graph_mincut_exec(), graph_pc_edgeIsExtended(), graph_pc_shiftNonLeafCosts(), graph_pc_term2edgeIsConsistent(), graph_pc_updateSubgraphEdge(), graph_singletonAncestors_init(), graph_transPc(), graph_transPcGetRsap(), graph_transPcGetSap(), graph_transPcmw2rooted(), graph_transRmw(), graph_transRpc(), graph_transRpcGetSpg(), initialise(), initReceivedSubproblem(), localKeyVertexHeuristics(), localVertexInsertion(), markSolTreeNodes(), mincutPrepareForLp(), mwTraverseChain(), nodeIsCrucial(), nsvExec(), pcmwDeleteNonSolEdges(), propgraphApplyStates(), propgraphDeleteEdge(), propgraphFixEdge(), pseudodeleteGetNextStar(), redcostGraphBuild(), redcostGraphMark(), redcosts_forLPget(), redcosts_initializeDistances(), reduce_bd34(), reduce_bd34WithSd(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_contract0Edges(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_extendedCheck3Tree(), reduce_npv(), reduce_nvAdv(), reduce_sd(), reduce_sdPc(), reduce_sdRepair(), reduce_sdspSap(), reduce_simple_hc(), reduce_simple_sap(), reduce_termcompChangeSubgraphToBottleneck(), reduce_unconnectedRpcRmwInfeas(), reduceCheckEdge(), reduceLurk(), reducePcMw(), reduceRootedProb(), reduceWithEdgeFixingBounds(), reinitialise(), replaceEdgeByPath(), reroot(), ruleOutSubtree(), SCIPlinkcuttreeEvert(), SCIPStpHeurTMBuildTreeDc(), SCIPStpValidateSol(), sdCliqueUpdateGraphWithStarWalks(), sddeltable(), sdGetSdsCliqueTermWalks(), sep_flowEdgeOut(), sepafullReduceFromSols(), sepaspecial_vtimplicationsInit(), sepaspecial_vtimplicationsSeparate(), setEdgestate(), setSubBottleneckEdges(), solstp_containsNode(), solstp_isValid(), soltreeElimKeyPathsStar(), soltreeExchangeKeyPath(), subgraphBuild(), subSolIsRedundant(), supergraphComputeMst(), termcompDeleteEdges(), termsepaCsrAddReverseEdges(), testEdgeDeletion3_deprecated(), tpathsRepairUpdate1st(), tpathsRepairUpdateLevel(), treeGetCounters(), updateEdgeFixingBounds(), updateEdgestateFromRed(), updateEdgestateFromRedPcmw(), updateNodeReplaceBounds(), and validateEdgestate().

◆ flipedge_Uint

#define flipedge_Uint (   edge)    ( (((unsigned int) edge) + 1) - 2 * (((unsigned int) edge) % 2) )

Definition at line 85 of file graphdefs.h.

Referenced by blctreeEvert(), graph_edge_delHistory(), graph_knot_contract(), initCostsAndPrioLP(), mwContract0WeightVertices(), and SCIPStpHeurTMRunLP().

◆ CONNECT

#define CONNECT   0

Definition at line 87 of file graphdefs.h.

Referenced by boundPruneHeur(), boundPruneHeurMw(), buildsolgraph(), closeNodesRunCompute(), cmst_computeMst(), computeDegConsTree(), computeOnMarked_exec(), computePertubedSol(), computeSteinerTree(), computeSteinerTree_exec(), computeSteinerTree_execBiased(), computeSteinerTree_execDirected(), computeSteinerTree_execPcMw(), computeSteinerTree_execPcMwFull(), computeSteinerTree_execRpcMw(), computeSteinerTreeVnoi(), connectivityDataInit(), daExec(), dapathsSortStarts(), decomposeExactFixSol(), deleteEdge(), dhcstpWarmUp(), distCloseNodesCompute(), distGetRestricted(), extreduce_deleteArcs(), extreduce_deleteEdges(), findSolPcMw1Term(), generalStarCheck(), generalStarDeleteEdges(), getHighSolDegVertex(), getKeyPathsStar(), getKeyPathUpper(), graph_heap_correct(), graph_heap_deleteMinReturnNode(), graph_knot_contract(), graph_path_exec(), graph_path_execX(), graph_path_invroot(), graph_path_PcMwSd(), graph_path_st_pcmw_reduce(), graph_pathInLimitedExec(), graph_pc_solGetObj(), graph_sdCloseNodesBiased(), graph_sdPaths(), graph_sdStar(), graph_sdStarBiased(), graph_sdWalks(), graph_sdWalks_csr(), graph_sdWalksConnected(), graph_sdWalksExt(), graph_sdWalksExt2(), graph_sdWalksTriangle(), graph_voronoi(), graph_voronoiExtend(), graph_voronoiMw(), graph_voronoiRepair(), graph_voronoiRepairMult(), graph_voronoiTerms(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), initializeIncumbent(), insertionInit(), keyNodesSetTerms(), lca(), ledgeFromNetgraph(), localInsertion(), localInsertion2(), localKeyPathExchange(), localKeyPathExchangePc(), localKeyVertex(), localKeyVertexHeuristics(), localKeyVertexPc(), localKeyVertexPc2(), localVertexInsertion(), lurkpruneInit(), markSolTreeNodes(), mst_getSoledges(), nodeIsCrucial(), nodesolGetEdgeSol(), nodesolSetTrivial(), pcmwDeleteNonSolEdges(), pcmwGetSolRoot(), pcsolGetMstEdges(), pcsolGetTrivialEdges(), pcsolPrune(), pcsubtreeDelete(), pcsubtreeDelete_csr(), pcsubtreePruneForProfit(), pcsubtreePruneForProfit_csr(), poolAddSol(), poolSolIsUnreduced(), pruneSteinerTreePc(), redcostGraphSolRetransform(), reduce_bound(), reduce_boundHop(), reduce_boundHopRc(), reduce_boundMw(), reduce_daSlackPrune(), reduce_extendedEdge(), reduce_solLevelTopTransferSolBack(), reduceFixedVars(), reduceLurk(), reducePcMw(), reduceRootedProb(), reduceWithEdgeFixingBounds(), reroot(), retransformReducedProbSolution(), SCIP_DECL_HEUREXEC(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurPruneRun(), SCIPStpHeurPruneUpdateSols(), SCIPStpHeurRecExclude(), SCIPStpHeurSlackPruneRun(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), sdCliqueStarComputeSds(), sdDcExtendTree(), selectBranchingVertexBySol(), sepafullReduceFromSols(), setNodeSolArray(), solAddTry(), solGetMstEdges_csr(), solGetStpSol(), solgraphSelectSolsDiff(), solpool_addSolToScip(), solstp_addSolToProb(), solstp_containsNode(), solstp_convertCsrToGraph(), solstp_getNedges(), solstp_getNedgesBounded(), solstp_getObjBounded(), solstp_getObjCsr(), solstp_getOrg(), solstp_getStpFromSCIPsol(), solstp_isUnreduced(), solstp_isValid(), solstp_pcConnectDummies(), solstp_pcGetObjCsr(), solstp_print(), solstp_pruneFromEdges(), solstp_setVertexFromEdge(), solstp_setVertexFromEdgeConn(), soltreeElimKeyPathsStar(), soltreeExchangeKeyPath(), stpsol_pruningIsPossible(), stpsolPrune_csr(), subscipGetSol(), subsolFixOrgEdges(), subSolIsRedundant(), tbottleneckInit(), termcompDeleteEdges(), tpathsResetMembers(), tpathsScan1st(), vnoiCompute(), vnoiComputeImplied(), and vnoiDataRepairPreprocess().

◆ UNKNOWN

#define UNKNOWN   (-1)

Definition at line 88 of file graphdefs.h.

◆ FARAWAY

#define FARAWAY   1e15

Definition at line 89 of file graphdefs.h.

Referenced by addInitialPathNodes(), addRedsol(), applyBranchHistoryToGraph(), applyEdgestateToProb(), baseMstGetAdjcosts(), bdkStarGetCombinedSdCost(), bdkStarStoreMstsCosts(), blctreeBuildMst(), blctreeResetNode(), borderBuildCharDists(), boundPruneHeur(), boundPruneHeurMw(), buildsolgraph(), cgraph_node_append(), cgraph_node_repositionTop(), cgraph_valid(), closeNodesRunInit(), cmst_computeMst(), completemst1(), completemst2(), completemst3(), completemst4(), completemst5(), compUpDistInitMindists(), computeDegConsTree(), computeOnMarked_init(), computeReducedProbSolution(), computeSteinerTree(), computeSteinerTree_execBiased(), computeSteinerTree_init(), computeSteinerTree_tryConnectNodePcMw(), computeSteinerTreeVnoi(), computeTransVoronoi(), contractEdgeWithFixedEnd(), daExec(), dapathsSetRunParams(), dapathsSortStarts(), daPcFindRoots(), dcmstGetWeightFromStore(), dcmstTest2b(), distCloseNodesCompute(), distCloseNodesGetMaxCost(), distDataGetSpecialDist(), distDataGetSpecialDistIntermedTerms(), distGetRestricted(), distgraphGetBoundaryEdgeDistBest(), dpborder_init(), dpborder_partGetConnectionCost(), dpborder_partGetIdxNew(), dpborder_partGetIdxNewExclusive(), dpiterAddNewPrepare(), dpiterSetDefault(), dpmiscInit(), dualascent_execDegCons(), dualascent_execPcMw(), enumExec(), extreduce_bottleneckToSiblingIsDominated(), extreduce_bottleneckToSiblingIsDominatedBiased(), extreduce_contractionInit(), extreduce_distDataDeleteEdge(), extreduce_extdataCleanArraysDbg(), extreduce_redcostAddEdge(), extreduce_redcostInitExpansion(), extreduce_redcostRemoveEdge(), extreduce_redcostTreeRecompute(), extreduce_sdsTopInSync(), extreduce_sdsverticalInSync(), extSdGetProper(), extSdIsNonTrivial(), extTreeGetDirectedRedcost(), extTreeGetDirectedRedcostProper(), extTreeRedcostCutoff(), findRootsMark(), fixVarsDualcost(), getBiasedMw(), getBiasedPc(), getKeyPathReplaceCost(), getKeyPathUpper(), getMinDistCombination(), getRedCost2ndNextDistances(), getSd(), getSdProfit(), getTreeRedcosts_dbg(), graph_csr_build(), graph_csr_chgCosts(), graph_dcsr_deleteEdge(), graph_dijkLimited_clean(), graph_dijkLimited_init(), graph_dijkLimited_initPcShifts(), graph_dijkLimited_reset(), graph_findCentralTerminal(), graph_get4nextTTerms(), graph_init_dcsr(), graph_isAlmostUniform(), graph_knotIsNWLeaf(), graph_load(), graph_pack(), graph_path_exec(), graph_path_execX(), 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_extendOut(), graph_path_st_rpcmw(), graph_pathInLimitedExec(), graph_pc_edgeIsExtended(), graph_pc_getNorgEdges(), graph_pc_initPrizes(), graph_pc_knotHasMaxPrize(), graph_pc_knotIsFixedTerm(), graph_pc_knotToFixedTermProperty(), graph_pc_nonTermToFixedTerm(), graph_pc_shiftNonLeafCosts(), graph_pc_term2edgeIsConsistent(), graph_pc_transOrgAreConistent(), graph_sdCloseNodesBiased(), graph_sdPaths(), graph_sdStar(), graph_sdStarBiased(), graph_sdWalksConnected(), graph_tpathsAdd1st(), graph_transNw2pc(), graph_transPc(), graph_transPc2Spg(), graph_transPcGetRsap(), graph_transPcGetSap(), graph_transPcmw2rooted(), graph_transRmw(), graph_transRpc(), graph_transRpc2FixedProper(), graph_transRpcGetSpg(), graph_transRpcToSpgIsStable(), graph_voronoi(), graph_voronoiMw(), graph_voronoiRepair(), graph_voronoiTerms(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), impliedNodesAddTerm(), initCostsAndPrioLP(), insertionGetCandidateEdges(), localKeyVertexHeuristics(), lurkpruneInit(), mst_getObj(), mstCompLeafGetSDsToAncestors(), mstCompLeafGetSDsToSiblings(), mstCompLeafToAncestorsBiasedRuleOut(), mstLevelHorizontalAddSds(), nsvEdgeGetTermDists(), nsvExec(), pathneighborsCollect(), pcBiasCostsDCSR(), pcContractWithAdjacentTerm(), pcmwDeleteNonSolEdges(), pcmwGetStartNodes(), probdataCreate(), propgraphDeleteEdge(), propgraphFixEdge(), pseudoDelDouble(), pseudodeleteDeleteComputeCutoffs(), pseudoDelSingle(), redcostGraphBuild(), redcosts_forLPget(), redcosts_initializeDistances(), redcosts_unifyBlockedEdgeCosts(), reduce_bd34(), reduce_bound(), reduce_boundHop(), reduce_boundHopDa(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_chain2(), reduce_da(), reduce_dapaths(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_dcmstGetExtWeight(), reduce_dcmstGetWeight(), reduce_extendedCheck3Tree(), reduce_getSdByPaths(), reduce_impliedProfitBasedRpc(), reduce_npv(), reduce_nv(), reduce_nvAdv(), reduce_redLoopPc(), reduce_sap(), reduce_sdBiased(), reduce_sdEdgeCliqueStar(), reduce_sdPc(), reduce_sdprofitGetProfit(), reduce_sdRepair(), 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_hc(), reduce_simple_sap(), reduce_sl(), reduce_solFinalizeLocal(), reduce_solGetEdgesol(), reduce_solGetUpperBoundWithOffset(), reduce_solLevelTopTransferSolBack(), reduce_sollocalGetUpperBound(), reduce_sollocalHasUpperBound(), reduce_sollocalInit(), reduce_sollocalRebuildTry(), reduce_sollocalSetOffset(), reduce_sollocalUpdateNodesol(), reduce_sollocalUpdateUpperBound(), reduce_termcompInit(), reduce_unconnectedRpcRmwInfeas(), reduceCheckEdge(), reduceRootedProb(), reduceWithEdgeFixingBounds(), SCIP_DECL_HEUREXEC(), SCIPStpHeurPruneRun(), SCIPStpHeurPruneUpdateSols(), SCIPStpHeurRecRun(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMRun(), sdCliqueStarGetDistLimit(), sdCliqueStarInit(), sdCliqueStarUpdateNodeDist(), sdCliqueStarUpdateSd(), sdGetSdPcMw(), sdGetSdsCliqueTermWalks(), sdgraphMstSortCosts(), sdgraphUpdateDistgraphFromTpaths(), sdmstGetWeight(), sdneighborUpdateInit(), sdneighborUpdateNode(), sdprofitBuild(), sdprofitBuild1stOnly(), sdprofitUpdateNode(), sdqueryBuildRmqSparseTable(), sdqueryGetSd(), sdStarInit(), sdStarReset(), sdwalkReset(), sdwalkResetExt(), sdwalkResetExt2(), sepaspecial_pcimplicationsInit(), sepaspecial_vtimplicationsInit(), shortestpath_pcInit(), solstp_isUnreduced(), STP_Vectype(), stPcmwInit(), stRpcmwInit(), subtreesExtend(), tbottleneckInit(), testBiasedTerminalPathsTo4NextFound(), testBLCworksFor3StarAfterReduction(), testPcEdgeDeletedByMst1(), testPcEdgeNotDeleted(), testPcNode3PseudoDeletedBySd1(), testPcNode4PseudoDeletedBySd1(), testPrunedSolIsImprovedPc2(), testRmwAnsDeletesOneEdge(), testRmwAnsDeletesOneNode(), testRmwAnsDeletesTwoNodes(), testRmwChain2DeletesNode(), testRmwNpv3DeletesNode(), testRmwTerminalContraction(), testRmwTerminalDeg1Contraction1(), testRmwTerminalDeg1Contraction2(), testRmwTerminalDeg1Contraction3(), testSdBiasedBottleneckDeletesEdge(), testSdCliqueStarDeg3AdjacencyIsCorrect(), testSdCliqueStarDeg3IsCorrect(), testSdCliqueStarDeg3IsCorrect2(), testSdCliqueStarDeg4IsCorrect(), testSdRepair(), testTerminalPathsRepair(), testTerminalPathsRepair2(), testTerminalPathsRepair3(), testTerminalPathsTo3NextFound(), trail(), updateEdgeFixingBounds(), updateFromPartition(), updateNodeFixingBounds(), updateNodeReplaceBounds(), vnoiDataReset(), and vnoiInit().

◆ BLOCKED

#define BLOCKED   1e10

used for temporarily blocking an edge

Definition at line 90 of file graphdefs.h.

Referenced by applyBranchHistoryToGraph(), blockEdgesWithGlobalFixings(), borderBuildCharDists(), computeReducedProbSolutionBiased(), computeStarts(), dhcstpWarmUp(), getBiasedMw(), graph_edge_isBlocked(), graph_load(), graph_pc_enforceNonLeafTerm(), graph_pc_getOrgCosts(), graph_pc_getOrgCostsCsr(), graph_pc_getPosPrizeSum(), graph_transGstpClean(), graph_transNw2pc(), graph_transPc2Spg(), graph_transRpc2FixedProper(), graph_transRpcGetSpg(), initCostsAndPrioLP(), initReceivedSubproblem(), reduce_boundHopRc(), reduce_termcompChangeSubgraphToOrgCosts(), SCIPStpHeurTMRunLP(), sdmstGetWeight(), sepafullAddSingleSolcandEdges(), sepaspecial_vtimplicationsInit(), setCostToOrgPc(), and subgraphBuild().

◆ BLOCKED_MINOR

#define BLOCKED_MINOR   (BLOCKED - 1.0)

used for permanently blocking an edge; different from BLOCKED because of weird prize sum in reduce_base.c

Definition at line 91 of file graphdefs.h.

Referenced by graph_edge_isBlocked(), graph_pc_enforcePseudoTerm(), graph_pc_getOrgCosts(), graph_pc_getOrgCostsCsr(), graph_pc_nonLeafTermIsEnforced(), propgraphApplyBoundchanges(), propgraphApplyImplicationsPcMw(), propgraphMarkFixedTermsPcMw(), and setCostToOrgPc().

◆ EDGE_BLOCKED

#define EDGE_BLOCKED   0

Definition at line 95 of file graphdefs.h.

Referenced by mwReduceTermDeg1(), pcContractWithAdjacentTerm(), pcReduceTermDeg1(), pcReduceTermDeg2(), reduce_fixedConflicts(), reduce_nvAdv(), reduce_sdImpLongEdge(), reduce_sdStarPc(), reduce_sdWalk(), reduce_sdWalk_csr(), reduce_sdWalkExt2(), reduce_simple(), and reduce_sl().

◆ EDGE_MODIFIABLE

#define EDGE_MODIFIABLE   1

Definition at line 96 of file graphdefs.h.

◆ MST_MODE

#define MST_MODE   0

Definition at line 98 of file graphdefs.h.

Referenced by bdkStarIsSdMstReplacable(), blctreeBuildMst(), boundPruneHeur(), graph_path_exec(), isPseudoDeletable(), pathheapCorrect(), pcsolGetMstEdges(), pruneSteinerTreeStp(), reduce_bound(), reduce_boundHop(), reduce_daSlackPrune(), reduce_npv(), reduce_sd(), reduce_termcompChangeSubgraphToBottleneck(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreePcMw(), sdgraphMstBuild(), and supergraphComputeMst().

◆ FSP_MODE

#define FSP_MODE   1

Definition at line 99 of file graphdefs.h.

Referenced by createVariables(), graph_findCentralTerminal(), graph_path_exec(), graph_path_PcMwSd(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_extendBiased(), graph_sdPaths(), pricing(), SCIPprobdataAddNewSol(), and tryPathPcMw().

◆ BSP_MODE

#define BSP_MODE   2

Definition at line 100 of file graphdefs.h.

◆ Is_term

#define Is_term (   a)    ((a) >= 0)

Definition at line 102 of file graphdefs.h.

Referenced by addLevel(), addLevelFirst(), allTermsAreVisited(), ansDeleteVertex(), ansProcessCandidate(), applyBranchHistoryToGraph(), bdkNodeIsInvalid(), bea_save(), bidecomposition_getMarkedSubRoot(), blctreeComputeEdgesState(), borderNodesCollect(), borderNodesContract(), bottleneckGetDist(), bottleneckMarkEqualityEdges(), boundPruneHeur(), branchOnVertex(), buildTmAllSp(), collectFixedTerminals(), collectRoots(), computeDegConsTree(), computeOrderingFromNode(), computePertubedSol(), computeReducedProbSolutionBiased(), computeStarts(), computeSteinerTree(), computeSteinerTree_allTermsAreReached(), computeSteinerTree_connectNode(), computeSteinerTree_connectPseudoTerm(), computeSteinerTree_connectTerminal(), computeSteinerTree_exec(), computeSteinerTree_execBiased(), computeSteinerTree_execDirected(), computeSteinerTree_execPcMwFull(), computeSteinerTree_execRpcMw(), computeSteinerTreeVnoi(), computeTransVoronoi(), contractEdgeNoFixedEnd(), contractEdgeWithFixedEnd(), createModel(), createPrizeConstraints(), createVariables(), cutEdgeProbe(), cutEdgePrune(), cutNodesGetLastCutnode(), cutNodesProcessComponent(), cutNodesSetDfsRoot(), cutNodesTreeBuildSteinerTree(), cutNodesTreeDeleteComponents(), cutNodesTreeMakeTerms(), cutNodesTreeMakeTermsIsComplete(), daExec(), daInit(), dapathsFixPotTerms(), dapathsRunShortestPaths(), dapathsSetRunParams(), dapathsSortStarts(), daPcFindRoots(), daPcMarkRoots(), daRedCostIsValid(), decomposeGetSubgraph(), deletenodesDeg1(), delPseudoInit(), delPseudoInitForCheck(), distgraphAddEdges(), distgraphAddEdgesFromTpaths(), distgraphAddNodes(), dpborder_coreUpdateOrdering(), dpgraphInit(), dpsolverInitData(), dualascent_allTermsReachable(), dualascent_execDegCons(), dualascent_execPcMw(), enumIsPromising(), extensionHasImplicationConflict(), extractSubgraphAddNodes(), extractSubgraphGetSizeAndMap(), extreduce_bottleneckMarkRootPath(), extreduce_distDataGetSdDoubleForbidden(), extreduce_distDataGetSdDoubleForbiddenEq(), extreduce_distDataGetSdDoubleForbiddenLast(), extreduce_distDataGetSdDoubleForbiddenSingle(), extreduce_mstbiasedCheck3NodeSimple(), extreduce_spgCheck3ComponentSimple(), extreduce_spgCheck3NodeSimple(), extTreeGetDirectedRedcostProper(), findRootsMark(), fixVarsDualcost(), fixVarsDualcostLurking(), generalStarSetUp(), getBiasedMw(), getBiasedPc(), getcloseterms2term(), getExtBottleneckDist(), getHighSolDegVertex(), getKeyPathsStar(), getKeyPathUpper(), getSd(), graph_copyData(), graph_dijkLimited_initPcShifts(), graph_findCentralTerminal(), graph_get4nextTTerms(), graph_get_nVET(), graph_getIsTermArray(), graph_getTerms(), graph_isMarked(), graph_knot_add(), graph_knot_chg(), graph_knot_contract(), graph_knot_printInfo(), graph_knot_replaceDeg2(), graph_load(), graph_mark(), graph_pack(), graph_path_PcMwSd(), graph_path_st(), graph_path_st_brmwcs(), graph_path_st_dc(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_extendOut(), graph_path_st_pcmw_full(), graph_path_st_pcmw_reduce(), graph_path_st_rpcmw(), graph_pc_2org(), graph_pc_2trans(), graph_pc_contractEdge(), graph_pc_deleteTerm(), graph_pc_enforceNode(), graph_pc_evalTermIsNonLeaf(), graph_pc_finalizeSubgraph(), graph_pc_getPosPrizeSum(), graph_pc_getReductionRatios(), graph_pc_knotChgPrize(), graph_pc_knotIsDummyTerm(), graph_pc_knotIsFixedTerm(), graph_pc_knotIsPropPotTerm(), graph_pc_knotToFixedTerm(), graph_pc_nonTermToFixedTerm(), graph_pc_realDegree(), graph_pc_subtractPrize(), graph_pc_term2edgeIsConsistent(), graph_pc_termIsNonLeafTerm(), graph_pc_termMarkProper(), graph_pc_termToNonLeafTerm(), graph_printEdgeConflicts(), graph_sdCloseNodesBiased(), graph_sdPaths(), graph_sdWalksConnected(), graph_sdWalksExt(), graph_termsReachable(), graph_tpathsAdd1st(), graph_tpathsAdd2nd(), graph_tpathsAdd3rd(), graph_tpathsAdd4th(), graph_tpathsGetClosestTerm(), graph_tpathsGetProfitNodes(), graph_tpathsPrintForNode(), graph_transGstpClean(), graph_transMw(), graph_transNw2pc(), graph_transNw2sap(), graph_transPc(), graph_transPc2Spg(), graph_transPcGetRsap(), graph_transPcGetSap(), graph_transPcmw2rooted(), graph_transRmw(), graph_transRpc(), graph_transRpc2FixedProper(), graph_transRpcGetSpg(), graph_valid(), graph_validInput(), graph_voronoiExtend(), graph_voronoiMw(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), graph_writeStp(), graph_writeStpOrg(), graphisValidPcMw(), graphmarkIsClean(), hasAdjacentTerminals(), impliedNodesAddTerm(), impliedNodesRemoveTerm(), initPropAtFirstCall(), initReceivedSubproblem(), initSolve(), insertionDecrementSolDegree(), insertionFinalizeReplacement(), insertionGetCandidateEdges(), insertionIncrementSolDegree(), insertionInit(), insertionInitInsert(), insertionRestoreTree(), isLastTerm(), isMaxprizeTerm(), keyNodesResetTerms(), keyNodesSetTerms(), localKeyVertexHeuristics(), localVertexInsertion(), markNonLeafTerms_2trans(), markNonLeafTerms_pretransPc(), mincut_findTerminalSeparators(), mincut_separateLp(), mincutFree(), mincutPrepareForLp(), mwContract0WeightVertices(), mwContractTerminalsChainWise(), mwContractTerminalsSimple(), mwGetNchains(), mwReduceTermDeg1(), mwTraverseChain(), nodeIsCrucial(), nodesolSetTrivial(), nsvEdgeGetTermDists(), nsvExec(), nwptstpSetRoot(), packNodes(), pcBiasCostsDCSR(), pcContractWithAdjacentTerm(), pcmwFindMax2Terms(), pcmwGetSolRoot(), pcmwGetStartNodes(), pcmwReduceKnotDeg1(), pcmwReduceTerm0Prize(), pcmwUpdate(), pcReduceKnotDeg2(), pcReduceTermDeg1(), pcReduceTermDeg2(), pcSdToNodeMark(), pcsolMarkGraphNodes(), pcsolMarkGraphNodes_csr(), pcsolPrune(), propgraphDeleteEdge(), propgraphDeleteNode(), pseudodeleteBiasedIsPromising(), pseudodeleteDeleteMarkedNodes(), pseudodeleteExecute(), pseudodeleteNodeIsPromising(), redcostGetNTermsMarked(), redcostGraphComputeSteinerTree(), redcosts_initializeDistances(), reduce_ans(), reduce_ansAdv(), reduce_ansAdv2(), reduce_bd34(), reduce_bd34WithSd(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_chain2(), reduce_cnsAdv(), reduce_cutEdgeTryPrune(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_extendedCheck3Tree(), reduce_extendedEdge(), reduce_getSdByPaths(), reduce_identifyNonLeafTerms(), reduce_impliedNodesGet(), reduce_impliedNodesRepair(), reduce_impliedProfitBasedRpc(), reduce_nodesDeg1(), reduce_npv(), reduce_nv(), reduce_nvAdv(), reduce_rpt(), reduce_sd(), reduce_sdBiased(), reduce_sdPc(), reduce_sdprofitPrintStats(), reduce_sdprofitUpdateFromBLC(), reduce_sdsp(), reduce_simple(), reduce_simple_hc(), reduce_simple_mw(), reduce_simple_pc(), reduce_simple_sap(), reduce_termcompChangeSubgraphToBottleneck(), reduce_termcompChangeSubgraphToOrgCosts(), reduce_unconnected(), reduce_unconnectedForDirected(), reduce_unconnectedInfeas(), reduce_unconnectedRpcRmwInfeas(), reduceCheckEdge(), reducePcMw(), reduceRootedProb(), reduceWithNodeFixingBounds(), reinsertSubgraphAdaptSubToOrgMap(), reinsertSubgraphTransferTerminals(), removeEdge(), replaceEdgeByPath(), reroot(), ruleOutSubtree(), SCIP_DECL_CONSPROP(), SCIP_DECL_CONSSEPALP(), SCIPprobdataAddNewSol(), SCIPStpBranchruleInitNodeState(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalExtendPcMwImp(), SCIPStpHeurLocalExtendPcMwOut(), SCIPStpHeurPruneRun(), SCIPStpHeurRecExclude(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMCompStarts(), SCIPStpHeurTMRunLP(), sdCliqueStarGetNodeBias(), sdDcExtendTree(), sddeltable(), sdGetSd(), sdGetSdNeighbor(), sdGetSdPcMw(), sdneighborUpdateExec(), sdneighborUpdateNode(), sdprofitBuild(), sdprofitBuild1stOnly(), sdprofitUpdateNode(), sdqueryBuildNodesToFullMap(), sdqueryBuildNodesToRmqMap(), sdwalkHasConflict(), sdwalkUpdate(), selectBranchingVertexByDegree(), selectBranchingVertexByLp(), selectBranchingVertexByLp2Flow(), sep_flow(), sep_flowBalance(), sep_flowIn(), sep_flowTermIn(), sepaspecial_pcimplicationsInit(), sepaspecial_vtimplicationsInit(), solDegIsValid(), solgraphAdaptForDCSTP(), solgraphSelectSolsDiff(), solIsTrivialPcMw(), solstp_isValid(), solstp_pcConnectDummies(), solstp_pcGetSolRoot(), soltreeElimKeyPathsStar(), soltreeExchangeKeyPath(), stDcTermIsConnectable(), stp_save(), STP_Vectype(), stPcmwInit(), stpsol_pruningIsPossible(), stpsolPrune_csr(), subgraphBuild(), subgraphIdentify(), tbottleneckInit(), termcompMarkPseudoDelNodes(), termDeleteExtension(), termsepaBuildRootcomp(), termsepaCollectCutNodes(), termsepaCsrAddEdges(), termsepaCsrAddTermCopies(), termsepaCsrGetMaxNedges(), termsepaFindTerminalSource(), termsepaStoreCutTry(), termsepaTraverseSinkComp(), testBiconnectedComponentsAreFound2(), testBiconnectedComponentsAreFound3(), tmAllspInit(), tpathsGetDistNew(), tpathsGetKCloseTerms(), tpathsRepairTraverse1st(), tpathsRepairTraverseStackAddBelow(), tpathsRepairUpdate1st(), tpathsRepairUpdateLevel(), tpathsScan1st(), tpathsScan2nd(), tpathsScan3rd(), tpathsScan4th(), truncateSubtree(), updateDeg2LurkingBounds(), updateEdgeLurkingBounds(), updateTerminalSource(), utdist(), and vnoiInit().

◆ Is_pseudoTerm

#define Is_pseudoTerm (   a)    ((a) == STP_TERM_PSEUDO)

Definition at line 103 of file graphdefs.h.

Referenced by addToCandidates(), applyBranchHistoryToGraph(), boundPruneHeur(), boundPruneHeurMw(), computeReducedProbSolutionBiased(), computeSteinerTree_allPseudoTermsAreReached(), computeSteinerTree_connectPseudoTerm(), computeSteinerTree_connectTerminal(), computeSteinerTree_execPcMw(), computeSteinerTree_execPcMwFull(), computeSteinerTree_execRpcMw(), computeSteinerTree_tryConnectNodePcMw(), createPrizeConstraints(), createVariables(), daPcFindRoots(), daPcMarkRoots(), daRpcmwDeleteTermIncidents(), extTreeGetDirectedRedcostProper(), findRootsMark(), getBiasedMw(), getBiasedPc(), getHighSolDegVertex(), getNewPrizeNode(), graph_isMarked(), graph_mark(), 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_2org(), graph_pc_2trans(), graph_pc_deleteTerm(), graph_pc_enforceNode(), graph_pc_getReductionRatios(), graph_pc_knotIsDummyTerm(), graph_pc_knotIsPropPotTerm(), graph_pc_knotToFixedTerm(), graph_pc_nonTermToFixedTerm(), graph_pc_realDegree(), graph_pc_term2edgeIsConsistent(), graph_pc_termIsNonLeafTerm(), graph_transPcGetRsap(), graph_transPcGetSap(), graph_transPcmw2rooted(), graphisValidPcMw(), initCostsAndPrioLP(), initReceivedSubproblem(), insertionDecrementSolDegree(), insertionFinalizeReplacement(), insertionIncrementSolDegree(), insertionInit(), insertionRestoreTree(), pcmwAdaptStarts(), pcmwGetStartNodes(), pcmwReduceTerm0Prize(), pcmwUpdate(), pcsolPrune(), propgraphApplyImplicationsPcMw(), reduce_bound(), reduce_daPcMw(), reduce_deleteConflictEdges(), reduce_simple_mw(), reduce_simple_pc(), reduce_sl(), reducePcMw(), reduceRootedProb(), reduceWithEdgeFixingBounds(), reduceWithNodeFixingBounds(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalExtendPcMwImp(), SCIPStpHeurRecExclude(), SCIPStpHeurTMBuildTreePcMw(), selectBranchingVertexByDegree(), sepaspecial_pcimplicationsSeparate(), shortestpath_pcInit(), solDegIsValid(), solgraphAdaptForPcMw(), solstp_isValid(), solstp_pcGetObjCsr(), solstp_pcGetSolRoot(), spg3StarNeighborRuleOut(), stPcmwConnectNode(), stPcmwInit(), stpsol_pruningIsPossible(), stRpcmwInit(), termDeleteExtension(), updateEdgeFixingBounds(), updateNodeFixingBounds(), and updateNodeReplaceBounds().

◆ Is_nonleafTerm

#define Is_nonleafTerm (   a)    ((a) == STP_TERM_NONLEAF)

Definition at line 104 of file graphdefs.h.

Referenced by applyBranchHistoryToGraph(), graph_pc_2org(), graph_pc_shiftNonLeafCosts(), graph_pc_term2edgeIsConsistent(), graph_pc_termIsNonLeafTerm(), graph_pc_transOrgAreConistent(), graph_transPc(), graph_transRpc(), and solstp_pcGetObjCsr().

◆ Is_anyTerm

#define Is_anyTerm (   a)    ((a) >= 0 || (a) == STP_TERM_PSEUDO || (a) == STP_TERM_NONLEAF )

Definition at line 105 of file graphdefs.h.

Referenced by applyBranchHistoryToGraph(), boundPruneHeurMw(), computeSteinerTree_execRpcMw(), graph_path_st_rpcmw(), graph_pc_contractEdge(), graph_pc_fixedTermToNonTerm(), graph_pc_getTwinTerm(), graph_pc_knotIsNonLeafTerm(), graph_pc_term2edgeIsConsistent(), graph_pc_termIsNonLeafTerm(), graph_pc_termToNonTerm(), graph_pc_updateSubgraphEdge(), graph_writeStp(), initReceivedSubproblem(), markPseudoDeletablesFromBounds(), propgraphApplyImplicationsPcMw(), propgraphDeleteNode(), reduce_applyPseudoDeletions(), reduce_sl(), strongPruneSteinerTreePc(), and updateNodeReplaceBounds().

◆ Edge_anti

#define Edge_anti (   a)    ((((a) % 2) > 0) ? (a) - 1 : (a) + 1)

Definition at line 106 of file graphdefs.h.

Referenced by distgraphInsertEdge(), graph_edge_redirect(), graph_edge_reinsert(), graph_knot_contract(), graph_mincut_exec(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_writeStp(), pcmwReduceKnotDeg1(), reduce_simple(), and reduce_simple_sap().

◆ Edge_even

#define Edge_even (   a)    ((((a) % 2) == 0) ? (a) : (a) - 1)

Definition at line 107 of file graphdefs.h.

Referenced by delPseudoPath(), extractSubgraphAddEdge(), graph_edge_reinsert(), graph_knot_contract(), graph_knot_replaceDeg2(), and mwTraverseChain().

◆ STP_FILE_MAGIC

#define STP_FILE_MAGIC   0x33d32945

Definition at line 111 of file graphdefs.h.

Referenced by graph_writeStp(), open_file(), and stp_save().

◆ STP_FILE_VERSION_MAJOR

#define STP_FILE_VERSION_MAJOR   1

Definition at line 112 of file graphdefs.h.

Referenced by graph_writeStp(), open_file(), and stp_save().

◆ STP_FILE_VERSION_MINOR

#define STP_FILE_VERSION_MINOR   0

Definition at line 113 of file graphdefs.h.

Referenced by graph_writeStp(), open_file(), and stp_save().

Typedef Documentation

◆ FIXED

typedef struct fixed_graph_components FIXED

fixed graph components

Definition at line 119 of file graphdefs.h.

◆ PSEUDOANS

typedef struct pseudo_ancestors PSEUDOANS

node ancestors resulting from pseudo-elimination

Definition at line 123 of file graphdefs.h.

◆ CSRDEPO

typedef struct compressed_sparse_storages_depository CSRDEPO

depository for several CSR storages

Definition at line 127 of file graphdefs.h.

◆ SDPROFIT

typedef struct special_distance_implied_profit SDPROFIT

bottleneck Steiner distance (implied) profit

Definition at line 130 of file graphdefs.h.

◆ SUBINOUT

typedef struct subgraph_extraction_insertion SUBINOUT

helper needed for extracting and reinserting subgraph

Definition at line 134 of file graphdefs.h.

◆ CSR

typedef struct csr_storage CSR

CSR like graph storage

◆ RANGE

typedef struct csr_range RANGE

for dynamic CSR

◆ DCSR

typedef struct dynamic_csr_storage DCSR

dynamic CSR

◆ SINGLETONANS

typedef struct singleton_ancestors_edge SINGLETONANS

singleton ancestors for given undirected edge

◆ PRESOL

typedef struct presolve_info PRESOL

◆ PATH

typedef struct shortest_path PATH

ONE segment of a path

◆ TPATHS

typedef struct nodes_to_terminal_paths TPATHS

Steiner nodes to terminal paths

Definition at line 291 of file graphdefs.h.

◆ DENTRY

typedef struct dijkstra_heap_entry DENTRY

heap entry

◆ DHEAP

typedef struct dijkstra_heap DHEAP

Dijkstra heap

◆ DIJK

typedef struct dijkstra_data DIJK

Dijkstra data

◆ VNOI

typedef struct voronoi_storage VNOI

Voronoi data

◆ SDCLIQUE

typedef struct special_distance_clique SDCLIQUE

Stores data for computation of special distance/bottleneck distance clique computations

Enumeration Type Documentation

◆ FILETYPE

enum FILETYPE
Enumerator
FF_BEA 
FF_STP 
FF_PRB 
FF_GRD 

Definition at line 115 of file graphdefs.h.