From d9d2cb7dda44a64a1912898526dd17a26ec7db64 Mon Sep 17 00:00:00 2001 From: Richard Roberts Date: Wed, 3 Nov 2010 21:34:07 +0000 Subject: [PATCH] Removed commented code --- gtsam/inference/inference.h | 41 ------------------------------------- 1 file changed, 41 deletions(-) diff --git a/gtsam/inference/inference.h b/gtsam/inference/inference.h index b212e40b1..7c8d63936 100644 --- a/gtsam/inference/inference.h +++ b/gtsam/inference/inference.h @@ -52,45 +52,4 @@ namespace gtsam { }; - // ELIMINATE: FACTOR GRAPH -> BAYES NET - -// /** -// * Eliminate a single node yielding a Conditional -// * Eliminates the factors from the factor graph through findAndRemoveFactors -// * and adds a new factor on the separator to the factor graph -// */ -// template -// boost::shared_ptr -// eliminateOne(FactorGraph& factorGraph, Index key); -// -// /** -// * eliminate factor graph using the given (not necessarily complete) -// * ordering, yielding a chordal Bayes net and (partially eliminated) FG -// */ -// template -// BayesNet eliminate(FactorGraph& factorGraph, const Ordering& ordering); - - // FACTOR/MARGINALIZE: BAYES NET -> FACTOR GRAPH - -// /** -// * Factor P(X) as P(not keys|keys) P(keys) -// * @return P(not keys|keys) as an incomplete BayesNet, and P(keys) as a factor graph -// */ -// template -// std::pair< BayesNet, FactorGraph > -// factor(const BayesNet& bn, const Ordering& keys); -// -// /** -// * integrate out all except ordering, might be inefficient as the ordering -// * will simply be the current ordering with the keys put in the back -// */ -// template -// FactorGraph marginalize(const BayesNet& bn, const Ordering& keys); - - /** - * Hacked-together function to compute a Gaussian marginal for the given variable. - * todo: This is inefficient! - */ - //std::pair marginalGaussian(const GaussianFactorGraph& fg, const Symbol& key); - } /// namespace gtsam