Scippy

SCIP

Solving Constraint Integer Programs

complete_graph Struct Reference

Detailed Description

complete, undirected graph storage

Definition at line 43 of file completegraph.h.

#include <completegraph.h>

Data Fields

SCIP_Realedgecosts
 
SCIP_Realadjedgecosts
 
int * nodeids
 
SCIP_Boolnode_has_adjcosts
 
int nnodes_max
 
int nnodes_curr
 
int nnodes_active
 

Field Documentation

◆ edgecosts

SCIP_Real* complete_graph::edgecosts

◆ adjedgecosts

SCIP_Real* complete_graph::adjedgecosts

adjacency cost array of size nnodes_max + 1, to be filled in by user

Definition at line 46 of file completegraph.h.

Referenced by cgraph_free(), cgraph_init(), cgraph_node_applyMinAdjCosts(), completemst1(), completemst2(), completemst3(), completemst4(), completemst5(), and sdmstGetWeight().

◆ nodeids

◆ node_has_adjcosts

SCIP_Bool* complete_graph::node_has_adjcosts

does node have adjacency costs?

Definition at line 48 of file completegraph.h.

Referenced by cgraph_free(), cgraph_init(), cgraph_node_append(), cgraph_node_applyMinAdjCosts(), and cgraph_node_hasAdjCosts().

◆ nnodes_max

int complete_graph::nnodes_max

maximum number of nodes

Definition at line 49 of file completegraph.h.

Referenced by cgraph_init(), cgraph_node_append(), cgraph_node_deleteTop(), completegraph(), and getNnodesMax().

◆ nnodes_curr

◆ nnodes_active

int complete_graph::nnodes_active

current number of nodes for which adjacency costs have been added

Definition at line 51 of file completegraph.h.

Referenced by cgraph_init(), and cgraph_valid().