Scippy

SCIP

Solving Constraint Integer Programs

minimum_spanning_tree Struct Reference

Detailed Description

information for (sparse) MST computations

Definition at line 40 of file mst.h.

#include <mst.h>

Data Fields

const CSRcsr
 
DHEAPdheap
 
SCIP_Real *RESTRICT nodes_dist
 
int *RESTRICT nodes_predEdge
 

Field Documentation

◆ csr

◆ dheap

DHEAP* minimum_spanning_tree::dheap

Dijkstra heap

Definition at line 44 of file mst.h.

Referenced by computeOnMarked_exec(), computeOnMarked_init(), mst_computeOnMarked(), mst_free(), and mst_init().

◆ nodes_dist

SCIP_Real* RESTRICT minimum_spanning_tree::nodes_dist

distance array (on vertices)

Definition at line 45 of file mst.h.

Referenced by computeOnMarked_exec(), computeOnMarked_init(), mst_computeOnMarked(), mst_free(), and mst_init().

◆ nodes_predEdge

int* RESTRICT minimum_spanning_tree::nodes_predEdge

predecessor edge array (on vertices); NOTE: with respect to original graph edge IDs NOTE: might contain uninitialized values in opt mode!

Definition at line 46 of file mst.h.

Referenced by allTermsAreVisited(), computeOnMarked_exec(), computeOnMarked_init(), mst_computeOnMarked(), mst_free(), mst_getObj(), mst_getSoledges(), mst_init(), solGetMstEdges_csr(), and stpsolPrune_csr().