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

remove obsoleted comments

release/4.3a0
Kai Ni 2010-07-05 19:44:08 +00:00
parent 56230f62dc
commit ef20bc75db
2 changed files with 0 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
cpp/GaussianFactorGraph.cpp
View File

@ -19,10 +19,6 @@
#include "inference-inl.h"
#include "iterative.h"
#ifdef USE_SPQR
#include <spqr.hpp>;
#endif
using namespace std;
using namespace gtsam;
using namespace boost::assign;
@ -194,11 +190,6 @@ GaussianFactorGraph::eliminate(const Ordering& ordering, bool old)
/* ************************************************************************* */
VectorConfig GaussianFactorGraph::optimize(const Ordering& ordering, bool old)
{
bool verbose = false;
if (verbose)
BOOST_FOREACH(const sharedFactor& factor,factors_)
factor->get_model()->print("Starting model");
// eliminate all nodes in the given ordering -> chordal Bayes net
GaussianBayesNet chordalBayesNet = eliminate(ordering, old);

10
spqr_mini/spqr_front.cpp
View File

@ -309,16 +309,6 @@ template <typename Entry> Int spqr_front
cholmod_common *cc // for cc->hypotenuse function
)
{
// std::cout << "**************spqr_front dumping started****************" << std::endl;
// std::cout << "m: " << m << " n: " << n << " npiv: " << npiv << " tol: " << tol
// << " ntol: " << ntol << " fchunk: " << fchunk << std::endl;
// for (int i=0; i<m; i++) {
// for (int j=0; j<n; j++)
// std::cout << F[j*m+i] << "\t";
// std::cout << std::endl;
// }
// std::cout << "**************spqr_front duming finished****************" << std::endl;
Entry tau ;
double wk ;
Entry *V ;