Detailed Description
information for shortest paths
Definition at line 47 of file shortestpath.h.
#include <shortestpath.h>
Data Fields | |
const CSR * | csr |
const CSR * | csr_orgcosts |
DHEAP * | dheap |
SCIP_Real *RESTRICT | nodes_dist |
int *RESTRICT | nodes_pred |
STP_Bool *RESTRICT | nodes_isConnected |
const SCIP_Real | edgecost_zeroOffset |
Field Documentation
◆ csr
const CSR* stortest_paths::csr |
CSR with possibly biased edge costs NOTE: all pointers except for cost alias with csr_orgcosts
Definition at line 50 of file shortestpath.h.
Referenced by computeSteinerTree_exec(), computeSteinerTree_execBiased(), computeSteinerTree_execDirected(), computeSteinerTree_execPcMw(), computeSteinerTree_execPcMwFull(), computeSteinerTree_execRpcMw(), computeSteinerTree_init(), computeSteinerTreeCsr(), computeSteinerTreeDijkPcMw(), computeSteinerTreeDijkPcMwFull(), computeSteinerTreeKeyNodesCsr(), shortestpath_computeSteinerTree(), shortestpath_computeSteinerTreeBiased(), shortestpath_computeSteinerTreeDirected(), shortestpath_computeSteinerTreePcMw(), shortestpath_computeSteinerTreePcMwFull(), shortestpath_computeSteinerTreeRpcMw(), and solstp_pruneFromTmHeur_csr().
◆ csr_orgcosts
const CSR* stortest_paths::csr_orgcosts |
CSR with original edge costs NOTE: all pointers except for cost alias with csr
Definition at line 52 of file shortestpath.h.
Referenced by solstp_pruneFromTmHeur_csr().
◆ dheap
DHEAP* stortest_paths::dheap |
Dijkstra heap
Definition at line 54 of file shortestpath.h.
Referenced by computeSteinerTree_exec(), computeSteinerTree_execBiased(), computeSteinerTree_execDirected(), computeSteinerTree_execPcMw(), computeSteinerTree_execPcMwFull(), computeSteinerTree_execRpcMw(), computeSteinerTree_init(), shortestpath_computeSteinerTree(), shortestpath_computeSteinerTreeBiased(), shortestpath_computeSteinerTreeDirected(), shortestpath_computeSteinerTreePcMw(), shortestpath_computeSteinerTreePcMwFull(), shortestpath_computeSteinerTreeRpcMw(), and solstp_pruneFromTmHeur_csr().
◆ nodes_dist
SCIP_Real* RESTRICT stortest_paths::nodes_dist |
distance array (on vertices)
Definition at line 55 of file shortestpath.h.
Referenced by computeSteinerTree_exec(), computeSteinerTree_execBiased(), computeSteinerTree_execDirected(), computeSteinerTree_execPcMw(), computeSteinerTree_execPcMwFull(), computeSteinerTree_execRpcMw(), computeSteinerTree_init(), shortestpath_computeSteinerTree(), shortestpath_computeSteinerTreeBiased(), shortestpath_computeSteinerTreeDirected(), shortestpath_computeSteinerTreePcMw(), shortestpath_computeSteinerTreePcMwFull(), shortestpath_computeSteinerTreeRpcMw(), and solstp_pruneFromTmHeur_csr().
◆ nodes_pred
int* RESTRICT stortest_paths::nodes_pred |
predecessor node array (on vertices) NOTE: might contain uninitialized values in opt mode!
Definition at line 56 of file shortestpath.h.
Referenced by computeSteinerTree_exec(), computeSteinerTree_execBiased(), computeSteinerTree_execDirected(), computeSteinerTree_execPcMw(), computeSteinerTree_execPcMwFull(), computeSteinerTree_execRpcMw(), computeSteinerTree_init(), shortestpath_computeSteinerTree(), shortestpath_computeSteinerTreeBiased(), shortestpath_computeSteinerTreeDirected(), shortestpath_computeSteinerTreePcMw(), shortestpath_computeSteinerTreePcMwFull(), shortestpath_computeSteinerTreeRpcMw(), and solstp_pruneFromTmHeur_csr().
◆ nodes_isConnected
STP_Bool* RESTRICT stortest_paths::nodes_isConnected |
array to mark whether a vertex is part of computed Steiner tree
Definition at line 58 of file shortestpath.h.
Referenced by computeSteinerTree_exec(), computeSteinerTree_execBiased(), computeSteinerTree_execDirected(), computeSteinerTree_execPcMw(), computeSteinerTree_execPcMwFull(), computeSteinerTree_execRpcMw(), computeSteinerTree_init(), shortestpath_computeSteinerTree(), shortestpath_computeSteinerTreeBiased(), shortestpath_computeSteinerTreeDirected(), shortestpath_computeSteinerTreePcMw(), shortestpath_computeSteinerTreePcMwFull(), shortestpath_computeSteinerTreeRpcMw(), and solstp_pruneFromTmHeur_csr().
◆ edgecost_zeroOffset
const SCIP_Real stortest_paths::edgecost_zeroOffset |
zero offset for edge costs (used instead of actual 0 value)
Definition at line 59 of file shortestpath.h.
Referenced by computeSteinerTree_execBiased().