12345qiupeng
/
gtsam
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fixed BayesTree test

release/4.3a0
Frank Dellaert 2012-09-10 18:15:02 +00:00
parent 2657f04bec
commit 446d170f1c
1 changed files with 4 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
gtsam/discrete/tests/testDiscreteFactorGraph.cpp
View File

@ -220,16 +220,14 @@ TEST( DiscreteFactorGraph, testMPE_Darwiche09book_p244)
// DiscreteConditional::shared_ptr root = chordal->back(); // DiscreteConditional::shared_ptr root = chordal->back();
// EXPECT_DOUBLES_EQUAL(0.4, (*root)(*actualMPE), 1e-9); // EXPECT_DOUBLES_EQUAL(0.4, (*root)(*actualMPE), 1e-9);
#ifdef OLD
// Let us create the Bayes tree here, just for fun, because we don't use it now // Let us create the Bayes tree here, just for fun, because we don't use it now
typedef JunctionTree<DiscreteFactorGraph> JT; typedef JunctionTree<DiscreteFactorGraph> JT;
GenericMultifrontalSolver<DiscreteFactor, JT> solver(graph); GenericMultifrontalSolver<DiscreteFactor, JT> solver(graph);
JT::BayesTree::shared_ptr bayesTree = solver.eliminate(&EliminateDiscrete); BayesTree<DiscreteConditional>::shared_ptr bayesTree = solver.eliminate(&EliminateDiscrete);
bayesTree->print("Bayes Tree"); // bayesTree->print("Bayes Tree");
EXPECT_LONGS_EQUAL(2,bayesTree->size());
tictoc_print();
}
#ifdef OLD
// Create the elimination tree manually // Create the elimination tree manually
VariableIndex structure(graph); VariableIndex structure(graph);
typedef EliminationTree<DiscreteFactor> ETree; typedef EliminationTree<DiscreteFactor> ETree;