|
gtsam
|
The MetisIndex class converts a factor graph into the Compressed Sparse Row format for use in METIS algorithms.
Specifically, two vectors store the adjacency structure of the graph. It is built from a factor graph prior to elimination, and stores the list of factors that involve each variable.
Constructors | |
| MetisIndex () | |
| Default constructor, creates empty MetisIndex. | |
| template<class FactorGraphType> | |
| MetisIndex (const FactorGraphType &factorGraph) | |
Standard API | |
| template<class FactorGraphType> | |
| void | augment (const FactorGraphType &factors) |
| Augment the variable index with new factors. | |
| const std::vector< int32_t > & | xadj () const |
| const std::vector< int32_t > & | adj () const |
| size_t | nValues () const |
| Key | intToKey (int32_t value) const |
Testable | |
| void | print (const std::string &str="MetisIndex:") const |
| print to std::cout | |
Public Types | |
| typedef std::shared_ptr< MetisIndex > | shared_ptr |
| void gtsam::MetisIndex::augment | ( | const FactorGraphType & | factors | ) |
Augment the variable index with new factors.
This can be used when solving problems incrementally.