30 template<
class BAYESTREE,
class GRAPH,
class ETREE_NODE>
36 sharedNode junctionTreeNode;
45 parentData(_parentData) {
50 const std::shared_ptr<ETREE_NODE>& node,
56 myData.junctionTreeNode =
57 std::make_shared<Node>(node->key, node->factors);
58 parentData.junctionTreeNode->addChild(myData.junctionTreeNode);
63 static void ConstructorTraversalVisitorPostAlg2(
64 const std::shared_ptr<ETREE_NODE>& ETreeNode,
78 ETreeNode->factors.size() + myData.childSymbolicFactors.size());
80 symbolicFactors.
push_back(ETreeNode->factors);
82 symbolicFactors.
push_back(myData.childSymbolicFactors);
85 keyAsOrdering.push_back(ETreeNode->key);
86 const auto [myConditional, mySeparatorFactor] =
87 internal::EliminateSymbolic(symbolicFactors, keyAsOrdering);
90 myData.parentData->childSymbolicConditionals.push_back(myConditional);
91 myData.parentData->childSymbolicFactors.push_back(mySeparatorFactor);
93 sharedNode node = myData.junctionTreeNode;
95 myData.childSymbolicConditionals;
96 node->problemSize_ = (int) (myConditional->size() * symbolicFactors.
size());
100 const size_t myNrParents = myConditional->nrParents();
101 const size_t nrChildren = node->nrChildren();
102 assert(childConditionals.size() == nrChildren);
105 std::vector<size_t> nrFrontals = node->nrFrontalsOfChildren();
106 std::vector<bool> merge(nrChildren,
false);
107 size_t myNrFrontals = 1;
108 for (
size_t i = 0;i<nrChildren;i++){
110 if (myNrParents + myNrFrontals == childConditionals[i]->nrParents()) {
112 myNrFrontals += nrFrontals[i];
118 node->mergeChildren(merge);
123 template<
class BAYESTREE,
class GRAPH>
124 template<
class ETREE_BAYESNET,
class ETREE_GRAPH>
127 gttic(JunctionTree_FromEliminationTree);
141 rootData.junctionTreeNode = std::make_shared<typename Base::Node>();
143 Data::ConstructorTraversalVisitorPre,
144 Data::ConstructorTraversalVisitorPostAlg2);
147 this->addChildrenAsRoots(rootData.junctionTreeNode);
Definition: EliminationTree.h:51
IsDerived< DERIVEDFACTOR > push_back(std::shared_ptr< DERIVEDFACTOR > factor)
Add a factor directly using a shared_ptr.
Definition: FactorGraph.h:190
std::vector< T, typename internal::FastDefaultVectorAllocator< T >::type > FastVector
Definition: FastVector.h:34
Definition: BayesTree.h:34
Definition: Ordering.h:37
void DepthFirstForest(FOREST &forest, DATA &rootData, VISITOR_PRE &visitorPre, VISITOR_POST &visitorPost)
Definition: treeTraversal-inst.h:77
Definition: EliminationTree.h:66
Definition: JunctionTree-inst.h:31
size_t size() const
Definition: FactorGraph.h:334
Collects factorgraph fragments defined on variable clusters, arranged in a tree.
const FastVector< sharedFactor > & remainingFactors() const
Definition: EliminationTree.h:155
Definition: chartTesting.h:28
A Cluster is just a collection of factors.
Definition: ClusterTree.h:36
void reserve(size_t size)
Definition: FactorGraph.h:186
Definition: JunctionTree.h:50
Definition: JunctionTree-inst.h:41