dynamic_complete_minimum_spanning_tree Struct Reference

Detailed Description

lightweight minimum spanning tree structure that allows to add vertices to given MST on complete graph (in CSR format)

Definition at line 43 of file reduce_util.c.

Data Fields
CEDGE *	edgestore
SCIP_Real *	adjcost_buffer
SCIP_Bool *	nodemark
int	maxnnodes

Field Documentation

edgestore

CEDGE* dynamic_complete_minimum_spanning_tree::edgestore

storage for edges (of size maxnnodes)

Definition at line 45 of file reduce_util.c.

Referenced by dcmstAddNode(), dcmstGetCSRfromStore(), dcmstGetWeightFromStore(), and reduce_dcmstInit().

adjcost_buffer

SCIP_Real* dynamic_complete_minimum_spanning_tree::adjcost_buffer

distances buffer (of size maxnnodes)

Definition at line 46 of file reduce_util.c.

Referenced by reduce_dcmstGetAdjcostBuffer(), and reduce_dcmstInit().

nodemark

SCIP_Bool* dynamic_complete_minimum_spanning_tree::nodemark

array for marking nodes (of size maxnnodes)

Definition at line 47 of file reduce_util.c.

Referenced by dcmstAddNode(), and reduce_dcmstInit().

maxnnodes

int dynamic_complete_minimum_spanning_tree::maxnnodes

maximum number of nodes that can be handled

Definition at line 48 of file reduce_util.c.

Referenced by reduce_dcmstAddNode(), reduce_dcmstAddNodeInplace(), reduce_dcmstGetAdjcostBuffer(), reduce_dcmstGetMaxnnodes(), and reduce_dcmstInit().