|
| TreeIterator (Tree< Data_Type > *tree) |
|
v_uint::const_iterator | begin_off () const |
| Begin of offpring const_iterator on the current node.
|
|
v_uint::const_iterator | end_off () const |
| End of offpring const_iterator on the current node.
|
|
v_uint::const_iterator | begin_par () const |
| Begin of parents const_iterator on the current node.
|
|
v_uint::const_iterator | end_par () const |
| End of parents const_iterator on the current node.
|
|
int | up () |
| Sets the current_node to the next value as specified in Tree::POSTORDER.
|
|
int | down () |
| Sets the current_node to the previous value as specified in Tree::POSTORDER.
|
|
int | operator++ () |
|
int | operator-- () |
|
void | top () |
|
void | bottom () |
|
uint | id () const |
| Returns the id (index) of the current node.
|
|
int | n_offspring () const |
| Return the number of offsprings the current node has.
|
|
int | n_parents () const |
| Return the number of parents the current node has.
|
|
uint | operator* () const |
|
bool | is_root () const |
| Check whether the current node is root.
|
|
bool | is_tip () const |
| Checks whether the current node is a tip (leaf) or not.
|
|
uint | front () const |
|
uint | back () const |
|
The documentation for this class was generated from the following files: