Detailed Description
Dijkstra heap
Definition at line 301 of file graphdefs.h.
#include <graphdefs.h>
Data Fields | |
int | capacity |
int | size |
int * | position |
DENTRY * | entries |
Field Documentation
◆ capacity
int dijkstra_heap::capacity |
maximum size
Definition at line 303 of file graphdefs.h.
Referenced by graph_heap_clean(), graph_heap_correct(), and graph_heap_isClean().
◆ size
int dijkstra_heap::size |
size
Definition at line 304 of file graphdefs.h.
Referenced by closeNodesRunCompute(), closeNodesRunInit(), cmst_computeMst(), computeOnMarked_exec(), computeSteinerTree_exec(), computeSteinerTree_execBiased(), computeSteinerTree_execDirected(), computeSteinerTree_execPcMw(), computeSteinerTree_execPcMwFull(), computeSteinerTree_execRpcMw(), computeSteinerTree_init(), distCloseNodesCompute(), distGetRestricted(), graph_heap_clean(), graph_heap_correct(), graph_heap_deleteMinReturnNode(), graph_heap_isClean(), graph_path_st_pcmw_extendOut(), graph_pathInLimitedExec(), graph_sdCloseNodesBiased(), graph_sdStar(), graph_sdStarBiased(), graph_sdWalks_csr(), graph_sdWalksTriangle(), propagateUBs(), stptest_dheap(), subtreesExtend(), subtreesRemoveNonValids(), vnoiCompute(), and vnoiComputeImplied().
◆ position
int* dijkstra_heap::position |
position of an index in range 0 to capacity
Definition at line 305 of file graphdefs.h.
Referenced by closeNodesRunCompute(), closeNodesRunInit(), cmst_computeMst(), computeOnMarked_exec(), computeSteinerTree_exec(), computeSteinerTree_execBiased(), computeSteinerTree_execDirected(), computeSteinerTree_execPcMw(), computeSteinerTree_execPcMwFull(), computeSteinerTree_execRpcMw(), computeSteinerTree_init(), distCloseNodesCompute(), distGetRestricted(), graph_dijkLimited_reset(), graph_heap_clean(), graph_heap_correct(), graph_heap_deleteMinReturnNode(), graph_heap_isClean(), graph_path_st_pcmw_extendOut(), graph_pathInLimitedExec(), graph_sdCloseNodesBiased(), graph_sdStar(), graph_sdStarBiased(), graph_sdWalks_csr(), graph_sdWalksTriangle(), reduce_sdWalk_csr(), reduce_sdWalkTriangle(), sdCliqueStarComputeSds(), vnoiCompute(), vnoiComputeImplied(), and vnoiInit().
◆ entries
DENTRY* dijkstra_heap::entries |
number of components
Definition at line 306 of file graphdefs.h.
Referenced by graph_heap_correct(), graph_heap_deleteMin(), and graph_heap_deleteMinReturnNode().