30 #include <boost/variant.hpp> 141 : isReeliminated(false),
142 isAboveRelinThreshold(false),
143 isRelinearizeInvolved(false),
144 isRelinearized(false),
147 inRootClique(false) {}
170 cout <<
str <<
" Reelimintated: " << variablesReeliminated
171 <<
" Relinearized: " << variablesRelinearized
172 <<
" Cliques: " << cliques << std::endl;
179 double getErrorBefore()
const {
return errorBefore ? *errorBefore : std::nan(
""); }
180 double getErrorAfter()
const {
return errorAfter ? *errorAfter : std::nan(
""); }
size_t getVariablesReeliminated() const
bool isNew
Whether the variable itself was just added.
Factor Graph consisting of non-linear factors.
size_t variablesReeliminated
FastVector< FactorIndex > FactorIndices
Define collection types:
bool isAboveRelinThreshold
size_t getCliques() const
FactorIndices newFactorsIndices
Nonlinear factor graph optimizer using Powell's Dogleg algorithm (detail implementation) ...
FastVector< Key > KeyVector
Define collection type once and for all - also used in wrappers.
size_t getVariablesRelinearized() const
size_t variablesRelinearized
KeySet keysWithRemovedFactors
boost::optional< double > errorAfter
DetailedResults * details()
Return pointer to detail, 0 if no detail requested.
StatusMap variableStatus
The status of each variable during this update, see VariableStatus.
bool isRelinearizeInvolved
double getErrorBefore() const
boost::optional< double > errorBefore
bool inRootClique
Whether the variable is in the root clique.
void print(const std::string str="") const
Print results.
ISAM2Result(bool enableDetailedResults=false)
double getErrorAfter() const
Gaussian Bayes Tree, the result of eliminating a GaussianJunctionTree.
boost::optional< DetailedResults > detail
size_t factorsRecalculated