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