Detailed Description
CSR like graph storage
Definition at line 138 of file graphdefs.h.
#include <graphdefs.h>
Data Fields | |
int * | start |
int * | head |
SCIP_Real * | cost |
int * | edge_id |
int | nedges_max |
int | nnodes |
Field Documentation
◆ start
int* csr_storage::start |
start position for each node
Definition at line 140 of file graphdefs.h.
Referenced by borderBuildCharDists(), computeOnMarked_exec(), computeOnMarked_init(), computeOrderingFromNode(), computeSteinerTree_exec(), computeSteinerTree_execBiased(), computeSteinerTree_execDirected(), computeSteinerTree_execPcMw(), computeSteinerTree_execPcMwFull(), computeSteinerTree_execRpcMw(), computeSteinerTree_init(), csrdepoCsrIsSet(), csrdepoCSRsAreEqual(), csrdepoCsrUnsetDebug(), csrdepoFillCSR(), csrdepoFillRandom(), dcmstGetCSRfromStore(), dcmstInsert(), extreduce_mstTopCompInSync(), graph_csr_alloc(), graph_csr_build(), graph_csr_buildCosts(), graph_csr_chgCosts(), graph_csr_copy(), graph_csr_costsAreInSync(), graph_csr_free(), graph_csr_getNedges(), graph_csr_isValid(), graph_csr_print(), graph_csrdepo_getCSR(), graph_path_st_pcmw_extendOut(), graph_pc_getOrgCostsCsr(), initSolve(), pcsubtreeDelete_csr(), pcsubtreePruneForProfit_csr(), propagateUBs(), reduce_dcmstGet0NodeMst(), reduce_dcmstGet1NodeMst(), reduce_dcmstGet2NodeMst(), reduce_dcmstMstIsValid(), solstp_pruneFromTmHeur_csr(), stpsolPrune_csr(), subtreesExtend(), subtreesRemoveNonValids(), and updateBorder().
◆ head
int* csr_storage::head |
edge head array
Definition at line 141 of file graphdefs.h.
Referenced by borderBuildCharDists(), computeOnMarked_exec(), computeOrderingFromNode(), computeSteinerTree_exec(), computeSteinerTree_execBiased(), computeSteinerTree_execDirected(), computeSteinerTree_execPcMw(), computeSteinerTree_execPcMwFull(), computeSteinerTree_execRpcMw(), csrdepoCsrIsSet(), csrdepoCSRsAreEqual(), csrdepoCsrUnsetDebug(), csrdepoFillCSR(), csrdepoFillRandom(), dcmstGetCSRfromStore(), dcmstInsert(), extreduce_mstTopCompInSync(), graph_csr_alloc(), graph_csr_build(), graph_csr_chgCosts(), graph_csr_copy(), graph_csr_free(), graph_csr_isValid(), graph_csr_print(), graph_path_st_pcmw_extendOut(), graph_valid_csr(), initSolve(), pcsubtreeDelete_csr(), pcsubtreePruneForProfit_csr(), propagateUBs(), reduce_dcmstGet2NodeMst(), reduce_dcmstMstIsValid(), solGetMstEdges_csr(), subtreesExtend(), subtreesRemoveNonValids(), and updateBorder().
◆ cost
SCIP_Real* csr_storage::cost |
edge cost array
Definition at line 142 of file graphdefs.h.
Referenced by borderBuildCharDists(), computeOnMarked_exec(), computeSteinerTree_exec(), computeSteinerTree_execBiased(), computeSteinerTree_execDirected(), computeSteinerTree_execPcMw(), computeSteinerTree_execPcMwFull(), computeSteinerTree_execRpcMw(), csrdepoCsrIsSet(), csrdepoCSRsAreEqual(), csrdepoCsrUnsetDebug(), csrdepoCsrWeight(), csrdepoFillCSR(), csrdepoFillRandom(), dcmstGetCSRfromStore(), dcmstInsert(), extreduce_mstTopCompInSync(), graph_csr_alloc(), graph_csr_build(), graph_csr_chgCosts(), graph_csr_copy(), graph_csr_costsAreInSync(), graph_csr_free(), graph_csr_print(), graph_path_st_pcmw_extendOut(), graph_pc_getOrgCostsCsr(), graph_valid_csr(), mst_getObj(), pcsubtreePruneForProfit_csr(), propagateUBs(), reduce_dcmstGet2NodeMst(), reduce_dcmstGetWeight(), solstp_getObjCsr(), solstp_pcGetObjCsr(), subtreesExtend(), tmBaseFree(), and tmBaseInit().
◆ edge_id
int* csr_storage::edge_id |
edge ids
Definition at line 143 of file graphdefs.h.
Referenced by csrdepoFillCSR(), graph_csr_alloc(), graph_csr_allocWithEdgeId(), graph_csr_build(), graph_csr_buildCosts(), graph_csr_chgCosts(), graph_csr_copy(), graph_csr_costsAreInSync(), graph_csr_free(), graph_pc_getOrgCostsCsr(), mst_getSoledges(), and solstp_convertCsrToGraph().
◆ nedges_max
int csr_storage::nedges_max |
maximum number of edges (real number given by start[nnodes])
Definition at line 144 of file graphdefs.h.
Referenced by baseMstFinalizeNew(), baseMstInitMsts(), compMstFinalizeNew(), csrdepoCsrIsSet(), csrdepoCSRsAreEqual(), csrdepoCsrUnsetDebug(), csrdepoCsrWeight(), csrdepoFillCSR(), csrdepoFillRandom(), csrdepoTest1(), dcmstGetCSRfromStore(), dcmstTest1(), dcmstTest2(), dcmstTest2b(), dcmstTest3(), graph_csr_alloc(), graph_csr_build(), graph_csr_chgCosts(), graph_csr_copy(), graph_csr_getNedges(), graph_csr_isValid(), graph_csr_print(), graph_csrdepo_print(), graph_valid_csr(), mstCompRuleOut(), mstExtend(), reduce_dcmstAddNode(), reduce_dcmstAddNodeInplace(), reduce_dcmstGet0NodeMst(), reduce_dcmstGet1NodeMst(), reduce_dcmstGet2NodeMst(), reduce_dcmstGetExtWeight(), reduce_dcmstGetWeight(), reduce_dcmstMstIsValid(), and ruledOut().
◆ nnodes
int csr_storage::nnodes |
number of nodes
Definition at line 145 of file graphdefs.h.
Referenced by baseMstBuildNew(), baseMstFinalizeNew(), baseMstGetAdjcosts(), baseMstInitMsts(), compMstFinalizeNew(), compMstInitMsts(), computeOnMarked_init(), computeSteinerTree_init(), csrdepoCsrIsSet(), csrdepoCSRsAreEqual(), csrdepoCsrUnsetDebug(), csrdepoFillCSR(), csrdepoFillRandom(), csrdepoTest1(), dcmstAddNode(), dcmstGetCSRfromStore(), dcmstInsert(), dcmstTest1(), dcmstTest2(), dcmstTest2b(), dcmstTest3(), extreduce_mstTopCompInSync(), extreduce_mstTopLevelBaseObjValid(), graph_csr_alloc(), graph_csr_build(), graph_csr_buildCosts(), graph_csr_chgCosts(), graph_csr_copy(), graph_csr_costsAreInSync(), graph_csr_free(), graph_csr_getNedges(), graph_csr_isValid(), graph_csr_print(), graph_csrdepo_print(), graph_pc_getOrgCostsCsr(), graph_valid_csr(), mstExtend(), mstLevelLeafTryExtMst(), mstTopLevelBaseValidWeight(), reduce_dcmstAddNode(), reduce_dcmstAddNodeInplace(), reduce_dcmstGet0NodeMst(), reduce_dcmstGet1NodeMst(), reduce_dcmstGet2NodeMst(), reduce_dcmstGetExtWeight(), reduce_dcmstMstIsValid(), ruledOut(), solstp_getObjCsr(), solstp_pcGetObjCsr(), solstp_pruneFromTmHeur_csr(), and strongPruneSteinerTreePc_csr().