Tekkotsu Homepage | Demos | Overview | Downloads | Dev. Resources | Reference | Credits |
AprilTags::UnionFindSimple Class ReferenceImplementation of disjoint set data structure using the union-find algorithm. More...
Detailed DescriptionImplementation of disjoint set data structure using the union-find algorithm. Definition at line 9 of file UnionFindSimple.h.
Constructor & Destructor Documentation
Definition at line 17 of file UnionFindSimple.h. Member Function Documentation
Returns the id of the merged node. Definition at line 25 of file UnionFindSimple.cc. Referenced by AprilTags::Edge::mergeEdges().
Definition at line 6 of file UnionFindSimple.cc. Referenced by connectNodes(), getSetSize(), and AprilTags::Edge::mergeEdges().
Definition at line 21 of file UnionFindSimple.h. Referenced by AprilTags::Edge::mergeEdges().
Definition at line 46 of file UnionFindSimple.cc. Referenced by UnionFindSimple().
Definition at line 20 of file UnionFindSimple.cc. Member Data Documentation
Definition at line 36 of file UnionFindSimple.h. Referenced by connectNodes(), getRepresentative(), getSetSize(), init(), and printDataVector(). The documentation for this class was generated from the following files: |
Tekkotsu v5.1CVS |
Generated Mon May 9 04:59:19 2016 by Doxygen 1.6.3 |