19 namespace perception {
39 while (y->parent != y) {
45 while (w->parent != w) {
57 if (y == x || y->parent == y) {
76 if (x->node_rank < y->node_rank) {
79 }
else if (y->node_rank < x->node_rank) {
T * DisjointSetFindLoop(T *x)
Definition: disjoint_set.h:37
void DisjointSetUnion(T *x, T *y)
Definition: disjoint_set.h:70
T * DisjointSetFindRecursive(T *x)
Definition: disjoint_set.h:29
PlanningContext is the runtime context in planning. It is persistent across multiple frames...
Definition: atomic_hash_map.h:25
T * DisjointSetFind(T *x)
Definition: disjoint_set.h:55
void DisjointSetMakeSet(T *x)
Definition: disjoint_set.h:23
void DisjointSetMerge(T *x, const T *y)
Definition: disjoint_set.h:67