From 446d170f1cf849abd173fc4345339f18ae21cac6 Mon Sep 17 00:00:00 2001
From: Frank Dellaert <dellaert@gmail.com>
Date: Mon, 10 Sep 2012 18:15:02 +0000
Subject: [PATCH] Fixed BayesTree test

---
 gtsam/discrete/tests/testDiscreteFactorGraph.cpp | 10 ++++------
 1 file changed, 4 insertions(+), 6 deletions(-)

diff --git a/gtsam/discrete/tests/testDiscreteFactorGraph.cpp b/gtsam/discrete/tests/testDiscreteFactorGraph.cpp
index 8fdbc5870..e7292f0e5 100644
--- a/gtsam/discrete/tests/testDiscreteFactorGraph.cpp
+++ b/gtsam/discrete/tests/testDiscreteFactorGraph.cpp
@@ -220,16 +220,14 @@ TEST( DiscreteFactorGraph, testMPE_Darwiche09book_p244)
 //	DiscreteConditional::shared_ptr root = chordal->back();
 //	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
 	typedef JunctionTree<DiscreteFactorGraph> JT;
 	GenericMultifrontalSolver<DiscreteFactor, JT> solver(graph);
-	JT::BayesTree::shared_ptr bayesTree = solver.eliminate(&EliminateDiscrete);
-	bayesTree->print("Bayes Tree");
-
-	tictoc_print();
-}
+	BayesTree<DiscreteConditional>::shared_ptr bayesTree = solver.eliminate(&EliminateDiscrete);
+//  bayesTree->print("Bayes Tree");
+	EXPECT_LONGS_EQUAL(2,bayesTree->size());
 
+#ifdef OLD
 // Create the elimination tree manually
 VariableIndex structure(graph);
 typedef EliminationTree<DiscreteFactor> ETree;