UnionFind calculates connected subsets.
More...
#include <btUnionFind.h>
UnionFind calculates connected subsets.
Definition at line 35 of file btUnionFind.h.
§ btUnionFind()
| btUnionFind::btUnionFind |
( |
| ) |
|
§ ~btUnionFind()
| btUnionFind::~btUnionFind |
( |
| ) |
|
§ allocate()
| void btUnionFind::allocate |
( |
int |
N | ) |
|
§ find() [1/2]
| int btUnionFind::find |
( |
int |
p, |
|
|
int |
q |
|
) |
| |
|
inline |
§ find() [2/2]
| int btUnionFind::find |
( |
int |
x | ) |
|
|
inline |
§ Free()
| void btUnionFind::Free |
( |
| ) |
|
§ getElement() [1/2]
| btElement& btUnionFind::getElement |
( |
int |
index | ) |
|
|
inline |
§ getElement() [2/2]
| const btElement& btUnionFind::getElement |
( |
int |
index | ) |
const |
|
inline |
§ getNumElements()
| int btUnionFind::getNumElements |
( |
| ) |
const |
|
inline |
§ isRoot()
| bool btUnionFind::isRoot |
( |
int |
x | ) |
const |
|
inline |
§ reset()
| void btUnionFind::reset |
( |
int |
N | ) |
|
§ sortIslands()
| void btUnionFind::sortIslands |
( |
| ) |
|
this is a special operation, destroying the content of btUnionFind.
it sorts the elements, based on island id, in order to make it easy to iterate over islands
Definition at line 64 of file btUnionFind.cpp.
§ unite()
| void btUnionFind::unite |
( |
int |
p, |
|
|
int |
q |
|
) |
| |
|
inline |
§ m_elements
The documentation for this class was generated from the following files:
