dijkstra_data Struct Reference

Detailed Description

Dijkstra data

Definition at line 311 of file graphdefs.h.

#include <graphdefs.h>

Data Fields
int *	visitlist
DHEAP *	dheap
SCIP_Real *	node_distance
STP_Bool *	node_visited
SCIP_Real *	node_bias
int	nvisits
int	edgelimit

Field Documentation

visitlist

int* dijkstra_data::visitlist

stores all visited nodes

Definition at line 314 of file graphdefs.h.

Referenced by closeNodesRunCompute(), closeNodesRunInit(), dapathsUpdate(), graph_dijkLimited_free(), graph_dijkLimited_init(), graph_dijkLimited_reset(), graph_pathInLimitedExec(), graph_sdCloseNodesBiased(), graph_sdStarBiased(), sdStarBiasedProcessNode(), and testSdStarPcKillsEdge().

dheap

DHEAP* dijkstra_data::dheap

Dijkstra heap, initially cleaned

Definition at line 315 of file graphdefs.h.

Referenced by closeNodesRunCompute(), closeNodesRunInit(), graph_dijkLimited_clean(), graph_dijkLimited_free(), graph_dijkLimited_init(), graph_dijkLimited_reset(), graph_pathInLimitedExec(), graph_sdCloseNodesBiased(), graph_sdStarBiased(), sdStarBiasedProcessNode(), and testSdStarPcKillsEdge().

node_distance

SCIP_Real* dijkstra_data::node_distance

distances array for each node, initially set to FARAWAY

Definition at line 316 of file graphdefs.h.

Referenced by closeNodesRunCompute(), closeNodesRunInit(), dapathsUpdate(), graph_dijkLimited_clean(), graph_dijkLimited_free(), graph_dijkLimited_init(), graph_dijkLimited_reset(), graph_pathInLimitedExec(), graph_sdCloseNodesBiased(), graph_sdStarBiased(), sdStarBiasedProcessNode(), and testSdStarPcKillsEdge().

node_visited

STP_Bool* dijkstra_data::node_visited

stores whether a node has been visited, initially set to FALSE

Definition at line 317 of file graphdefs.h.

Referenced by closeNodesRunCompute(), graph_dijkLimited_clean(), graph_dijkLimited_free(), graph_dijkLimited_init(), graph_dijkLimited_reset(), graph_pathInLimitedExec(), graph_sdCloseNodesBiased(), graph_sdStarBiased(), sdStarBiasedProcessNode(), and testSdStarPcKillsEdge().

node_bias

SCIP_Real* dijkstra_data::node_bias

bias of node for PC problem

Definition at line 319 of file graphdefs.h.

Referenced by closeNodesRunCompute(), distCloseNodesCompute(), distCloseNodesPrintLostNodeInfo(), distGetRestricted(), graph_dijkLimited_free(), graph_dijkLimited_init(), and graph_dijkLimited_initPcShifts().

nvisits

int dijkstra_data::nvisits

number of visited nodes, initially set to -1

Definition at line 320 of file graphdefs.h.

Referenced by closeNodesRunCompute(), closeNodesRunInit(), dapathsUpdate(), graph_dijkLimited_clean(), graph_dijkLimited_init(), graph_dijkLimited_reset(), graph_pathInLimitedExec(), graph_sdCloseNodesBiased(), graph_sdStarBiased(), and sdStarBiasedProcessNode().

edgelimit

int dijkstra_data::edgelimit

number of edges to consider

Definition at line 321 of file graphdefs.h.

Referenced by graph_dijkLimited_clean(), graph_dijkLimited_init(), graph_sdCloseNodesBiased(), graph_sdStarBiased(), reduce_bdkWithSd(), reduce_sdEdgeCliqueStar(), sdneighborUpdateInit(), testSdCliqueStarDeg3AdjacencyIsCorrect(), testSdCliqueStarDeg3IsCorrect(), testSdCliqueStarDeg3IsCorrect2(), testSdCliqueStarDeg4IsCorrect(), and testSdGetterReturnsCorrectSds().