stortest_path_prizecollecting Struct Reference

Detailed Description

information needed for prize-collecting problems

Definition at line 36 of file shortestpath.h.

#include <shortestpath.h>

Data Fields
SCIP_Real *	orderedprizes
int *	orderedprizes_id
SCIP_Real	maxoutprize
int	maxoutprize_idx

Field Documentation

orderedprizes

SCIP_Real* stortest_path_prizecollecting::orderedprizes

ordered prizes for (pseudo) terminals

Definition at line 39 of file shortestpath.h.

Referenced by computeSteinerTreeDijkPcMw(), graph_path_st_pcmw(), graph_path_st_rpcmw(), shortestpath_pcConnectNode(), and shortestpath_pcReset().

orderedprizes_id

int* stortest_path_prizecollecting::orderedprizes_id

ordered prizes IDs

Definition at line 40 of file shortestpath.h.

Referenced by computeSteinerTreeDijkPcMw(), and shortestpath_pcConnectNode().

maxoutprize

SCIP_Real stortest_path_prizecollecting::maxoutprize

maximum prize of not yet connected vertex

Definition at line 41 of file shortestpath.h.

Referenced by computeSteinerTree_execPcMw(), computeSteinerTree_execRpcMw(), graph_path_st_pcmw(), graph_path_st_rpcmw(), shortestpath_pcConnectNode(), and shortestpath_pcReset().

maxoutprize_idx

int stortest_path_prizecollecting::maxoutprize_idx

index

Definition at line 42 of file shortestpath.h.

Referenced by shortestpath_pcConnectNode(), and shortestpath_pcReset().