Detailed Description
includes (inline) graph heap methods used for Steiner tree problems
Definition in file graphheaps.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()
|
inlinestatic |
gets closest node from heap
Definition at line 41 of file graphheaps.h.
Referenced by graph_path_execX(), graph_path_invroot(), graph_path_st(), graph_path_st_brmwcs(), graph_path_st_pcmw(), graph_path_st_pcmw_full(), graph_path_st_rpcmw(), graph_sdWalks(), graph_sdWalksConnected(), graph_sdWalksExt(), graph_sdWalksExt2(), and sdDcExtendTree().
◆ correctX()
|
inlinestatic |
corrects the heap
Definition at line 85 of file graphheaps.h.
Referenced by graph_path_execX(), graph_path_invroot(), graph_path_st(), graph_path_st_brmwcs(), graph_path_st_pcmw(), graph_path_st_pcmw_full(), graph_path_st_rpcmw(), and sdDcExtendTree().
◆ resetX()
|
inlinestatic |
resets element from heap
Definition at line 132 of file graphheaps.h.
Referenced by graph_path_st(), graph_path_st_brmwcs(), graph_path_st_pcmw_full(), graph_path_st_rpcmw(), sdDcExtendTree(), and stPcmwConnectNode().