gtsam 4.2.0
gtsam
|
Disjoint set forest using an STL map data structure underneath Uses rank compression and union by rank, iterator version.
Public Types | |
typedef std::set< KEY > | Set |
Classes | |
struct | Entry |
We store the forest in an STL map, but parents are done with pointers. More... | |
Protected Types | |
typedef std::map< KEY, Entry > | Map |
typedef Map::iterator | iterator |
Protected Member Functions | |
iterator | find__ (const KEY &key) const |
Given key, find iterator to initial entry. | |
iterator | find_ (const iterator &it) const |
Given iterator to initial entry, find the root Entry. | |
iterator | find_ (const KEY &key) const |
Given key, find the root Entry. | |
Protected Attributes | |
Map | entries_ |