| 29 | } |
| 30 | |
| 31 | int calculate_depth(const NodeTree &nt, NodeID nid) |
| 32 | { |
| 33 | int depth = 0; |
| 34 | while (nid != NodeID::NoNode) |
| 35 | { |
| 36 | nid = nt.getParent(nid); |
| 37 | ++depth; |
| 38 | } |
| 39 | return depth; |
| 40 | } |
| 41 | |
| 42 | std::vector<NodeID> nodes_below(const tree::NodeTree &nt, NodeID nid) |
| 43 | { |
no test coverage detected