#include <Tree.h>
Definition at line 18 of file Tree.h.
◆ Tree()
Tree::Tree |
( |
const std::vector< std::size_t > & |
parents | ) |
|
Definition at line 8 of file Tree.cxx.
14 for(
auto i = 1
u;
i < nParents; ++
i){
20 for(
auto i = 0
u;
i < nChildren; ++
i){
26 for(
auto i = 0
u;
i < nParents; ++
i){
27 if (
i == 0){
continue;}
◆ cbegin()
std::vector<std::size_t>::const_iterator Tree::cbegin |
( |
| ) |
const |
|
inline |
◆ cend()
std::vector<std::size_t>::const_iterator Tree::cend |
( |
| ) |
const |
|
inline |
◆ depth()
std::size_t Tree::depth |
( |
std::size_t |
n | ) |
const |
◆ firstGeneration()
const std::vector< std::size_t > & Tree::firstGeneration |
( |
| ) |
const |
◆ is_leaf()
bool Tree::is_leaf |
( |
size_t |
| ) |
const |
◆ is_simple()
bool Tree::is_simple |
( |
| ) |
const |
Definition at line 64 of file Tree.cxx.
70 [](
const auto&
e) {return e == 0;});
◆ leaves()
const std::vector< std::size_t > & Tree::leaves |
( |
| ) |
const |
◆ parent()
std::size_t Tree::parent |
( |
std::size_t |
k | ) |
const |
◆ siblings()
std::vector< std::size_t > Tree::siblings |
( |
std::size_t |
k | ) |
const |
◆ size()
std::size_t Tree::size |
( |
| ) |
const |
◆ m_children
std::vector<std::vector<std::size_t> > Tree::m_children |
|
private |
◆ m_firstGeneration
std::vector<std::size_t> Tree::m_firstGeneration |
|
private |
◆ m_leaves
std::vector<std::size_t> Tree::m_leaves |
|
private |
◆ m_parents
std::vector<std::size_t> Tree::m_parents |
|
private |
The documentation for this class was generated from the following files: