Detailed Description
several decomposition methods for Steiner tree problems
Definition in file bidecomposition.h.
Go to the source code of this file.
Data Structures | |
struct | biconnected_component_decomposition |
struct | cut_nodes |
Typedefs | |
typedef struct biconnected_component_decomposition | BIDECOMP |
typedef struct cut_nodes | CUTNODES |
Functions | |
SCIP_RETCODE | bidecomposition_cutnodesInit (SCIP *, const GRAPH *, CUTNODES **) |
void | bidecomposition_cutnodesFree (SCIP *, CUTNODES **) |
void | bidecomposition_cutnodesCompute (const GRAPH *, CUTNODES *) |
SCIP_RETCODE | bidecomposition_init (SCIP *, const CUTNODES *, const GRAPH *, BIDECOMP **) |
SCIP_RETCODE | bidecomposition_initSubInOut (SCIP *, const GRAPH *, BIDECOMP *) |
void | bidecomposition_free (SCIP *, BIDECOMP **) |
void | bidecomposition_markSub (const BIDECOMP *, int, GRAPH *) |
SCIP_Bool | bidecomposition_componentIsTrivial (const BIDECOMP *, int) |
SCIP_Bool | bidecomposition_isPossible (const GRAPH *) |
SCIP_RETCODE | bidecomposition_getMarkedSubRoot (SCIP *, const BIDECOMP *, const GRAPH *, const GRAPH *, int *) |
SCIP_Real | bidecomposition_getCompNodeRatio (const BIDECOMP *, int) |
SCIP_Real | bidecomposition_getMaxcompNodeRatio (const BIDECOMP *) |
Typedef Documentation
◆ BIDECOMP
typedef struct biconnected_component_decomposition BIDECOMP |
decompose
◆ CUTNODES
Function Documentation
◆ bidecomposition_cutnodesInit()
SCIP_RETCODE bidecomposition_cutnodesInit | ( | SCIP * | scip, |
const GRAPH * | g, | ||
CUTNODES ** | cutnodes | ||
) |
initializes
- Parameters
-
scip SCIP data structure g graph data structure cutnodes cut nodes
Definition at line 441 of file bidecomposition.c.
References cut_nodes::biconn_comproots, cut_nodes::biconn_ncomps, cut_nodes::biconn_nodesmark, cut_nodes::curr_hittime, cut_nodes::curr_lowpoint, cutNodesSetDfsRoot(), cut_nodes::dfsroot, graph_get_nNodes(), nnodes, cut_nodes::nodes_hittime, NULL, cut_nodes::scip, SCIP_CALL, SCIP_OKAY, SCIPallocMemory, SCIPallocMemoryArray, and StpVecReserve.
Referenced by initDecompose(), reduce_articulations(), reduce_bidecomposition(), and reduce_bidecompositionExact().
◆ bidecomposition_cutnodesFree()
exits
- Parameters
-
scip SCIP data structure cutnodes cut nodes
Definition at line 512 of file bidecomposition.c.
References cut_nodes::biconn_comproots, cut_nodes::biconn_nodesmark, cut_nodes::nodes_hittime, SCIPfreeMemory, SCIPfreeMemoryArray, and StpVecFree.
Referenced by freeDecompose(), reduce_articulations(), reduce_bidecomposition(), and reduce_bidecompositionExact().
◆ bidecomposition_cutnodesCompute()
computes cut-nodes and (implicitly) bi-connected components
- Parameters
-
g graph data structure cutnodes cut nodes
Definition at line 540 of file bidecomposition.c.
References cut_nodes::biconn_ncomps, cut_nodes::curr_hittime, cutNodesComputeDfs(), cutNodesComputePostProcess(), cut_nodes::dfsroot, SCIPdebugMessage, and StpVecGetSize.
Referenced by initDecompose(), reduce_articulations(), reduce_bidecomposition(), and reduce_bidecompositionExact().
◆ bidecomposition_init()
SCIP_RETCODE bidecomposition_init | ( | SCIP * | scip, |
const CUTNODES * | cutnodes, | ||
const GRAPH * | g, | ||
BIDECOMP ** | bidecomposition | ||
) |
initializes
- Parameters
-
scip SCIP data structure cutnodes cut nodes g graph data structure bidecomposition bidecomposition data structure
Definition at line 567 of file bidecomposition.c.
References cut_nodes::biconn_ncomps, decomposeBuildCsr(), graph_get_nNodes(), biconnected_component_decomposition::nbicomps, nnodes, biconnected_component_decomposition::nodes, NULL, SCIP_CALL, SCIP_OKAY, SCIPallocMemory, SCIPallocMemoryArray, biconnected_component_decomposition::starts, and biconnected_component_decomposition::subinout.
Referenced by decomposeExec(), decomposeExecExact(), and initDecompose().
◆ bidecomposition_initSubInOut()
SCIP_RETCODE bidecomposition_initSubInOut | ( | SCIP * | scip, |
const GRAPH * | g, | ||
BIDECOMP * | bidecomposition | ||
) |
initializes
- Parameters
-
scip SCIP data structure g graph data structure bidecomposition bidecomposition data structure
Definition at line 600 of file bidecomposition.c.
References graph_subinoutInit(), SCIP_CALL, SCIP_OKAY, and biconnected_component_decomposition::subinout.
Referenced by decomposeExec(), decomposePartialExact(), and decomposeReduce().
◆ bidecomposition_free()
frees
- Parameters
-
scip SCIP data structure bidecomposition bidecomposition data structure
Definition at line 616 of file bidecomposition.c.
References graph_subinoutFree(), biconnected_component_decomposition::nodes, SCIPfreeMemory, SCIPfreeMemoryArray, biconnected_component_decomposition::starts, and biconnected_component_decomposition::subinout.
Referenced by decomposeExec(), decomposeExecExact(), and freeDecompose().
◆ bidecomposition_markSub()
marks subgraph of given component index
- Parameters
-
bidecomp all-components storage compindex component index g graph data structure
Definition at line 639 of file bidecomposition.c.
References FALSE, graph_get_nNodes(), graph_knot_getContractionRecordAncestor(), graph_knot_isInRange(), graph_knot_printInfo(), graph_subinoutGetContractionRecord(), GRAPH::mark, nnodes, biconnected_component_decomposition::nodes, SCIPdebugMessage, biconnected_component_decomposition::starts, biconnected_component_decomposition::subinout, and TRUE.
Referenced by decomposeExactSubTry(), decomposeGetSubgraph(), and decomposeReduceSub().
◆ bidecomposition_componentIsTrivial()
component consisting of at most one node?
- Parameters
-
bidecomp all-components storage compindex component index
Definition at line 718 of file bidecomposition.c.
References FALSE, SCIPdebugMessage, biconnected_component_decomposition::starts, and TRUE.
Referenced by decomposeExactSubTry(), decomposeReduceSub(), and decomposeSolveSub().
◆ bidecomposition_isPossible()
todo remove once bigger graphs can be handled
- Parameters
-
g graph data structure
Definition at line 744 of file bidecomposition.c.
References graph_get_nNodes(), graph_isMarked(), GRAPH::mark, and nnodes.
Referenced by initDecompose(), reduce_articulations(), reduce_bidecomposition(), and reduce_bidecompositionExact().
◆ bidecomposition_getMarkedSubRoot()
SCIP_RETCODE bidecomposition_getMarkedSubRoot | ( | SCIP * | scip, |
const BIDECOMP * | bidecomp, | ||
const GRAPH * | orggraph, | ||
const GRAPH * | subgraph, | ||
int * | subroot | ||
) |
gets root of marked sub-component bidecomposition_markSub needs to be called before!
- Parameters
-
scip SCIP data structure bidecomp all-components storage orggraph graph data structure subgraph graph data structure subroot the new root (out)
Definition at line 687 of file bidecomposition.c.
References decomposeGetFirstMarked(), graph_knot_isInRange(), graph_subinoutGetOrgToSubNodeMap(), Is_term, SCIP_CALL, SCIP_OKAY, biconnected_component_decomposition::subinout, and GRAPH::term.
Referenced by decomposeExactSubTry(), and decomposeGetSubgraph().
◆ bidecomposition_getCompNodeRatio()
returns nodes ratio of component and the remaining graph
- Parameters
-
bidecomp bidecomposition data structure compindex component index
Definition at line 765 of file bidecomposition.c.
References GE, biconnected_component_decomposition::nbicomps, SCIP_Real, SCIPdebugMessage, and biconnected_component_decomposition::starts.
Referenced by decomposePartialExact().
◆ bidecomposition_getMaxcompNodeRatio()
returns ratio of nodes of maximum component and the remaining graph
- Parameters
-
bidecomp bidecomposition data structure
Definition at line 791 of file bidecomposition.c.
References GT, biconnected_component_decomposition::nbicomps, SCIP_Real, SCIPdebugMessage, and biconnected_component_decomposition::starts.
Referenced by decomposeIsPromising(), and decomposePartialIsPromising().