Detailed Description
dynamic CSR
Definition at line 158 of file graphdefs.h.
#include <graphdefs.h>
Data Fields | |
RANGE * | range |
int * | head |
int * | edgeid |
int * | id2csredge |
SCIP_Real * | cost |
SCIP_Real * | cost2 |
SCIP_Real * | cost3 |
int | nedges |
int | nnodes |
Field Documentation
◆ range
RANGE* dynamic_csr_storage::range |
CSR range
Definition at line 160 of file graphdefs.h.
Referenced by addInitialPathNodes(), addPathHeadEdge(), closeNodesRunCompute(), distCloseNodesCompute(), graph_dcsr_deleteEdge(), graph_free_dcsr(), graph_init_dcsr(), graph_sdCloseNodesBiased(), graph_sdStar(), graph_sdStarBiased(), graph_sdWalks_csr(), graph_sdWalksTriangle(), graph_valid_dcsr(), pathExendPrepare(), pathneighborsCollect(), pathneighborsUpdateDistances(), pcBiasCostsDCSR(), pcSdToNodeMark(), reduce_sdStar(), reduce_sdStarPc(), reduce_sdStarPc2(), reduce_sdWalk_csr(), reduce_sdWalkTriangle(), and sdStarBiasedProcessNode().
◆ head
int* dynamic_csr_storage::head |
edge head array
Definition at line 161 of file graphdefs.h.
Referenced by addInitialPathNodes(), addPathHeadEdge(), closeNodesRunCompute(), distCloseNodesCompute(), graph_dcsr_deleteEdge(), graph_dcsr_deleteEdgeBi(), graph_free_dcsr(), graph_init_dcsr(), graph_sdCloseNodesBiased(), graph_sdStar(), graph_sdStarBiased(), graph_sdWalks_csr(), graph_sdWalksTriangle(), graph_valid_dcsr(), pathExendPrepare(), pathneighborsCollect(), pathneighborsUpdateDistances(), pcBiasCostsDCSR(), pcSdToNodeMark(), reduce_sdStar(), reduce_sdStarPc(), reduce_sdStarPc2(), reduce_sdWalk_csr(), reduce_sdWalkTriangle(), and sdStarBiasedProcessNode().
◆ edgeid
int* dynamic_csr_storage::edgeid |
gets id from CSR edge
Definition at line 162 of file graphdefs.h.
Referenced by addPathHeadEdge(), closeNodesRunCompute(), graph_dcsr_deleteEdge(), graph_dcsr_deleteEdgeBi(), graph_free_dcsr(), graph_init_dcsr(), graph_valid_dcsr(), reduce_sdStar(), reduce_sdStarPc(), reduce_sdStarPc2(), reduce_sdWalk_csr(), reduce_sdWalkTriangle(), and sdStarBiasedProcessNode().
◆ id2csredge
int* dynamic_csr_storage::id2csredge |
gets CRS edge from id
Definition at line 163 of file graphdefs.h.
Referenced by graph_dcsr_deleteEdge(), graph_dcsr_deleteEdgeBi(), graph_edge_delFull(), graph_free_dcsr(), graph_init_dcsr(), graph_valid_dcsr(), reduce_sdStar(), reduce_sdStarPc(), reduce_sdStarPc2(), reduce_sdWalk_csr(), reduce_sdWalkTriangle(), replaceEdgeByPath(), and sdStarFinalize().
◆ cost
SCIP_Real* dynamic_csr_storage::cost |
edge cost array
Definition at line 164 of file graphdefs.h.
Referenced by addInitialPathNodes(), addPathHeadEdge(), closeNodesRunCompute(), distCloseNodesCompute(), graph_dcsr_deleteEdge(), graph_dcsr_deleteEdgeBi(), graph_free_dcsr(), graph_init_dcsr(), graph_sdCloseNodesBiased(), graph_sdStar(), graph_sdStarBiased(), graph_sdWalks_csr(), graph_sdWalksTriangle(), pathExendPrepare(), pathneighborsUpdateDistances(), pcBiasCostsDCSR(), pcSdToNodeMark(), reduce_sdStar(), reduce_sdStarPc(), reduce_sdStarPc2(), reduce_sdWalk_csr(), reduce_sdWalkTriangle(), and sdStarBiasedProcessNode().
◆ cost2
SCIP_Real* dynamic_csr_storage::cost2 |
second edge cost array, initialized with NULL and never freed!
Definition at line 165 of file graphdefs.h.
Referenced by graph_dcsr_deleteEdge(), graph_init_dcsr(), reduce_sdStarPc(), and reduce_sdStarPc2().
◆ cost3
SCIP_Real* dynamic_csr_storage::cost3 |
third edge cost array, initialized with NULL and never freed!
Definition at line 166 of file graphdefs.h.
Referenced by graph_dcsr_deleteEdge(), graph_init_dcsr(), and reduce_sdStarPc().
◆ nedges
int dynamic_csr_storage::nedges |
number of edges
Definition at line 167 of file graphdefs.h.
Referenced by graph_init_dcsr(), graph_valid_dcsr(), pcBiasCostsDCSR(), reduce_sdStarPc(), and reduce_sdStarPc2().
◆ nnodes
int dynamic_csr_storage::nnodes |
number of nodes
Definition at line 168 of file graphdefs.h.
Referenced by graph_free_dcsr(), graph_init_dcsr(), and graph_valid_dcsr().