SCIP
Solving Constraint Integer Programs
GRAPH Struct Reference
Detailed Description
#include <grph.h>
Data Fields | |
| int | norgmodelknots |
| 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 |
| IDX * | fixedges |
| IDX ** | ancestors |
| IDX ** | pcancestors |
| int | norgmodeledges |
| int | hoplimit |
| int | esize |
| int | edges |
| int | orgedges |
| SCIP_Real * | cost |
| int *RESTRICT | tail |
| int *RESTRICT | head |
| int *RESTRICT | orgtail |
| int *RESTRICT | orghead |
| int *RESTRICT | rootedgeprevs |
| int *RESTRICT | ieat |
| int *RESTRICT | oeat |
| 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 | extended |
Field Documentation
◆ norgmodelknots
| int GRAPH::norgmodelknots |
Number of nodes in the original model
Definition at line 60 of file grph.h.
Referenced by buildsolgraph(), compEdges(), graph_copy_data(), graph_free_historyDeep(), graph_init(), graph_pack(), graph_pc_2pc(), graph_pc_2rmw(), graph_pc_2rpc(), SCIPprobdataWriteSolution(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurPruneRun(), SCIPStpHeurRecExclude(), and SCIPStpHeurSlackPruneRunPcMw().
◆ ksize
| int GRAPH::ksize |
Count of allocated knot slots
Definition at line 61 of file grph.h.
Referenced by compEdges(), graph_copy(), graph_copy_data(), graph_init(), graph_knot_add(), graph_pc_2pc(), graph_pc_2rmw(), graph_pc_2rpc(), graph_pc_getRsap(), graph_pc_getSap(), graph_pc_getSapShift(), and graph_resize().
◆ knots
| int GRAPH::knots |
Count of nodes in graph
Definition at line 62 of file grph.h.
Referenced by bea_save(), bottleneckRuleOut(), buildsolgraph(), central_terminal(), compEdges(), computeDegConsTree(), computeNewSols(), computePertubedSol(), computeSteinerTree(), computeSteinerTreeDijk(), computeSteinerTreeVnoi(), computeTransVoronoi(), createPrizeConstraints(), createVariables(), cut_add(), dualascent_init(), dualCostIsValid(), dualcostVarfixing(), findDaRoots(), getlecloseterms(), getRSD(), globalrelabel(), graph_copy_data(), graph_get2next(), graph_get3next(), graph_get3nextTerms(), graph_get4next(), graph_get4nextTerms(), graph_get4nextTTerms(), graph_get_csr(), graph_get_NVET(), graph_init(), graph_init_history(), graph_knot_add(), graph_load(), graph_mincut_exec(), graph_mincut_exit(), graph_mincut_init(), graph_next_term(), graph_pack(), graph_path_exec(), graph_path_execX(), graph_path_init(), graph_path_invroot(), graph_path_st(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_full(), graph_path_st_rmw(), graph_path_st_rpc(), graph_pc_2mw(), graph_pc_2org(), graph_pc_2pc(), graph_pc_2rmw(), graph_pc_2rpc(), graph_pc_2trans(), graph_pc_getPosPrizeSum(), graph_pc_getRsap(), graph_pc_getSap(), graph_pc_getSapShift(), graph_pc_term2edgeConsistent(), graph_resize(), graph_show(), graph_sol_getOrg(), graph_sol_reroot(), graph_sol_valid(), graph_termsReachable(), graph_trail(), graph_trail_arr(), graph_valid(), graph_voronoi(), graph_voronoiExtend(), graph_voronoiMw(), graph_voronoiRepair(), graph_voronoiRepairMult(), graph_voronoiTerms(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), initialise(), initReceivedSubproblem(), is_maxprize(), level0(), level0save(), pertubateEdgeCosts(), pricing(), probdataPrintGraph(), reduce_ans(), reduce_ansAdv(), reduce_ansAdv2(), reduce_bd34(), reduce_bdr(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_boundPrune(), reduce_chain2(), reduce_check3Tree(), reduce_cnsAdv(), reduce_da(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_daSlackPruneMw(), reduce_extendedEdge(), reduce_getSd(), reduce_getSdPcMw(), reduce_ledge(), reduce_nnp(), reduce_npv(), reduce_nts(), reduce_nv(), reduce_nvAdv(), reduce_rpt(), reduce_sd(), reduce_sdPc(), reduce_sdsp(), reduce_sdspSap(), reduce_simple(), reduce_simple_hc(), reduce_simple_mw(), reduce_simple_pc(), reduce_simple_sap(), reduce_sl(), reduceCheckEdge(), reduceHc(), reduceMw(), reduceNw(), reducePc(), reducePcMw(), reduceRedcostExtended(), reduceSap(), reduceSPG(), reduceStp(), reduceWithEdgeFixingBounds(), reduceWithNodeFixingBounds(), reduceWithNodeReplaceBounds(), reinitialise(), SCIP_DECL_CONSPROP(), SCIP_DECL_CONSSEPALP(), SCIP_DECL_HEUREXEC(), SCIPprobdataAddNewSol(), SCIPprobdataCreate(), SCIPprobdataPrintGraph2(), SCIPprobdataWriteSolution(), SCIPprobdataWriteStp(), SCIPStpBranchruleInitNodeState(), SCIPStpDualAscent(), SCIPStpDualAscentPcMw(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalRun(), SCIPStpHeurPruneRun(), SCIPStpHeurPruneUpdateSols(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), SCIPStpHeurSlackPruneRun(), SCIPStpHeurSlackPruneRunPcMw(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMCompStarts(), SCIPStpHeurTMPrune(), SCIPStpHeurTMPrunePc(), SCIPStpHeurTMRun(), SCIPStpHeurTMRunLP(), SCIPStpValidateSol(), SCIPwriteStp(), selectBranchingVertexByDegree(), selectBranchingVertexByLp(), selectBranchingVertexByLp2Flow(), selectBranchingVertexBySol(), sep_2cut(), sep_flow(), setNodeSolArray(), setVnoiDistances(), stp_save(), updateEdgeFixingBounds(), updateFixingBounds(), updateNodeFixingBounds(), updateNodeReplaceBounds(), and updateSolNodeArray().
◆ orgknots
| int GRAPH::orgknots |
Count of nodes prior to graph reduction
Definition at line 63 of file grph.h.
Referenced by graph_copy_data(), graph_init(), graph_pack(), SCIPprobdataWriteSolution(), and SCIPStpHeurRecRun().
◆ terms
| int GRAPH::terms |
Count of terminals
Definition at line 64 of file grph.h.
Referenced by bea_save(), buildsolgraph(), compEdges(), computeDegConsTree(), computeSteinerTreeVnoi(), createPrizeConstraints(), createVariables(), findDaRoots(), getlecloseterms(), graph_copy_data(), graph_init(), graph_knot_add(), graph_knot_chg(), graph_load(), graph_pack(), graph_path_st(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_full(), graph_path_st_rmw(), graph_path_st_rpc(), graph_pc_2mw(), graph_pc_2pc(), graph_pc_2rmw(), graph_pc_2rpc(), graph_pc_getSap(), graph_pc_getSapShift(), graph_pc_knot2nonTerm(), graph_sol_valid(), graph_valid(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), pertubateEdgeCosts(), redLoopMw(), redLoopPc(), reduce_bound(), reduce_boundMw(), reduce_boundPrune(), reduce_da(), reduce_daPcMw(), reduce_daSlackPruneMw(), reduce_nv(), reduce_nvAdv(), reduce_sd(), reduce_sdPc(), reduce_sl(), reduceMw(), reduceNw(), reducePc(), reduceSap(), reduceStp(), SCIP_DECL_CONSSEPALP(), SCIP_DECL_HEUREXEC(), SCIPprobdataCreate(), SCIPprobdataWriteSolution(), SCIPprobdataWriteStp(), SCIPStpDualAscent(), SCIPStpDualAscentPcMw(), SCIPStpHeurLocalRun(), SCIPStpHeurPruneRun(), SCIPStpHeurRecRun(), SCIPStpHeurSlackPruneRun(), SCIPStpHeurSlackPruneRunPcMw(), SCIPStpHeurTMCompStarts(), SCIPStpHeurTMPrune(), SCIPStpHeurTMRun(), SCIPwriteStp(), sep_2cut(), sep_flow(), and stp_save().
◆ layers
| int GRAPH::layers |
Count of different networks
Definition at line 65 of file grph.h.
Referenced by central_terminal(), graph_copy(), graph_init(), graph_knot_contract(), graph_pack(), graph_resize(), nail(), SCIPprobdataCreate(), SCIPStpValidateSol(), and sep_flow().
◆ orgsource
| int GRAPH::orgsource |
root of unreduced graph
Definition at line 66 of file grph.h.
Referenced by graph_copy_data(), graph_init(), graph_pack(), SCIPprobdataCreate(), and SCIPprobdataWriteSolution().
◆ source
| int GRAPH::source |
The root
Definition at line 67 of file grph.h.
Referenced by adjust0term(), ansProcessCandidate(), buildsolgraph(), central_terminal(), compEdges(), computeNewSols(), computePertubedSol(), computeSteinerTree(), computeSteinerTreeVnoi(), computeTransVoronoi(), createConstraints(), createPrizeConstraints(), createVariables(), cut_add(), dualCostIsValid(), findDaRoots(), getlecloseterms(), graph_copy_data(), graph_get2next(), graph_get3next(), graph_get4next(), graph_init(), graph_knot_contract(), graph_load(), graph_obstgrid_create(), graph_pack(), graph_path_invroot(), graph_path_st_pcmw_extend(), graph_path_st_rmw(), graph_path_st_rpc(), graph_pc_2org(), graph_pc_2pc(), graph_pc_2rmw(), graph_pc_2rpc(), graph_pc_2trans(), graph_pc_adaptSap(), graph_pc_chgPrize(), graph_pc_contractEdge(), graph_pc_deleteTerm(), graph_pc_getPosPrizeSum(), graph_pc_getRsap(), graph_pc_getSap(), graph_pc_getSapShift(), graph_pc_mw2rmw(), graph_pc_presolInit(), graph_pc_subtractPrize(), graph_pc_term2edgeConsistent(), graph_pc_updateTerm2edge(), graph_sol_valid(), graph_termsReachable(), graph_valid(), graph_voronoi(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), is_maxprize(), level0(), level0save(), markPcMwRoots(), pertubateEdgeCosts(), probdataPrintGraph(), redLoopPc(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_boundPrune(), reduce_da(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_daSlackPruneMw(), reduce_ledge(), reduce_npv(), reduce_nv(), reduce_nvAdv(), reduce_rpt(), reduce_sd(), reduce_sdPc(), reduce_simple_hc(), reduce_simple_mw(), reduce_simple_pc(), reduce_simple_sap(), reduce_sl(), reducePcMw(), reduceRedcostExtended(), removeEdge(), SCIP_DECL_HEUREXEC(), SCIPprobdataAddNewSol(), SCIPprobdataCreate(), SCIPprobdataGetRoot(), SCIPprobdataPrintGraph2(), SCIPprobdataWriteSolution(), SCIPStpDualAscent(), SCIPStpDualAscentPcMw(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalRun(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), SCIPStpHeurSlackPruneRun(), SCIPStpHeurSlackPruneRunPcMw(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMCompStarts(), SCIPStpHeurTMPrune(), SCIPStpHeurTMPrunePc(), SCIPStpHeurTMRun(), SCIPStpHeurTMRunLP(), SCIPStpValidateSol(), SCIPwriteStp(), sep_2cut(), sep_flow(), setVnoiDistances(), trydg1edgepc(), and updateSolNodeArray().
◆ term
| int* RESTRICT GRAPH::term |
Array [0..nodes-1] of networknumber for knot [i], -1 if [i] is never a terminal
Definition at line 68 of file grph.h.
Referenced by adjterms(), adjust0term(), ansProcessCandidate(), bea_save(), branchOnVertex(), buildsolgraph(), central_terminal(), compEdges(), computeDegConsTree(), computePertubedSol(), computeSteinerTree(), computeSteinerTreeVnoi(), computeTransVoronoi(), createConstraints(), createVariables(), dualascent_init(), dualCostIsValid(), dualcostVarfixing(), findDaRoots(), getcloseterms2term(), getlecloseterms(), getRSD(), graph_copy_data(), graph_edge_printInfo(), graph_free(), graph_get2next(), graph_get3next(), graph_get4next(), graph_get4nextTTerms(), graph_get_NVET(), graph_init(), graph_knot_add(), graph_knot_chg(), graph_knot_contract(), graph_load(), graph_pack(), graph_path_PcMwSd(), graph_path_st(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_full(), graph_path_st_pcmw_reduce(), graph_path_st_rmw(), graph_path_st_rpc(), graph_pc_2mw(), graph_pc_2org(), graph_pc_2pc(), graph_pc_2rmw(), graph_pc_2rpc(), graph_pc_2trans(), graph_pc_chgPrize(), graph_pc_contractEdge(), graph_pc_deleteTerm(), graph_pc_getPosPrizeSum(), graph_pc_getRsap(), graph_pc_getSap(), graph_pc_getSapShift(), graph_pc_knot2nonTerm(), graph_pc_mw2rmw(), graph_pc_subtractPrize(), graph_pc_term2edgeConsistent(), graph_pc_updateTerm2edge(), graph_resize(), graph_sdPaths(), graph_show(), graph_sol_reroot(), graph_sol_valid(), graph_termsReachable(), graph_valid(), graph_voronoiExtend(), graph_voronoiMw(), graph_voronoiTerms(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), initReceivedSubproblem(), is_maxprize(), level0(), level0save(), markPcMwRoots(), nchains(), nodeIsCrucial(), pertubateEdgeCosts(), probdataPrintGraph(), reduce_ans(), reduce_ansAdv(), reduce_ansAdv2(), reduce_bd34(), reduce_bdr(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_boundPrune(), reduce_chain2(), reduce_check3Tree(), reduce_cnsAdv(), reduce_da(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_daSlackPruneMw(), reduce_getSd(), reduce_getSdPcMw(), reduce_ledge(), reduce_npv(), reduce_nts(), reduce_nv(), reduce_nvAdv(), reduce_rpt(), reduce_sd(), reduce_sdPc(), reduce_sdsp(), reduce_simple(), reduce_simple_hc(), reduce_simple_mw(), reduce_simple_pc(), reduce_simple_sap(), reduce_sl(), reduceCheckEdge(), reducePcMw(), reduceSPG(), reduceWithEdgeFixingBounds(), reduceWithNodeFixingBounds(), reduceWithNodeReplaceBounds(), ruleOutSubtree(), SCIP_DECL_CONSPROP(), SCIP_DECL_CONSSEPALP(), SCIP_DECL_HEUREXEC(), SCIPprobdataAddNewSol(), SCIPprobdataCreate(), SCIPprobdataPrintGraph2(), SCIPprobdataWriteSolution(), SCIPprobdataWriteStp(), SCIPStpBranchruleInitNodeState(), SCIPStpDualAscent(), SCIPStpDualAscentPcMw(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalRun(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), SCIPStpHeurSlackPruneRunPcMw(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMCompStarts(), SCIPStpHeurTMPrune(), SCIPStpHeurTMPrunePc(), SCIPStpHeurTMRun(), SCIPStpHeurTMRunLP(), SCIPStpValidateSol(), SCIPwriteStp(), sddeltable(), selectBranchingVertexByDegree(), selectBranchingVertexByLp(), selectBranchingVertexByLp2Flow(), selectBranchingVertexBySol(), selectdiffsols(), sep_2cut(), sep_flow(), stp_save(), STPStpBranchruleParseConsname(), traverseChain(), truncateSubtree(), trydg1edgepc(), updateEdgeFixingBounds(), updateFixingBounds(), updateNodeFixingBounds(), updateNodeReplaceBounds(), updateSolNodeArray(), and utdist().
◆ 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 70 of file grph.h.
Referenced by adjterms(), ansProcessCandidate(), central_terminal(), computeDegConsTree(), computeNewSols(), computeSteinerTree(), computeSteinerTreeDijk(), computeSteinerTreeVnoi(), computeTransVoronoi(), createVariables(), cut_add(), findDaRoots(), getlecloseterms(), graph_copy_data(), graph_free(), graph_get2next(), graph_get3next(), graph_get3nextTerms(), graph_get4next(), graph_get4nextTerms(), graph_get4nextTTerms(), graph_init(), graph_knot_add(), graph_pack(), graph_path_exec(), graph_path_execX(), graph_path_invroot(), graph_path_PcMwSd(), graph_path_st(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_full(), graph_path_st_rmw(), graph_path_st_rpc(), graph_pc_2org(), graph_pc_2trans(), graph_pc_chgPrize(), graph_pc_contractEdge(), graph_pc_deleteTerm(), graph_pc_getRsap(), graph_pc_getSapShift(), graph_pc_subtractPrize(), graph_resize(), graph_sdPaths(), graph_sol_reroot(), graph_termsReachable(), graph_trail(), graph_trail_arr(), graph_valid(), graph_voronoiExtend(), graph_voronoiMw(), graph_voronoiRepair(), graph_voronoiRepairMult(), graph_voronoiTerms(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), is_maxprize(), level0(), level0save(), pricing(), reduce_ans(), reduce_ansAdv(), reduce_ansAdv2(), reduce_bd34(), reduce_bdr(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_boundPrune(), reduce_chain2(), reduce_cnsAdv(), reduce_da(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_daSlackPruneMw(), reduce_extendedEdge(), reduce_ledge(), reduce_nnp(), reduce_npv(), reduce_nts(), reduce_nv(), reduce_nvAdv(), reduce_sd(), reduce_sdPc(), reduce_sdsp(), reduce_sdspSap(), reduce_simple_mw(), reduce_simple_pc(), reduce_simple_sap(), reduce_sl(), reducePcMw(), reduceSPG(), reduceWithEdgeFixingBounds(), reduceWithNodeFixingBounds(), SCIPprobdataAddNewSol(), SCIPprobdataPrintGraph2(), SCIPprobdataWriteSolution(), SCIPStpDualAscentPcMw(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurLocalRun(), SCIPStpHeurPruneUpdateSols(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMCompStarts(), SCIPStpHeurTMPrune(), SCIPStpHeurTMPrunePc(), SCIPStpHeurTMRun(), sep_2cut(), setVnoiDistances(), traverseChain(), trydg1edgepc(), updateEdgeFixingBounds(), and updateNodeFixingBounds().
◆ grad
| int* RESTRICT GRAPH::grad |
Array [0..nodes-1] with degree of knot [i]
Definition at line 73 of file grph.h.
Referenced by adjust0term(), ansProcessCandidate(), central_terminal(), computeDegConsTree(), computeNewSols(), computeSteinerTree(), computeSteinerTreeDijk(), computeSteinerTreeVnoi(), computeTransVoronoi(), dualascent_init(), findDaRoots(), getlecloseterms(), graph_copy_data(), graph_edge_add(), graph_edge_del(), graph_edge_hide(), graph_edge_redirect(), graph_free(), graph_get3nextTerms(), graph_get4nextTerms(), graph_get4nextTTerms(), graph_get_NVET(), graph_init(), graph_knot_add(), graph_knot_contract(), graph_knot_contractLowdeg2High(), graph_knot_delPseudo(), graph_load(), graph_pack(), graph_path_PcMwSd(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_full(), graph_path_st_rmw(), graph_path_st_rpc(), graph_pc_2org(), graph_pc_2rmw(), graph_pc_2trans(), graph_pc_contractEdge(), graph_pc_deleteTerm(), graph_pc_getRsap(), graph_pc_getSapShift(), graph_pc_mw2rmw(), graph_pc_presolInit(), graph_resize(), graph_sdPaths(), graph_show(), graph_sol_reroot(), graph_sol_valid(), graph_trail(), graph_trail_arr(), graph_uncover(), graph_valid(), is_maxprize(), level0(), level0save(), nchains(), orderDaRoots(), pertubateEdgeCosts(), redLoopPc(), reduce_ans(), reduce_ansAdv(), reduce_ansAdv2(), reduce_bd34(), reduce_bdr(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_boundPrune(), reduce_chain2(), reduce_check3Tree(), reduce_cnsAdv(), reduce_da(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_daSlackPruneMw(), reduce_extendedEdge(), reduce_ledge(), reduce_npv(), reduce_nts(), reduce_nv(), reduce_nvAdv(), reduce_rpt(), reduce_sd(), reduce_sdPc(), reduce_sdsp(), reduce_sdspSap(), reduce_simple(), reduce_simple_mw(), reduce_simple_pc(), reduce_simple_sap(), reduce_sl(), reduceCheckEdge(), reducePcMw(), reduceSPG(), reduceWithNodeFixingBounds(), reduceWithNodeReplaceBounds(), SCIPStpBranchruleInitNodeState(), SCIPStpDualAscent(), SCIPStpDualAscentPcMw(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalRun(), SCIPStpHeurPruneUpdateSols(), SCIPStpHeurSlackPruneRun(), SCIPStpHeurSlackPruneRunPcMw(), SCIPStpHeurTMRun(), SCIPStpHeurTMRunLP(), SCIPStpValidateSol(), selectBranchingVertexByDegree(), selectBranchingVertexByLp2Flow(), selectBranchingVertexBySol(), setVnoiDistances(), traverseChain(), truncateSubtree(), trydg1edgepc(), 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 74 of file grph.h.
Referenced by branchOnVertex(), compEdges(), createVariables(), dualascent_init(), extendSubtreeTail(), findDaRoots(), getlecloseterms(), graph_copy_data(), graph_edge_add(), graph_edge_redirect(), graph_free(), graph_get_csr(), graph_init(), graph_knot_add(), graph_knot_contract(), graph_load(), graph_path_invroot(), graph_pc_2mw(), graph_pc_2rmw(), graph_pc_chgPrize(), graph_pc_contractEdge(), graph_pc_getSapShift(), graph_pc_presolInit(), graph_pc_subtractPrize(), graph_resize(), graph_show(), graph_sol_reroot(), graph_sol_valid(), graph_uncover(), graph_valid(), initReceivedSubproblem(), level0(), level0save(), markPcMwRoots(), pertubateEdgeCosts(), reduce_boundHopRc(), reduce_check3Tree(), reduce_daSlackPrune(), reduce_rpt(), reduce_simple(), reduce_simple_hc(), reduce_simple_mw(), reduce_simple_pc(), reduce_simple_sap(), reduceCheckEdge(), removeEdge(), ruleOutSubtree(), SCIPprobdataAddNewSol(), SCIPStpDualAscentPcMw(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalRun(), SCIPStpHeurRecRun(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMPrune(), SCIPStpHeurTMPrunePc(), selectBranchingVertexByLp(), selectBranchingVertexByLp2Flow(), sep_2cut(), sep_flow(), and trydg1edgepc().
◆ outbeg
| int* RESTRICT GRAPH::outbeg |
Array [0..nodes-1] with starting slot index for the oeat array, -1 if not used
Definition at line 76 of file grph.h.
Referenced by adjust0term(), ansProcessCandidate(), buildsolgraph(), computeDegConsTree(), computePertubedSol(), computeSteinerTreeVnoi(), computeTransVoronoi(), createVariables(), dfsorder(), dualCostIsValid(), dualcostVarfixing(), extendSubtreeHead(), findDaRoots(), getcloseterms2term(), getlecloseterms(), getRSD(), graph_copy_data(), graph_edge_add(), graph_edge_redirect(), graph_free(), graph_get2next(), graph_get3next(), graph_get4next(), graph_get4nextTTerms(), graph_init(), graph_knot_add(), graph_knot_contract(), graph_knot_del(), graph_knot_delPseudo(), graph_mincut_exec(), graph_pack(), graph_path_exec(), graph_path_execX(), graph_path_PcMwSd(), graph_path_st(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_full(), graph_path_st_pcmw_reduce(), graph_path_st_rmw(), graph_path_st_rpc(), graph_pc_adaptSap(), graph_pc_chgPrize(), graph_pc_contractEdge(), graph_pc_contractEdgeAncestors(), graph_pc_deleteTerm(), graph_pc_getRsap(), graph_pc_getSapShift(), graph_pc_mw2rmw(), graph_pc_presolInit(), graph_pc_subtractPrize(), graph_pc_term2edgeConsistent(), graph_resize(), graph_sdPaths(), graph_show(), graph_sol_reroot(), graph_sol_valid(), graph_trail(), graph_trail_arr(), graph_uncover(), graph_valid(), graph_voronoi(), graph_voronoiExtend(), graph_voronoiMw(), graph_voronoiRepair(), graph_voronoiRepairMult(), graph_voronoiTerms(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), lca(), nodeIsCrucial(), reduce_ans(), reduce_ansAdv(), reduce_ansAdv2(), reduce_bd34(), reduce_bdr(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_boundPrune(), reduce_chain2(), reduce_check3Tree(), reduce_cnsAdv(), reduce_da(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_daSlackPruneMw(), reduce_getSd(), reduce_getSdPcMw(), reduce_ledge(), reduce_nnp(), reduce_npv(), reduce_nts(), reduce_nv(), reduce_nvAdv(), reduce_sd(), reduce_sdPc(), reduce_sdsp(), reduce_sdspSap(), reduce_simple(), reduce_simple_hc(), reduce_simple_mw(), reduce_simple_pc(), reduce_simple_sap(), reduce_sl(), reduceCheckEdge(), reducePcMw(), reduceSPG(), reduceWithEdgeFixingBounds(), reduceWithNodeReplaceBounds(), removeEdge(), ruleOutSubtree(), SCIP_DECL_HEUREXEC(), SCIPprobdataWriteSolution(), SCIPStpDualAscentPcMw(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurLocalRun(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMPrune(), SCIPStpHeurTMPrunePc(), SCIPStpHeurTMRun(), SCIPStpValidateSol(), SCIPwriteStp(), sddeltable(), selectBranchingVertexBySol(), sep_2cut(), sep_flow(), setVnoiDistances(), trail(), traverseChain(), truncateSubtree(), trydg1edgepc(), updateEdgeFixingBounds(), updateFixingBounds(), and updateNodeReplaceBounds().
◆ maxdeg
| int* RESTRICT GRAPH::maxdeg |
For HCDSTP: Array [0..nodes-1] containing the maximal degrees of all nodes
Definition at line 78 of file grph.h.
Referenced by buildsolgraph(), computeDegConsTree(), createDegreeConstraints(), graph_copy_data(), graph_free(), graph_init(), graph_load(), graph_pack(), SCIP_DECL_CONSPROP(), SCIPStpHeurTMRunLP(), and SCIPStpValidateSol().
◆ term2edge
| int* GRAPH::term2edge |
(R)PCSTP and (R)MWCSP: Array [0..nodes-1] of edge to twin terminal or -1
Definition at line 80 of file grph.h.
Referenced by adjust0term(), buildsolgraph(), findDaRoots(), graph_copy_data(), graph_free(), graph_init(), graph_pc_2pc(), graph_pc_2rmw(), graph_pc_2rpc(), graph_pc_contractEdge(), graph_pc_deleteTerm(), graph_pc_getRsap(), graph_pc_init(), graph_pc_knot2nonTerm(), graph_pc_mw2rmw(), graph_pc_term2edgeConsistent(), graph_pc_updateTerm2edge(), graph_valid(), markPcMwRoots(), SCIPStpHeurAscendPruneRun(), and SCIPStpHeurRecRun().
◆ prize
| SCIP_Real* GRAPH::prize |
For (R)PCSTP and (R)MWCSP: Array [0..nodes-1] of node costs
Definition at line 82 of file grph.h.
Referenced by adjust0term(), ansProcessCandidate(), buildsolgraph(), compEdges(), createVariables(), findDaRoots(), graph_copy_data(), graph_free(), graph_init(), graph_load(), graph_pack(), graph_path_PcMwSd(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_rmw(), graph_path_st_rpc(), graph_pc_2mw(), graph_pc_2pc(), graph_pc_2rmw(), graph_pc_2rpc(), graph_pc_chgPrize(), graph_pc_contractEdge(), graph_pc_getPosPrizeSum(), graph_pc_getRsap(), graph_pc_getSap(), graph_pc_getSapShift(), graph_pc_init(), graph_pc_mw2rmw(), graph_pc_subtractPrize(), graph_valid(), graph_voronoiMw(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), is_maxprize(), markPcMwRoots(), redLoopPc(), reduce_ans(), reduce_ansAdv(), reduce_ansAdv2(), reduce_bound(), reduce_boundMw(), reduce_boundPrune(), reduce_chain2(), reduce_cnsAdv(), reduce_daPcMw(), reduce_getSd(), reduce_getSdPcMw(), reduce_nnp(), reduce_npv(), reduce_nv(), reduce_nvAdv(), reduce_sdPc(), reduce_sdsp(), reduce_simple_mw(), reduce_simple_pc(), reduce_sl(), reduceSPG(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalRun(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), SCIPStpHeurTMRun(), traverseChain(), and trydg1edgepc().
◆ fixedges
| IDX* GRAPH::fixedges |
list of fixed edges
Definition at line 85 of file grph.h.
Referenced by getlecloseterms(), graph_free_historyDeep(), graph_init(), graph_pack(), graph_sol_getOrg(), redbasedVarfixing(), reduce_contractZeroEdges(), reduce_nv(), reduce_nvAdv(), reduce_rpt(), reduce_simple(), reduce_simple_pc(), reduce_simple_sap(), reduce_sl(), SCIPprobdataWriteSolution(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), SCIPStpHeurSlackPruneRunPcMw(), and trydg1edgepc().
◆ ancestors
| IDX** GRAPH::ancestors |
list of ancestor edges to each edge (to keep track of reductions)
Definition at line 86 of file grph.h.
Referenced by getlecloseterms(), graph_edge_del(), graph_edge_reinsert(), graph_free_history(), graph_get_edgeConflicts(), graph_init(), graph_init_history(), graph_knot_contract(), graph_knot_delPseudo(), graph_pack(), graph_pc_contractEdgeAncestors(), graph_sol_getOrg(), markAncestors(), markAncestorsConflict(), redbasedVarfixing(), reduce_contractZeroEdges(), reduce_deleteConflictEdges(), reduce_nv(), reduce_nvAdv(), reduce_rpt(), reduce_simple(), reduce_simple_pc(), reduce_simple_sap(), reduce_sl(), ruleOutSubtree(), SCIPprobdataWriteSolution(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), SCIPStpHeurSlackPruneRunPcMw(), traverseChain(), trydg1edgepc(), unmarkAncestors(), and unmarkAncestorsConflict().
◆ pcancestors
| IDX** GRAPH::pcancestors |
list of ancestor edges to each node (to keep track of PC/MW reductions )
Definition at line 87 of file grph.h.
Referenced by graph_free_historyDeep(), graph_init(), graph_init_history(), graph_pack(), graph_pc_contractEdge(), graph_pc_contractEdgeAncestors(), graph_sol_getOrg(), reduce_simple_pc(), SCIPprobdataWriteSolution(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), SCIPStpHeurSlackPruneRunPcMw(), and trydg1edgepc().
◆ norgmodeledges
| int GRAPH::norgmodeledges |
Count of edges prior to graph transformation
Definition at line 88 of file grph.h.
Referenced by compEdges(), graph_copy_data(), graph_init(), graph_pack(), graph_pc_2pc(), graph_pc_2rmw(), graph_pc_2rpc(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurPruneRun(), and SCIPStpHeurSlackPruneRunPcMw().
◆ hoplimit
| int GRAPH::hoplimit |
maximal number of edges allowed for a solution to be feasible (only used for HCDSTPs)
Definition at line 89 of file grph.h.
Referenced by buildsolgraph(), createHopConstraint(), getlecloseterms(), graph_copy_data(), graph_init(), graph_load(), graph_pack(), reduce_boundHop(), reduce_boundHopR(), SCIPStpHeurTMRun(), and SCIPwriteStp().
◆ esize
| int GRAPH::esize |
Count of allocated edge slots
Definition at line 91 of file grph.h.
Referenced by compEdges(), graph_copy(), graph_copy_data(), graph_edge_add(), graph_init(), graph_pc_2pc(), graph_pc_2rmw(), graph_pc_2rpc(), graph_pc_getRsap(), graph_pc_getSap(), graph_pc_getSapShift(), and graph_resize().
◆ edges
| int GRAPH::edges |
Count of edges in the graph
Definition at line 92 of file grph.h.
Referenced by adjterms(), bea_save(), buildsolgraph(), central_terminal(), compEdges(), computeDaSolPcMw(), computeDegConsTree(), computeNewSols(), computePertubedSol(), computeSteinerTreeVnoi(), computeTransVoronoi(), copy_graph(), createPrizeConstraints(), createVariables(), cut_add(), dualcostVarfixing(), getlecloseterms(), graph_copy_data(), graph_edge_add(), graph_free_history(), graph_get4nextTTerms(), graph_get_edgeConflicts(), graph_init(), graph_init_history(), graph_load(), graph_mincut_exec(), graph_mincut_init(), graph_pack(), graph_pc_2pc(), graph_pc_2rmw(), graph_pc_2rpc(), graph_pc_getRsap(), graph_pc_getSap(), graph_pc_getSapShift(), graph_pc_presolInit(), graph_pc_updateTerm2edge(), graph_resize(), graph_show(), graph_sol_getOrg(), graph_sol_unreduced(), graph_uncover(), graph_valid(), graph_voronoiWithDist(), initialise(), markAncestors(), markAncestorsConflict(), maxflow(), nail(), nchains(), pertubateEdgeCosts(), probdataPrintGraph(), prune(), redbasedVarfixing(), reduce_bdr(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_boundPrune(), reduce_check3Tree(), reduce_contractZeroEdges(), reduce_da(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_daSlackPruneMw(), reduce_deleteConflictEdges(), reduce_extendedEdge(), reduce_ledge(), reduce_nts(), reduce_sd(), reduce_sdPc(), reduce_sdspSap(), reduceCheckEdge(), reduceHc(), reduceMw(), reduceNw(), reducePc(), reducePcMw(), reduceRedcostExtended(), reduceSap(), reduceSPG(), reduceStp(), ruleOutSubtree(), tsp::ProbDataTSP::scip_copy(), SCIP_DECL_CONSLOCK(), SCIP_DECL_HEUREXEC(), SCIP_DECL_PROPEXEC(), SCIP_DECL_READERREAD(), tsp::ProbDataTSP::scip_trans(), SCIPprobdataCreate(), SCIPprobdataPrintGraph2(), SCIPprobdataWriteSolution(), SCIPprobdataWriteStp(), SCIPStpDualAscent(), SCIPStpDualAscentPcMw(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalRun(), SCIPStpHeurPruneRun(), SCIPStpHeurPruneUpdateSols(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), SCIPStpHeurSlackPruneRun(), SCIPStpHeurSlackPruneRunPcMw(), SCIPStpHeurTMPrunePc(), SCIPStpHeurTMRun(), SCIPStpHeurTMRunLP(), SCIPStpValidateSol(), SCIPwriteStp(), selectBranchingVertexBySol(), selectdiffsols(), sep_2cut(), sep_flow(), sepaSubtour(), set_capacity(), setNodeSolArray(), setVnoiDistances(), stp_save(), unmarkAncestors(), unmarkAncestorsConflict(), updateNodeReplaceBounds(), and updateSolNodeArray().
◆ orgedges
| int GRAPH::orgedges |
Definition at line 93 of file grph.h.
Referenced by graph_copy_data(), graph_get_edgeConflicts(), graph_init(), graph_pack(), markAncestors(), markAncestorsConflict(), reduce_check3Tree(), reduce_deleteConflictEdges(), reduceCheckEdge(), ruleOutSubtree(), SCIPprobdataWriteSolution(), SCIPStpHeurRecRun(), unmarkAncestors(), and unmarkAncestorsConflict().
◆ cost
| SCIP_Real* GRAPH::cost |
Array [0..edges-1] of positive edge costs
Definition at line 94 of file grph.h.
Referenced by bea_save(), buildsolgraph(), compEdges(), computeDaSolPcMw(), computeNewSols(), computePertubedSol(), createVariables(), dualascent_init(), extendSubtreeHead(), extendSubtreeTail(), findDaRoots(), getcloseterms2term(), getlecloseterms(), getRSD(), graph_copy_data(), graph_edge_add(), graph_edge_redirect(), graph_free(), graph_init(), graph_knot_contract(), graph_knot_delPseudo(), graph_load(), graph_pack(), graph_path_st_rmw(), graph_pc_2mw(), graph_pc_2rmw(), graph_pc_adaptSap(), graph_pc_chgPrize(), graph_pc_contractEdge(), graph_pc_getRsap(), graph_pc_getSap(), graph_pc_getSapShift(), graph_pc_mw2rmw(), graph_pc_subtractPrize(), graph_resize(), graph_show(), graph_sol_getOrg(), graph_valid(), graph_voronoiWithDist(), graph_voronoiWithRadius(), initReceivedSubproblem(), markPcMwRoots(), pertubateEdgeCosts(), probdataPrintGraph(), prune(), redbasedVarfixing(), reduce_bd34(), reduce_bdr(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_boundPrune(), reduce_check3Tree(), reduce_contractZeroEdges(), reduce_da(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_daSlackPruneMw(), reduce_getSd(), reduce_getSdPcMw(), reduce_ledge(), reduce_npv(), reduce_nts(), reduce_nv(), reduce_nvAdv(), reduce_rpt(), reduce_sd(), reduce_sdPc(), reduce_sdsp(), reduce_sdspSap(), reduce_simple(), reduce_simple_hc(), reduce_simple_mw(), reduce_simple_pc(), reduce_simple_sap(), reduce_sl(), reduceCheckEdge(), reduceSap(), ruleOutSubtree(), SCIP_DECL_HEUREXEC(), SCIP_DECL_PROPEXEC(), SCIPprobdataAddNewSol(), SCIPprobdataPrintGraph2(), SCIPprobdataWriteStp(), SCIPStpDualAscent(), SCIPStpDualAscentPcMw(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalRun(), SCIPStpHeurPruneRun(), SCIPStpHeurPruneUpdateSols(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), SCIPStpHeurSlackPruneRun(), SCIPStpHeurSlackPruneRunPcMw(), SCIPStpHeurTMRun(), SCIPStpHeurTMRunLP(), SCIPwriteStp(), sddeltable(), selectBranchingVertexBySol(), setNodeSolArray(), stp_save(), traverseChain(), truncateSubtree(), trydg1edgepc(), and updateSolNodeArray().
◆ tail
| int* RESTRICT GRAPH::tail |
Array [0..edges-1] of node-number of tail of edge [i]
Definition at line 95 of file grph.h.
Referenced by adjterms(), bea_save(), bottleneckRuleOut(), buildsolgraph(), computeDegConsTree(), computeSteinerTree(), computeSteinerTreeVnoi(), createVariables(), cut_add(), dualascent_init(), extendSubtreeTail(), findDaRoots(), getlecloseterms(), getRSD(), graph_copy_data(), graph_edge_add(), graph_edge_del(), graph_edge_hide(), graph_edge_printInfo(), graph_edge_redirect(), graph_free(), graph_get4nextTTerms(), graph_get_csr(), graph_init(), graph_init_history(), graph_knot_contract(), graph_knot_delPseudo(), graph_load(), graph_mincut_exec(), graph_pack(), graph_path_invroot(), graph_path_st(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_full(), graph_path_st_rmw(), graph_path_st_rpc(), graph_pc_chgPrize(), graph_pc_contractEdge(), graph_pc_getRsap(), graph_pc_getSapShift(), graph_pc_subtractPrize(), graph_resize(), graph_show(), graph_sol_getOrg(), graph_sol_reroot(), graph_sol_setNodeList(), graph_sol_valid(), graph_uncover(), graph_valid(), graph_voronoiRepair(), graph_voronoiWithDist(), graph_voronoiWithRadius(), markPcMwRoots(), nchains(), pertubateEdgeCosts(), pricing(), probdataPrintGraph(), redbasedVarfixing(), reduce_bound(), reduce_boundHop(), reduce_boundPrune(), reduce_check3Tree(), reduce_contractZeroEdges(), reduce_daSlackPrune(), reduce_daSlackPruneMw(), reduce_ledge(), reduce_nts(), reduce_nv(), reduce_nvAdv(), reduce_rpt(), reduce_sd(), reduce_sdPc(), reduce_simple_mw(), reduce_simple_pc(), reduce_simple_sap(), reduce_sl(), reduceCheckEdge(), reducePcMw(), reduceSPG(), removeEdge(), ruleOutSubtree(), SCIP_DECL_HEUREXEC(), SCIPprobdataAddNewSol(), SCIPprobdataPrintGraph2(), SCIPprobdataWriteSolution(), SCIPprobdataWriteStp(), SCIPStpDualAscent(), SCIPStpDualAscentPcMw(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalRun(), SCIPStpHeurPruneRun(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), SCIPStpHeurSlackPruneRun(), SCIPStpHeurSlackPruneRunPcMw(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMPrunePc(), SCIPStpHeurTMRunLP(), SCIPwriteStp(), sddeltable(), selectdiffsols(), setNodeSolArray(), stp_save(), trydg1edgepc(), and updateSolNodeArray().
◆ head
| int* RESTRICT GRAPH::head |
Array [0..edges-1] of node-number of head of edge [i]
Definition at line 96 of file grph.h.
Referenced by adjterms(), adjust0term(), ansProcessCandidate(), bea_save(), buildsolgraph(), computeDegConsTree(), computePertubedSol(), computeSteinerTreeVnoi(), createPrizeConstraints(), createVariables(), cut_add(), dfsorder(), dualCostIsValid(), dualcostVarfixing(), extendSubtreeHead(), findDaRoots(), getcloseterms2term(), getlecloseterms(), getRSD(), graph_copy_data(), graph_edge_add(), graph_edge_del(), graph_edge_hide(), graph_edge_printInfo(), graph_edge_redirect(), graph_free(), graph_get2next(), graph_get3next(), graph_get4next(), graph_get4nextTTerms(), graph_init(), graph_init_history(), graph_knot_contract(), graph_knot_delPseudo(), graph_mincut_exec(), graph_pack(), graph_path_exec(), graph_path_execX(), graph_path_PcMwSd(), graph_path_st(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_full(), graph_path_st_pcmw_reduce(), graph_path_st_rmw(), graph_path_st_rpc(), graph_pc_2pc(), graph_pc_2rmw(), graph_pc_2rpc(), graph_pc_chgPrize(), graph_pc_contractEdge(), graph_pc_contractEdgeAncestors(), graph_pc_deleteTerm(), graph_pc_getRsap(), graph_pc_getSapShift(), graph_pc_mw2rmw(), graph_pc_subtractPrize(), graph_pc_term2edgeConsistent(), graph_resize(), graph_sdPaths(), graph_show(), graph_sol_getOrg(), graph_sol_reroot(), graph_sol_setNodeList(), graph_sol_valid(), graph_trail(), graph_trail_arr(), graph_uncover(), graph_valid(), graph_voronoi(), graph_voronoiExtend(), graph_voronoiMw(), graph_voronoiRepair(), graph_voronoiRepairMult(), graph_voronoiTerms(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), lca(), markPcMwRoots(), nchains(), pertubateEdgeCosts(), probdataPrintGraph(), redbasedVarfixing(), reduce_ans(), reduce_ansAdv(), reduce_ansAdv2(), reduce_bd34(), reduce_bdr(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_boundPrune(), reduce_chain2(), reduce_check3Tree(), reduce_cnsAdv(), reduce_contractZeroEdges(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_daSlackPruneMw(), reduce_getSd(), reduce_getSdPcMw(), reduce_ledge(), reduce_nnp(), reduce_npv(), reduce_nts(), reduce_nv(), reduce_nvAdv(), reduce_sd(), reduce_sdPc(), reduce_sdsp(), reduce_sdspSap(), reduce_simple(), reduce_simple_mw(), reduce_simple_pc(), reduce_simple_sap(), reduce_sl(), reduceCheckEdge(), reducePcMw(), reduceSPG(), reduceWithEdgeFixingBounds(), reduceWithNodeReplaceBounds(), removeEdge(), ruleOutSubtree(), SCIP_DECL_HEUREXEC(), SCIPprobdataAddNewSol(), SCIPprobdataPrintGraph2(), SCIPprobdataWriteSolution(), SCIPprobdataWriteStp(), SCIPStpDualAscentPcMw(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalRun(), SCIPStpHeurPruneRun(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), SCIPStpHeurSlackPruneRun(), SCIPStpHeurSlackPruneRunPcMw(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMPrune(), SCIPStpHeurTMPrunePc(), SCIPStpHeurTMRun(), SCIPStpHeurTMRunLP(), SCIPwriteStp(), sddeltable(), selectdiffsols(), sep_2cut(), setNodeSolArray(), stp_save(), trail(), traverseChain(), truncateSubtree(), trydg1edgepc(), updateEdgeFixingBounds(), updateFixingBounds(), updateNodeReplaceBounds(), and updateSolNodeArray().
◆ orgtail
| int* RESTRICT GRAPH::orgtail |
Array [0..edges-1] of node-number of tail of edge [i] prior to reduction
Definition at line 97 of file grph.h.
Referenced by graph_free_historyDeep(), graph_init(), graph_init_history(), graph_pack(), marksolverts(), SCIPprobdataWriteSolution(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), SCIPStpHeurSlackPruneRunPcMw(), 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 98 of file grph.h.
Referenced by graph_free_historyDeep(), graph_init(), graph_init_history(), graph_pack(), marksolverts(), SCIPprobdataWriteSolution(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), SCIPStpHeurSlackPruneRunPcMw(), and updateorgsol().
◆ rootedgeprevs
| int* RESTRICT GRAPH::rootedgeprevs |
Array [0..edges-1] for PC and MW problems
Definition at line 99 of file grph.h.
Referenced by graph_free(), graph_init(), graph_pc_presolExit(), graph_pc_presolInit(), and removeEdge().
◆ ieat
| int* RESTRICT GRAPH::ieat |
Array [0..edges-1], incoming edge allocation table
Definition at line 102 of file grph.h.
Referenced by bea_save(), branchOnVertex(), compEdges(), createVariables(), dualascent_init(), extendSubtreeTail(), findDaRoots(), getlecloseterms(), graph_copy_data(), graph_edge_add(), graph_edge_del(), graph_edge_hide(), graph_edge_redirect(), graph_free(), graph_get_csr(), graph_init(), graph_knot_contract(), graph_load(), graph_pack(), graph_path_invroot(), graph_pc_2mw(), graph_pc_2rmw(), graph_pc_chgPrize(), graph_pc_getSapShift(), graph_pc_presolInit(), graph_pc_subtractPrize(), graph_resize(), graph_show(), graph_sol_reroot(), graph_sol_valid(), graph_uncover(), graph_valid(), initReceivedSubproblem(), markPcMwRoots(), pertubateEdgeCosts(), redbasedVarfixing(), reduce_boundHopRc(), reduce_check3Tree(), reduce_daSlackPrune(), reduce_rpt(), reduce_simple(), reduce_simple_hc(), reduce_simple_mw(), reduce_simple_pc(), reduce_simple_sap(), reduceCheckEdge(), removeEdge(), ruleOutSubtree(), SCIPprobdataAddNewSol(), SCIPStpDualAscentPcMw(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalRun(), SCIPStpHeurRecRun(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMPrune(), SCIPStpHeurTMPrunePc(), SCIPwriteStp(), sddeltable(), selectBranchingVertexByLp(), selectBranchingVertexByLp2Flow(), sep_2cut(), sep_flow(), stp_save(), and trydg1edgepc().
◆ oeat
| int* RESTRICT GRAPH::oeat |
Array [0..edges-1], outgoing edge allocation table
Definition at line 103 of file grph.h.
Referenced by adjterms(), adjust0term(), ansProcessCandidate(), bea_save(), buildsolgraph(), computeDegConsTree(), computePertubedSol(), computeSteinerTreeVnoi(), computeTransVoronoi(), createVariables(), dfsorder(), dualCostIsValid(), dualcostVarfixing(), extendSubtreeHead(), findDaRoots(), getcloseterms2term(), getlecloseterms(), getRSD(), graph_copy_data(), graph_edge_add(), graph_edge_del(), graph_edge_hide(), graph_edge_redirect(), graph_free(), graph_get2next(), graph_get3next(), graph_get4next(), graph_get4nextTTerms(), graph_init(), graph_knot_contract(), graph_knot_delPseudo(), graph_mincut_exec(), graph_pack(), graph_path_exec(), graph_path_execX(), graph_path_PcMwSd(), graph_path_st(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_full(), graph_path_st_pcmw_reduce(), graph_path_st_rmw(), graph_path_st_rpc(), graph_pc_adaptSap(), graph_pc_chgPrize(), graph_pc_contractEdge(), graph_pc_contractEdgeAncestors(), graph_pc_getRsap(), graph_pc_getSapShift(), graph_pc_mw2rmw(), graph_pc_presolInit(), graph_pc_subtractPrize(), graph_pc_term2edgeConsistent(), graph_resize(), graph_sdPaths(), graph_show(), graph_sol_reroot(), graph_sol_unreduced(), graph_sol_valid(), graph_trail(), graph_trail_arr(), graph_uncover(), graph_valid(), graph_voronoi(), graph_voronoiExtend(), graph_voronoiMw(), graph_voronoiRepair(), graph_voronoiRepairMult(), graph_voronoiTerms(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), lca(), nchains(), nodeIsCrucial(), reduce_ans(), reduce_ansAdv(), reduce_ansAdv2(), reduce_bd34(), reduce_bdr(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundPrune(), reduce_chain2(), reduce_check3Tree(), reduce_cnsAdv(), reduce_contractZeroEdges(), reduce_da(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_daSlackPruneMw(), reduce_deleteConflictEdges(), reduce_extendedEdge(), reduce_getSd(), reduce_getSdPcMw(), reduce_ledge(), reduce_nnp(), reduce_npv(), reduce_nts(), reduce_nv(), reduce_nvAdv(), reduce_sd(), reduce_sdPc(), reduce_sdsp(), reduce_sdspSap(), reduce_simple(), reduce_simple_hc(), reduce_simple_mw(), reduce_simple_pc(), reduce_simple_sap(), reduce_sl(), reduceCheckEdge(), reducePcMw(), reduceSPG(), reduceWithEdgeFixingBounds(), reduceWithNodeReplaceBounds(), removeEdge(), ruleOutSubtree(), SCIP_DECL_HEUREXEC(), SCIPprobdataPrintGraph2(), SCIPprobdataWriteSolution(), SCIPStpDualAscentPcMw(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurLocalRun(), SCIPStpHeurRecExclude(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreeDc(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMPrune(), SCIPStpHeurTMPrunePc(), SCIPStpHeurTMRun(), SCIPStpValidateSol(), SCIPwriteStp(), sddeltable(), selectBranchingVertexBySol(), sep_2cut(), sep_flow(), setVnoiDistances(), stp_save(), trail(), traverseChain(), truncateSubtree(), trydg1edgepc(), updateEdgeFixingBounds(), updateFixingBounds(), and updateNodeReplaceBounds().
◆ mincut_dist
| int* RESTRICT GRAPH::mincut_dist |
dist[i] : Distance-label of node i
Definition at line 106 of file grph.h.
Referenced by graph_init(), graph_mincut_exec(), graph_mincut_exit(), graph_mincut_init(), and graph_next_term().
◆ mincut_head
| int* RESTRICT GRAPH::mincut_head |
head[i] : Head of active queue with label i
Definition at line 107 of file grph.h.
Referenced by graph_init(), graph_mincut_exec(), graph_mincut_exit(), graph_mincut_init(), and sep_2cut().
◆ mincut_head_inact
| int* RESTRICT GRAPH::mincut_head_inact |
head[i] : Head of inactive queue with label i
Definition at line 108 of file grph.h.
Referenced by graph_mincut_exec(), graph_mincut_exit(), graph_mincut_init(), and sep_2cut().
◆ mincut_numb
| int* RESTRICT GRAPH::mincut_numb |
numb[i] : numb[i] nodes with label i
Definition at line 109 of file grph.h.
Referenced by graph_init(), graph_mincut_exec(), graph_mincut_exit(), graph_mincut_init(), and sep_2cut().
◆ mincut_prev
| int* RESTRICT GRAPH::mincut_prev |
Definition at line 110 of file grph.h.
Referenced by graph_init(), graph_mincut_exec(), graph_mincut_exit(), and graph_mincut_init().
◆ mincut_next
| int* RESTRICT GRAPH::mincut_next |
Definition at line 111 of file grph.h.
Referenced by graph_init(), graph_mincut_exec(), graph_mincut_exit(), and graph_mincut_init().
◆ mincut_temp
| int* RESTRICT GRAPH::mincut_temp |
Definition at line 112 of file grph.h.
Referenced by graph_init(), graph_mincut_exec(), graph_mincut_exit(), and graph_mincut_init().
◆ mincut_e
| int* RESTRICT GRAPH::mincut_e |
e[i] : Excess of node i
Definition at line 113 of file grph.h.
Referenced by graph_init(), graph_mincut_exec(), graph_mincut_exit(), graph_mincut_init(), and sep_2cut().
◆ mincut_x
| int* RESTRICT GRAPH::mincut_x |
x[k] : Actual flow on arc k
Definition at line 114 of file grph.h.
Referenced by graph_init(), graph_mincut_exec(), and graph_mincut_init().
◆ mincut_r
| int* RESTRICT GRAPH::mincut_r |
r[k] : residual capacity of arc k
Definition at line 115 of file grph.h.
Referenced by graph_init(), graph_mincut_exec(), graph_mincut_exit(), graph_mincut_init(), and sep_2cut().
◆ path_heap
| int* RESTRICT GRAPH::path_heap |
Definition at line 118 of file grph.h.
Referenced by computeSteinerTreeVnoi(), computeTransVoronoi(), graph_free_historyDeep(), graph_init(), graph_pack(), graph_path_exec(), graph_path_execX(), graph_path_exit(), graph_path_init(), graph_path_invroot(), graph_path_st(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_full(), graph_path_st_rmw(), graph_path_st_rpc(), graph_voronoi(), graph_voronoiExtend(), graph_voronoiRepair(), graph_voronoiRepairMult(), reduce_da(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_daSlackPruneMw(), SCIPStpHeurLocalRun(), and setVnoiDistances().
◆ path_state
| int* RESTRICT GRAPH::path_state |
Definition at line 119 of file grph.h.
Referenced by computeSteinerTreeVnoi(), computeTransVoronoi(), graph_free_historyDeep(), graph_init(), graph_path_exec(), graph_path_execX(), graph_path_exit(), graph_path_init(), graph_path_invroot(), graph_path_st(), graph_path_st_pcmw(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_full(), graph_path_st_rmw(), graph_path_st_rpc(), graph_voronoi(), graph_voronoiExtend(), graph_voronoiRepair(), graph_voronoiRepairMult(), reduce_bound(), reduce_boundHop(), reduce_boundPrune(), reduce_daSlackPruneMw(), reduce_ledge(), SCIPStpHeurLocalRun(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMPrunePc(), and setVnoiDistances().
◆ grid_dim
| int GRAPH::grid_dim |
Definition at line 122 of file grph.h.
Referenced by graph_copy_data(), graph_free(), graph_grid_create(), graph_obstgrid_create(), graph_pack(), and SCIPprobdataWriteSolution().
◆ grid_ncoords
| int* GRAPH::grid_ncoords |
Definition at line 123 of file grph.h.
Referenced by graph_copy_data(), graph_free(), graph_grid_create(), graph_init(), graph_obstgrid_create(), graph_pack(), and SCIPprobdataWriteSolution().
◆ grid_coordinates
| int** GRAPH::grid_coordinates |
Definition at line 124 of file grph.h.
Referenced by graph_copy_data(), 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 127 of file grph.h.
Referenced by adjust0term(), buildsolgraph(), compEdges(), computeDaSolPcMw(), computePertubedSol(), computeSteinerTree(), computeSteinerTreeDijkPcMw(), createPrizeConstraints(), createVariables(), getlecloseterms(), graph_copy_data(), graph_free(), graph_get3nextTerms(), graph_get4nextTerms(), graph_get4nextTTerms(), graph_grid_create(), graph_init(), graph_load(), graph_obstgrid_create(), graph_pack(), graph_path_PcMwSd(), graph_path_st_rpc(), graph_pc_2mw(), graph_pc_2org(), graph_pc_2pc(), graph_pc_2rmw(), graph_pc_2rpc(), graph_pc_chgPrize(), graph_pc_contractEdge(), graph_pc_getRsap(), graph_pc_getSap(), graph_pc_getSapShift(), graph_pc_isPcMw(), graph_pc_knot2nonTerm(), graph_pc_mw2rmw(), graph_pc_presolExit(), graph_pc_presolInit(), graph_pc_subtractPrize(), graph_sdPaths(), graph_sol_getOrg(), graph_sol_reroot(), graph_sol_valid(), graph_valid(), graph_voronoiWithRadius(), is_maxprize(), nvreduce_sl(), pertubateEdgeCosts(), probdataCreate(), prune(), redbasedVarfixing(), redLoopPc(), reduce_ans(), reduce_ansAdv(), reduce_ansAdv2(), reduce_bd34(), reduce_bdr(), reduce_bound(), reduce_boundPrune(), reduce_cnsAdv(), reduce_da(), reduce_daPcMw(), reduce_daSlackPrune(), reduce_daSlackPruneMw(), reduce_extendedEdge(), reduce_getSdPcMw(), reduce_ledge(), reduce_nnp(), reduce_nts(), reduce_nv(), reduce_nvAdv(), reduce_sdsp(), reduce_simple_hc(), reduce_simple_mw(), reduce_simple_pc(), reduce_sl(), reducePc(), reduceSPG(), reduceWithEdgeFixingBounds(), reduceWithNodeFixingBounds(), SCIP_DECL_BRANCHEXECLP(), SCIP_DECL_BRANCHEXECPS(), SCIP_DECL_CONSPROP(), SCIP_DECL_CONSSEPALP(), SCIP_DECL_HEUREXEC(), SCIP_DECL_HEURINIT(), SCIP_DECL_PROPEXEC(), SCIPprobdataAddNewSol(), SCIPprobdataCreate(), SCIPprobdataWriteSolution(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurLocalRun(), SCIPStpHeurPruneRun(), SCIPStpHeurPruneUpdateSols(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), SCIPStpHeurSlackPruneRun(), SCIPStpHeurTMBuildTreePcMw(), SCIPStpHeurTMPrunePc(), SCIPStpHeurTMRun(), SCIPStpHeurTMRunLP(), SCIPStpValidateSol(), SCIPwriteStp(), STPStpBranchruleParseConsname(), trydg1edgepc(), updateEdgeFixingBounds(), updateFixingBounds(), updateNodeFixingBounds(), and updateNodeReplaceBounds().
◆ 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 128 of file grph.h.
Referenced by buildsolgraph(), compEdges(), createVariables(), findDaRoots(), graph_copy_data(), graph_init(), graph_pack(), graph_pc_2org(), graph_pc_2orgcheck(), graph_pc_2pc(), graph_pc_2rmw(), graph_pc_2rpc(), graph_pc_2trans(), graph_pc_2transcheck(), graph_pc_getPosPrizeSum(), graph_pc_getSapShift(), graph_pc_mw2rmw(), graph_pc_term2edgeConsistent(), graph_pc_updateTerm2edge(), graph_sol_valid(), graph_valid(), markPcMwRoots(), reduce_simple_pc(), reduceWithEdgeFixingBounds(), reduceWithNodeFixingBounds(), SCIPStpHeurAscendPruneRun(), SCIPStpHeurPruneRun(), SCIPStpHeurRecExclude(), SCIPStpHeurRecRun(), updateEdgeFixingBounds(), updateNodeFixingBounds(), and updateNodeReplaceBounds().