Scippy

SCIP

Solving Constraint Integer Programs

graphheaps.h File Reference

Detailed Description

includes (inline) graph heap methods used for Steiner tree problems

Author
Thorsten Koch
Daniel Rehfeldt

Definition in file graphheaps.h.

#include "scip/scip.h"
#include "graphdefs.h"
#include "portab.h"

Go to the source code of this file.

Functions

static int nearestX (int *RESTRICT heap, int *RESTRICT state, int *RESTRICT count, const SCIP_Real *pathdist)
 
static void correctX (int *RESTRICT heap, int *RESTRICT state, int *RESTRICT count, SCIP_Real *RESTRICT pathdist, int *RESTRICT pathedge, int l, int k, int e, SCIP_Real cost)
 
static void resetX (SCIP_Real *RESTRICT pathdist, int *RESTRICT heap, int *RESTRICT state, int *RESTRICT count, int node, SCIP_Real distnew)
 

Function Documentation

◆ nearestX()

static int nearestX ( int *RESTRICT  heap,
int *RESTRICT  state,
int *RESTRICT  count,
const SCIP_Real pathdist 
)
inlinestatic

◆ correctX()

static void correctX ( int *RESTRICT  heap,
int *RESTRICT  state,
int *RESTRICT  count,
SCIP_Real *RESTRICT  pathdist,
int *RESTRICT  pathedge,
int  l,
int  k,
int  e,
SCIP_Real  cost 
)
inlinestatic

◆ resetX()

static void resetX ( SCIP_Real *RESTRICT  pathdist,
int *RESTRICT  heap,
int *RESTRICT  state,
int *RESTRICT  count,
int  node,
SCIP_Real  distnew 
)
inlinestatic