Detailed Description
data needed for building the RMQ based SD query structures
Definition at line 88 of file reduce_sdgraph.c.
Data Fields | |
BINARYNODE * | lcatree |
SCIP_Real * | lcatree_costs |
int * | termToLcatreeNode |
int * | lcatreeNodeToInds |
Field Documentation
◆ lcatree
BINARYNODE* lowest_common_ancestor_tree_builder::lcatree |
binary tree used for LCA computation; of size |T| - 1
Definition at line 90 of file reduce_sdgraph.c.
Referenced by log2floor(), sdqueryAttachBinaryTreeNode(), sdqueryBuildRmq(), sdqueryFullBuild(), sdqueryLcaBuilderFree(), and sdqueryLcaBuilderInit().
◆ lcatree_costs
SCIP_Real* lowest_common_ancestor_tree_builder::lcatree_costs |
cost per node of binary tree used for LCA computation; of size 2|T| - 3
Definition at line 91 of file reduce_sdgraph.c.
Referenced by log2floor(), sdqueryBuildBinaryTree(), sdqueryBuildRmq(), sdqueryFullBuild(), sdqueryLcaBuilderFree(), and sdqueryLcaBuilderInit().
◆ termToLcatreeNode
int* lowest_common_ancestor_tree_builder::termToLcatreeNode |
node mapping from terminals (SD graph nodes) to binary LCA tree nodes
Definition at line 92 of file reduce_sdgraph.c.
Referenced by log2floor(), sdqueryAttachBinaryTreeNode(), sdqueryBuildNodesToFullMap(), sdqueryBuildNodesToRmqMap(), sdqueryLcaBuilderFree(), and sdqueryLcaBuilderInit().
◆ lcatreeNodeToInds
int* lowest_common_ancestor_tree_builder::lcatreeNodeToInds |
mapping from binary LCA tree nodes to RMQ/Full indices; of size |T| - 1
Definition at line 93 of file reduce_sdgraph.c.
Referenced by sdqueryBuildNodesToRmqMap(), sdqueryBuildRmq(), sdqueryLcaBuilderFree(), and sdqueryLcaBuilderInit().