|
gtsam
3.2.1
gtsam
|
Inheritance diagram for gtsam::DSFVector:Public Member Functions | |
| DSFVector (const size_t numNodes) | |
| constructor that allocate new memory, uses sequential keys 0...numNodes-1 | |
| DSFVector (const std::vector< size_t > &keys) | |
| constructor that allocates memory, uses given keys | |
| DSFVector (const boost::shared_ptr< V > &v_in, const std::vector< size_t > &keys) | |
| constructor that uses the existing memory | |
| bool | isSingleton (const size_t &label) const |
| find whether there is one and only one occurrence for the given {label} | |
| std::set< size_t > | set (const size_t &label) const |
| get the nodes in the tree with the given label | |
|
std::map< size_t, std::set < size_t > > | sets () const |
| return all sets, i.e. a partition of all elements | |
|
std::map< size_t, std::vector < size_t > > | arrays () const |
| return all sets, i.e. a partition of all elements | |
Public Member Functions inherited from gtsam::DSFBase | |
| DSFBase (const size_t numNodes) | |
| constructor that allocate new memory, allows for keys 0...numNodes-1 | |
| DSFBase (const boost::shared_ptr< V > &v_in) | |
| constructor that uses the existing memory | |
| size_t | find (size_t key) const |
| find the label of the set in which {key} lives | |
| void | merge (const size_t &i1, const size_t &i2) |
| Merge two sets. | |
| size_t | findSet (size_t key) const |
| void | makeUnionInPlace (const size_t &i1, const size_t &i2) |
Additional Inherited Members | |
Public Types inherited from gtsam::DSFBase | |
| typedef std::vector< size_t > | V |
| Vector of ints. | |