Detailed Description
subgraph data
Definition at line 81 of file heur_ascendprune.c.
Data Fields | |
const SCIP_Real * | redcosts |
GRAPH * | newgraph |
int * | edgelist |
int * | nodeOrg2NewMap |
int * | edgeNew2OrgMap |
int | nnodes |
int | nedges_half |
int | root |
Field Documentation
◆ redcosts
const SCIP_Real* redcost0_graph::redcosts |
the reduced costs
Definition at line 83 of file heur_ascendprune.c.
Referenced by redcostGraphMark().
◆ newgraph
GRAPH* redcost0_graph::newgraph |
graph
Definition at line 84 of file heur_ascendprune.c.
Referenced by redcostGraphBuild(), redcostGraphComputeSteinerTree(), redcostGraphComputeSteinerTreeDegCons(), redcostGraphComputeSteinerTreeDirected(), redcostGraphFree(), redcostGraphSolRetransform(), and SCIPStpHeurAscendPruneRun().
◆ edgelist
int* redcost0_graph::edgelist |
edge list for new graph
Definition at line 85 of file heur_ascendprune.c.
Referenced by redcostGraphBuild(), redcostGraphFree(), and redcostGraphMark().
◆ nodeOrg2NewMap
int* redcost0_graph::nodeOrg2NewMap |
Definition at line 86 of file heur_ascendprune.c.
Referenced by redcostGraphBuild(), and redcostGraphFree().
◆ edgeNew2OrgMap
int* redcost0_graph::edgeNew2OrgMap |
Definition at line 87 of file heur_ascendprune.c.
Referenced by redcostGraphBuild(), redcostGraphFree(), and redcostGraphSolRetransform().
◆ nnodes
int redcost0_graph::nnodes |
nodes
Definition at line 88 of file heur_ascendprune.c.
Referenced by redcostGraphBuild(), and redcostGraphMark().
◆ nedges_half
int redcost0_graph::nedges_half |
edges
Definition at line 89 of file heur_ascendprune.c.
Referenced by redcostGraphBuild(), redcostGraphMark(), and SCIPStpHeurAscendPruneRun().
◆ root
int redcost0_graph::root |
red cost root
Definition at line 90 of file heur_ascendprune.c.
Referenced by redcostGraphBuild(), redcostGraphMark(), redcostGraphSolRetransform(), and SCIPStpHeurAscendPruneRun().