bp.init();
bp.run();
- cout << "Exact single node marginals:" << endl;
+ cout << "Approximate (loopy belief propagation) single node marginals:" << endl;
for( size_t i = 0; i < fg.nrVars(); i++ )
cout << bp.belief(fg.var(i)) << endl;
}
#include <ostream>
#include <vector>
#include <cassert>
+#include <algorithm>
#include <dai/util.h>
if( include || (m1 != n1) )
result.push_back( m1 );
// remove duplicates
- std::vector<size_t>::iterator it = unique( result.begin(), result.end() );
+ std::vector<size_t>::iterator it = std::unique( result.begin(), result.end() );
result.erase( it, result.end() );
return result;
}
if( include || (m2 != n2) )
result.push_back( m2 );
// remove duplicates
- std::vector<size_t>::iterator it = unique( result.begin(), result.end() );
+ std::vector<size_t>::iterator it = std::unique( result.begin(), result.end() );
result.erase( it, result.end() );
return result;
}