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

update linear and multifrontal groups

release/4.3a0
Varun Agrawal 2022-07-26 16:57:12 -04:00
parent 92e1014874
commit 6cac4d19f3
6 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
gtsam/inference/BayesTree.h
View File

@ -60,7 +60,7 @@ namespace gtsam {
* @tparam CLIQUE The type of the clique data structure, defaults to BayesTreeClique, normally do not change this
* as it is only used when developing special versions of BayesTree, e.g. for ISAM2.
*
* \addtogroup Multifrontal
* \ingroup Multifrontal
* \nosubgrouping
*/
template<class CLIQUE>

2
gtsam/inference/JunctionTree.h
View File

@ -43,7 +43,7 @@ namespace gtsam {
* The tree structure and elimination method are exactly analagous to the EliminationTree,
* except that in the JunctionTree, at each node multiple variables are eliminated at a time.
*
* \addtogroup Multifrontal
* \ingroup Multifrontal
* \nosubgrouping
*/
template<class BAYESTREE, class GRAPH>

2
gtsam/linear/GaussianJunctionTree.h
View File

@ -32,7 +32,7 @@ namespace gtsam {
* factors stored in each cluster. It can be eliminated into a Gaussian Bayes tree with the same
* structure, which is essentially doing multifrontal sparse matrix factorization.
*
* \addtogroup Multifrontal
* \ingroup Multifrontal
* \nosubgrouping
*/
class GTSAM_EXPORT GaussianJunctionTree :

4
gtsam/linear/HessianFactor.h
View File

@ -385,7 +385,7 @@ namespace gtsam {
* @param keys The variables to eliminate and their elimination ordering
* @return The conditional and remaining factor
*
* \addtogroup LinearSolving */
* \ingroup LinearSolving */
GTSAM_EXPORT std::pair<boost::shared_ptr<GaussianConditional>, boost::shared_ptr<HessianFactor> >
EliminateCholesky(const GaussianFactorGraph& factors, const Ordering& keys);
@ -403,7 +403,7 @@ GTSAM_EXPORT std::pair<boost::shared_ptr<GaussianConditional>, boost::shared_ptr
* @param keys The variables to eliminate and their elimination ordering
* @return The conditional and remaining factor
*
* \addtogroup LinearSolving */
* \ingroup LinearSolving */
GTSAM_EXPORT std::pair<boost::shared_ptr<GaussianConditional>, boost::shared_ptr<GaussianFactor> >
EliminatePreferCholesky(const GaussianFactorGraph& factors, const Ordering& keys);

2
gtsam/linear/JacobianFactor.h
View File

@ -365,7 +365,7 @@ namespace gtsam {
* @param keys The variables to eliminate in the order as specified here in \c keys
* @return The conditional and remaining factor
*
* \addtogroup LinearSolving */
* \ingroup LinearSolving */
friend GTSAM_EXPORT std::pair<boost::shared_ptr<GaussianConditional>, shared_ptr>
EliminateQR(const GaussianFactorGraph& factors, const Ordering& keys);

2
gtsam/symbolic/SymbolicJunctionTree.h
View File

@ -44,7 +44,7 @@ namespace gtsam {
* The tree structure and elimination method are exactly analagous to the EliminationTree,
* except that in the JunctionTree, at each node multiple variables are eliminated at a time.
*
* \addtogroup Multifrontal
* \ingroup Multifrontal
* \nosubgrouping
*/
class GTSAM_EXPORT SymbolicJunctionTree :